SIMD parallelization of applications that traverse irregular data structures

Proceedings of the 2013 IEEE/ACM International Symposium on Code Generation and Optimization, CGO 2013

Volumn , Issue , 2013, Pages

  Ren, Bin ^a   Agrawal, Gagan ^a   Larus, James R ^b   Mytkowicz, Todd ^b   Poutanen, Tomi ^b   Schulte, Wolfram ^b  

^a Ohio State University   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Fine Grained Parallelism; Irregular Data Structure; SIMD

Indexed keywords

ARITHMETIC OPERATIONS; COMPACTION METHODS; FINE-GRAINED PARALLELISM; INTERMEDIATE LANGUAGES; IRREGULAR DATA STRUCTURES; MEMORY LATENCIES; PARALLELIZATIONS; SIMD;

NETWORK COMPONENTS; OPTIMIZATION; PROGRAM PROCESSORS;

DATA STRUCTURES;

EID: 84876909157     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CGO.2013.6494989     Document Type: Conference Paper

References (37)

1. G. E. Blelloch, S. Chatterjee, J. C. Hardwick, J. Sipelstein, and M. Zagha. Implementation of a Portable Nested Data-Parallel Language. Journal of Parallel and Distributed Computing, 21(1):4-14, apr 1994.
2. L. Breiman. Random Forests. Machine Learning, 45:5-32, 2001.
3. S. Campanoni, T. Jones, G. Holloway, V. J. Reddi, G. Y. Wei, and D. Brooks. HELIX: Automatic Parallelization of Irregular Programs for Chip Multiprocessing. In Proceedings of the Tenth International Symposium on Code Generation and Optimization (CGO 2012), pages 84-93. ACM, 2012.
4. N. Cascarano, P. Rolando, F. Risso, and R. Sisto. iNFAnt: NFA Pattern Matching on GPGPU Devices. ACM SIGCOMM Computer Communication Review (SIGCOMM 2010), 40(5):20-26, 2010.
5. S. Chatterjee, G. E. Blelloch, and M. Zagha. Scan Primitives for Vector Computers. In Proceedings of the 1990 ACM/IEEE Conference on Supercomputing (SC 1990), pages 666-675, November 1990.
6. T. M. Chilimbi, M. D. Hill, and J. R. Larus. Cache-Conscious Structure Layout. In Proceedings of the 1999 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 1999), pages 1-12. ACM, 1999.
7. Russ Cox. Regular Expression Matching Can Be Simple and Fast. http://swtch. com/ rsc/regexp/regexp1. html, January 2007.
8. H. G. Dietz and W. E. Cohen. AMassively ParallelMIMD Implemented by SIMD Hardware? Technical report, Purdue University, 1992.
9. F. Franchetti and M. Puschel. In Proceedings of the 2002 IEEE International Parallel and Distributed Processing Symposium (IPDPS 2002).
10. A. Frank and A. Asuncion. UCI Machine Learning Repository, 2010.
11. C. Garca, R. Lario, M. Prieto, L. Piuel, and F. Tirado. Vectorization of Multigrid Codes Using SIMD ISA Extensions. Proceedings of the 2003 IEEE Inernational Parallel and Distributed Processing Symposium (IPDPS 2003), 0:58a, 2003.
12. R. Ghiya, L. J. Hendren, and Y. Zhu. Detecting Parallelism in C Programs with Recursive Data Structures. In Proceedings of 7th International Conference on Compiler Construction (CC 1998), pages 159-173. Springer, 1998.
13. J. Han, H. Cheng, D. Xin, and X. Yan. Frequent Pattern Mining: Current Status and Future Directions. Data Mining and Knowledge Discovery, 15:55-86, 2007.
14. R. v. Hanxleden and K. Kennedy. Relaxing SIMD Control Flow Constraints using Loop Transformations. In PLDI, pages 188-199. ACM, 1992.
15. J. C. Hardwick. An Efficient Implementation of Nested Data Parallelism for Irregular Divide-and-Conquer Algorithms. In Proceedings of the First International Workshop on High-Level Programming Models and Supportive Environments (HIPS 1996), pages 105-114, April 1996.
16. S. Hong, T. Oguntebi, and K. Olukotun. Efficient Parallel Graph Exploration on Multi-Core CPU and GPU. In Proceedings of the 2011 International Conference on Parallel Architectures and Compilation Techniques (PACT 2011), pages 78-88. IEEE, 2011.
17. N. Ide, M. Hirano, Y. Endo, S. Yoshioka, H. Murakami, A. Kunimatsu, T. Sato, T. Kamei, T. Okada, and M. Suzuoki. 2. 44-GFLOPS 300-MHz Floating-Point Vector-Processing Unit for High-Performance 3D Graphics Computing. IEEE Journal of Solid-State Circuits, 35(7):1025-1033, Jul 2000.
18. Y. Jo andM. Kulkarni. Enhancing Locality for Recursive Traversals of Recursive Structures. In Proceedings of the 2011 ACM International Conference on Object Oriented Programming Systems Languages and Applications (OOPSLA 2011), pages 463-482. ACM, 2011.
19. Junichiro and Makino. Vectorization of a Treecode. Journal of Computational Physics, 87(1):148-160, 1990.
20. C. Kim, J. Chhugani, N. Satish, E. Sedlar, A. D. Nguyen, T. Kaldewey, V. W. Lee, S. A. Brandt, and P. Dubey. FAST: Fast Architecture Sensitive Tree Search on Modern CPUs and GPUs. In Proceedings of the 2010 International Conference on Management of Data (SIGMOD 2010), pages 339-350. ACM, 2010.
21. M. Kulkarni, M. Burtscher, R. Inkulu, K. Pingali, and C. Casçaval. How Much Parallelism is There in Irregular Applications? In Proceedings of the 14th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2009). ACM, 2009.
22. Lars and Hernquist. Vectorization of Tree Traversals. Journal of Computational Physics, 87(1):137-147, 1990.
23. M. Méndez-Lojo, D. Nguyen, D. Prountzos, X. Sui, M. A. Hassaan, M. Kulkarni, M. Burtscher, and K. Pingali. Structure-Driven Optimizations for Amorphous Data-Parallel Programs. In PPOPP, pages 3-14. ACM, 2010.
24. D. Merrill, M. Garland, and A. Grimshaw. Scalable GPU Graph Traversal. In Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2012), pages 117-128. ACM, 2012.
25. J. S. Moore and R. S. Boyer. A Fast String SearchingAlgorithm. Communications of the ACM, pages 762-772, 1977.
26. M. Nicola and J. John. XML Parsing: a Threat to Database Performance. In Proceedings of the Twelfth International Conference on Information and Knowledge Management (CIKM 2003), pages 175-178. ACM, 2003.
27. G. Ottoni, R. Rangan, A. Stoler, and D. I. August. Automatic Thread Extraction with Decoupled Software Pipelining. In Proceedings of 38th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO 2005), pages 12-pp. IEEE, 2005.
28. J. Prins and D. W. Palmer. Transforming High-Level Data-Parallel Programs into Vector Operations. In PPOPP, pages 119-128. ACM, 1993.
29. M. Roesch. Snort-Lightweight Intrusion Detection for Networks. In Proceedings of the 13th USENIX Conference on System Administration (LISA 1999), pages 229-238. USENIX, 1999.
30. T. Rognes and E. Seeberg. Six-Fold Speed-up of Smithwaterman Sequence Database Searches Using Parallel Processing on Common Microprocessors. 16(8):699-706, 2000.
31. D. P. Scarpazza and G. F. Russell. High-Performance Regular Expression Scanning on the Cell/B. E. Processor. In Proceedings of the 23rd International Conference on Supercomputing (ICS 2009), pages 14-25. ACM, 2009.
32. J. Sewall, J. Chhugani, C. Kim, N. Satish, and P. Dubey. PALM: Parallel Architecture-Friendly Latch-FreeModifications to B+ Trees on Many-Core Processors. PVLDB, 4(11):795-806, 2011.
33. T. Sharp. Implementing Decision Trees and Forests on a GPU. In Computer Vision ECCV 2008, volume 5305 of Lecture Notes in Computer Science, pages 595-608. Springer Berlin / Heidelberg, 2008.
34. K. Thompson. Programming Techniques: Regular Expression Search Algorithm. Commun. ACM, 11:419-422, June 1968.
35. G. Vasiliadis, M. Polychronakis, S. Antonatos, E. Markatos, and S. Ioannidis. Regular Expression Matching on Graphics Hardware for Intrusion Detection. In Recent Advances in Intrusion Detection, volume 5758 of Lecture Notes in Computer Science, pages 265-283. Springer Berlin / Heidelberg, 2009.
36. X. Yan and J. Han. gSpan: Graph-Based Substructure Pattern Mining. In Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), pages 721-724. IEEE, 2002.
37. Y. Zu, M. Yang, Z. Xu, L. Wang, X. Tian, K. Peng, and Q. Dong. GPU-based NFA Implementation for Memory Efficient High Speed Regular Expression Matching. In Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming (PPoPP 2012), pages 129-140. ACM, 2012.