Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arndt, J.: Matters Computational (2009), http://www.jjj.de/fxt/
Baeza-Yates, R., Gonnet, G.H.: A new approach to text searching. Commun. ACM 35(10), 74–82 (1992)
He, L., Fang, B., Sui, J.: The wide window string matching algorithm. Theor. Comput. Sci. 332(1-3), 391–404 (2005)
Hyyrö, H., Fredriksson, K., Navarro, G.: Increased bit-parallelism for approximate and multiple string matching. J. Exp. Algorithmics 10(2.6), 1–27 (2005)
Kaplan, K., Burge III, L.L., Garuba, M.: A parallel algorithm for approximate string matching. In: Arabnia, H.R., Mun, Y. (eds.) Proc. of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2003, pp. 1844–1848 (2003)
Lin, W., Liu, B.: Pipelined parallel AC-based approach for multi-string matching. In: Proc. 14th International Conference on Parallel and Distributed Systems (ICPADS 2008), pp. 665–672 (2008)
Michailidis, P.D., Margaritis, K.G.: A programmable array processor architecture for flexible approximate string matching algorithms. J. Parallel Distrib. Comput. 67(2), 131–141 (2007)
Navarro, G., Raffinot, M.: A bit-parallel approach to suffix automata: Fast extended string matching. In: Farach-Colton, M. (ed.) CPM 1998. LNCS, vol. 1448, pp. 14–33. Springer, Heidelberg (1998)
Peltola, H., Tarhio, J.: Alternative algorithms for bit-parallel string matching. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds.) SPIRE 2003. LNCS, vol. 2857, pp. 80–94. Springer, Heidelberg (2003)
Semé, D., Youlou, S.: Parallel algorithms for string matching problems on a linear array with reconfigurable pipelined bus system. In: Oudshoorn, M.J., Rajasekaran, S. (eds.) Proc. of the ISCA 18th International Conference on Parallel and Distributed Computing Systems, pp. 55–60 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cantone, D., Faro, S., Giaquinta, E. (2010). Bit-(Parallelism)2: Getting to the Next Level of Parallelism. In: Boldi, P., Gargano, L. (eds) Fun with Algorithms. FUN 2010. Lecture Notes in Computer Science, vol 6099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13122-6_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-13122-6_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13121-9
Online ISBN: 978-3-642-13122-6
eBook Packages: Computer ScienceComputer Science (R0)