Lonestar: A suite of parallel irregular programs

ISPASS 2009 - International Symposium on Performance Analysis of Systems and Software

Volumn , Issue , 2009, Pages 65-76

  Kulkarni, Milind ^a   Burtschera, Martin ^a   Caşcavalb, Čalin ^b   Pingalia, Keshav ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b IBIBM TJ Watson Research Center   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC FOUNDATIONS; APPLICATION DOMAINS; BENCHMARK SUITES; DATA PARALLELISM; DENSE MATRICES; DESIGN AUTOMATIONS; MACHINE-LEARNING; MULTI CORE; SPARSE GRAPHS; SURVEY PROPAGATION; TARGET DOMAIN;

COMPUTER AIDED DESIGN; COMPUTER SOFTWARE;

PARALLEL PROGRAMMING;

EID: 70349191933     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPASS.2009.4919639     Document Type: Conference Paper

References (22)

1. V. Aslot, R. Eigenmann, G. Gaertner, W. B. Jones, and B. Parady. Specomp: A new benchmark suite for measuring parallel computer performance. In In Workshop on OpenMP Applications and Tools, pages 1-10, 2001.
2. D. Bailey, T. Harris,W. Saphir, R. van derWijngaart, A.Woo, and M. Yarrow. The NAS parallel benchmarks 2.0. Technical Report NAS-95-020, NASA Ames Research Center, Dec. 1995.
3. J. Barnes and P. Hut. A hierarchical O(N log N) force-calculation algorithm. Nature, 324(4):446-559, December 1986.
4. M. Berry, D. Chen, P. Koss, D. Kuck, S. Lo, Y. Pang, L. Pointer, R. Roloff, A. Sameh, E. Clementi, S. Chin, D. Schneider, G. Fox, P. Messina, D. Walker, C. Hsiung, J. Schwarzmeier, K. Lue, S. Orszag, F. Seidl, O. Johnson, and R. Goodrum. The perfect club benchmarks: Effective performance evaluation of supercomputers. International Journal of Supercomputer Applications, 3:5-40, 1989.
5. C. Bienia, S. Kumar, J. P. Singh, and K. Li. The PARSEC benchmark suite: Characterization and architectural implications. In Proceedings of the 17th International Conference on Parallel Architectures and Compilation Techniques, October 2008.
6. A. Braunstein, M. Mézard, and R. Zecchina. Survey propagation: An algorithm for satisfiability. Random Structures and Algorithms, 27:201-226, 2005.
7. M. Burtscher, M. Kulkarni, D. Prountzos, and K. Pingali. On the scalability of an automatically parallelized irregular application. In Languages and Compilers for Parallel Computing (LCPC), 2008.
8. L. P. Chew. Guaranteed-quality mesh generation for curved surfaces. In SCG '93: Proceedings of the ninth annual symposium on Computational geometry, 1993.
9. G. Contreras and M. Martonosi. Characterizing and improving the performance of the Intel Threading Building Blocks. In IISWC 2008: IEEE International Symposium on Workload Characterization, Seattle, WA, Sept. 2008.
10. T. Cormen, C. Leiserson, R. Rivest, and C. Stein, editors. Introduction to Algorithms. MIT Press, 2001.
11. L. J. Guibas, D. E. Knuth, and M. Sharir. Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica, 7(1):381-413, December 1992.
12. M. Kulkarni, M. Burtscher, R. Inkulu, K. Pingali, and C. Cascaval. How much parallelism is there in irregular applications? In Principles and Practices of Parallel Programming (PPoPP), pages 3-14, 2009.
13. M. Kulkarni, K. Pingali, B. Walter, G. Ramanarayanan, K. Bala, and L. P. Chew. Optimistic parallelism requires abstractions. SIGPLAN Not. (Proceedings of PLDI 2007), 42(6):211-222, 2007.
14. J. Larus and R. Rajwar. Transactional Memory (Synthesis Lectures on Computer Architecture). Morgan & Claypool Publishers, 2007.
15. C.-K. Luk, R. Cohn, R. Muth, H. Patil, A. Klauser, G. Lowney, S. Wallace, V. J. Reddi, and K. Hazelwood. PIN: Building customized program analysis tools with dynamic instrumentation. In Proceedings of the 2005 ACM SIGPLAN Conference on Programming Language Design and Implementation, June 2005.
16. C. C. Minh, J. Chung, C. Kozyrakis, and K. Olukotun. STAMP: Stanford transactional applications for multi-processing. In IISWC 2008: IEEE International Symposium on Workload Characterization, Seattle, WA, Sept. 2008.
17. J. Misra. Distributed discrete-event simulation. ACM Comput. Surv., 18(1):39-65, 1986.
18. A. Rogers, M. C. Carlisle, J. H. Reppy, and L. J. Hendren. Supporting dynamic data structures on distributed-memory machines. ACM Trans. Program. Lang. Syst., 17(2):233-263, 1995.
19. P.-N. Tan, M. Steinbach, and V. Kumar, editors. Introduction to Data Mining. Pearson Addison Wesley, 2005.
20. B. Walter, K. Bala, M. Kulkarni, and K. Pingali. Fast agglomerative clustering for rendering. In IEEE Symposium on Interactive Ray Tracing (RT), 2008.
21. B. Walter, S. Fernandez, A. Arbree, K. Bala, M. Donikian, and D. Greenberg. Lightcuts: a scalable approach to illumination. ACM Transactions on Graphics (SIGGRAPH), 24(3):1098-1107, July 2005.
22. S. C. Woo, M. Ohara, E. Torrie, J. P. Singh, and A. Gupta. The SPLASH-2 programs: characterization and methodological considerations. In ISCA '95: Proceedings of the 22nd annual international symposium on Computer architecture, pages 24-36, New York, NY, USA, 1995. ACM.