We investigate the problem of getting to a higher instruction-level parallelism in string matching algorithms. In particular, starting from an algorithm based on bit-parallelism, we propose two flexible approaches for boosting it with a higher level of parallelism. These approaches are general enough to be applied to other bit-parallel algorithms. It turns out that higher levels of parallelism lead to more efficient solutions in practical cases, as demonstrated by an extensive experimentation.
|Titolo:||Bit-Parallelism$^2$: Getting to the Next Level of Parallelism|
|Data di pubblicazione:||2010|
|Appare nelle tipologie:||4.1 Contributo in Atti di convegno|