Data-parallel finite-state machines

International Conference on Architectural Support for Programming Languages and Operating Systems - ASPLOS

Volumn , Issue , 2014, Pages 529-541

  Mytkowicz, Todd ^a   Musuvathi, Madanlal ^a   Schulte, Wolfram ^b  

^a MICROSOFT RESEARCH   (United States)

^b MICROSOFT   (United States)

Author keywords

Finite state machines; Huffman decoding; Parallelism; Regular expression matching

Indexed keywords

DATA PARALLEL; DATA PARALLELISM; HUFFMAN DECODING; LINEAR SPEED-UP; MULTIPLE PROCESSORS; PARALLELISM; REGULAR EXPRESSIONS; REGULAR-EXPRESSION MATCHING;

ASYNCHRONOUS MACHINERY; BENCHMARKING; DECODING; FINITE AUTOMATA; OBJECT ORIENTED PROGRAMMING; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES;

PATTERN MATCHING;

EID: 84897807567     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2541940.2541988     Document Type: Conference Paper

References (36)

1. G. E. Blelloch. Prefix sums and their applications. Technical Report CMU-CS-90-190, School of Computer Science, Carnegie Mellon University, Nov. 1990.
2. J. A. Brzozowski. Canonical regular expressions and minimal state graphs for definite events. Mathematical Theory of Automata, 12:529-561, 1962.
3. R. D. Cameron, E. Amiri, K. S. Herdy, D. Lin, T. C. Shermer, and F. Popowich. Parallel scanning with bitstream addition: An XML case study. In European Conference on Parallel and Distributed Computing, Part II, pages 2-13, 2011.
4. B. Catanzaro, N. Sundaram, and K. Keutzer. A map reduce framework for programming graphics processors. In In Work-shop on Software Tools for MultiCore Systems, 2008.
5. R. L. Cloud, M. L. Curry, H. L. Ward, A. Skjellum, and P. Bangalore. Accelerating lossless data compression with GPUs. Computing Research Repository (CoRR), abs/1107.1525, 2011.
6. J. Dean and S. Ghemawat. MapReduce: Simplified data processing on large clusters. Commun. ACM, 51(1):107-113, Jan. 2008.
7. B. He, W. Fang, Q. Luo, N. K. Govindaraju, and T. Wang. Mars: A MapReduce framework on graphics processors. In International Conference on Parallel Architectures and Com-pilation Techniques, PACT '08, pages 260-269, 2008.
8. W. D. Hillis and G. L. Steele. Data parallel algorithms. In Commun. ACM, volume 29, pages 1170-1183, Dec 1986.
9. J. Holub and S. Štekr. On parallel implementations of deterministic finite automata. In Implementation and Application of Automata, CIAA '09, pages 54-64, 2009.
10. J. E. Hopcroft and J. D. Ullman. Formal languages and their relation to automata. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1969.
11. P. Howard and J. Vitter. Parallel lossless image compression using Huffman and arithmetic coding. In Data Compression Conference, 1992. DCC ?92., pages 299-308, March 1992.
12. Intel Haswell Microarchitecture, 2013. URL http://software.intel.com/en- us/haswell.
13. C. G. Jones, R. Liu, L. Meyerovich, K. Asanović, and R. Bodík. Parallelizing the web browser. In Hot Topics in Parallelism (HotPar), pages 7-7, 2009.
14. S. T. Klein, Y. Wiseman, S. T. Klein, and Y. Wiseman. Parallel Huffman decoding with applications to JPEG files. The Computer Journal, 46:487-497, 2003.
15. R. E. Ladner and M. J. Fischer. Parallel prefix computation. Journal of the ACM, 27(4):831-838, 1980.
16. libhuffman. URL http://huffman.sourceforge.net/.
17. C.-H. Lin and C.-W. Jen. Low power parallel Huffman decoding. Electronics Letters, 34(3):240-241, Feb 1998.
18. D. Lin, N. Medforth, K. S. Herdy, A. Shriraman, and R. D. Cameron. Parabix: Boosting the efficiency of text processing on commodity processors. In High Performance Computer Architecture (HPCA), pages 373-384, 2012.
19. D. Luchaup, R. Smith, C. Estan, and S. Jha. Speculative parallel pattern matching. IEEE Transactions on Information Forensics and Security, 6(2):438-451, June 2011.
20. G. H. Mealy. A method for synthesizing sequential circuits. Bell System Technical Journal, 34(5):1045-1079, 1955.
21. G. Navarro. NR-grep: A fast and flexible pattern matching tool. Software: Practice and Experience, 31(13):1265-1312, 2001.
22. Y. Pan, Y. Zhang, and K. Chiu. Simultaneous transducers for data-parallel XML parsing. International Symposium on Parallel and Distributed Processing, pages 1-12, 2008.
23. V. Paxson. flex-fast lexical analyzer generator, 1988.
24. G. R. Prakash Prabhu and K. Vaswani. Safe programmable speculative parallelism. In Programming Languages Design and Implementation (PLDI), June 2010.
25. Project Gutenberg. URL http://www.gutenberg.org/.
26. G. Ren, P. Wu, and D. Padua. Optimizing data permutations for SIMD devices. In Programming Languages Design and Implementation (PLDI), pages 118-131, 2006.
27. M. Roesch. Snort-Lightweight intrusion detection for networks. In Proceedings of the 13th USENIX conference on System administration, LISA ?99, pages 229-238, 1999.
28. D. P. Scarpazza and G. F. Russell. High-performance regular expression scanning on the Cell/B.E. processor. In Interna-tional Conf. on Supercomputing, ICS '09, pages 14-25, 2009.
29. S. Sengupta, M. Harris, Y. Zhang, and J. Owens. Scan primitives for GPU computing. In SIGGRAPH/EUROGRAPH-ICS Symposium on Graphics Hardware, pages 97-106. Eurographics Association, 2007.
30. P. Sutton. Partial character decoding for improved regular expression matching in FPGAs. In Field-Programmable Tech-nology, pages 25-32, Dec. 2004.
31. J. Talbot, R. M. Yoo, and C. Kozyrakis. Phoenix++: Modular MapReduce for shared-memory systems. In Workshop on MapReduce and its Applications, pages 9-16, 2011.
32. G. Vasiliadis, M. Polychronakis, S. Antonatos, E. Markatos, and S. Ioannidis. Regular expression matching on graphics hardware for intrusion detection. In Recent Advances in In-trusion Detection, volume 5758, pages 265-283. 2009.
33. B. Wei and T. Meng. A parallel decoder of programmable Huffman codes. Circuits and Systems for Video Technology, 5 (2):175-178, Apr 1995.
34. Y.-H. E. Yang, W. Jiang, and V. K. Prasanna. Compact architecture for high-throughput regular expression matching on FPGA. In Architectures for Networking and Communications Systems, ANCS '08, pages 30-39, 2008.
35. F. Yu, Z. Chen, Y. Diao, T. V. Lakshman, and R. H. Katz. Fast and memory-efficient regular expression matching for deep packet inspection. In Architecture for Networking and Communications Systems, ANCS '06, pages 93-102, 2006.
36. Y. Yu, M. Isard, D. Fetterly, M. Budiu, U. Erlingsson, P. K. Gunda, and J. Currey. DryadLINQ: A system for generalpurpose distributed data-parallel computing using a high-level language. In Operating Systems Design and Implementation, OSDI'08, pages 1-14, 2008.