Processor allocation for optimistic parallelization of irregular programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7333 LNCS, Issue PART 1, 2012, Pages 1-14

  Versaci, Francesco ^a,b   Pingali, Keshav ^c  

^a UNIVERSITY OF PADOVA   (Italy)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^c UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Amorphous data parallelism; Automatic parallelization; Irregular algorithms; Optimistic parallelization; Processor allocation; Tur n's theorem; Unfriendly seating

Indexed keywords

AUTOMATIC PARALLELIZATION; DATA PARALLELISM; PARALLELIZATIONS; PROCESSOR ALLOCATION; UNFRIENDLY SEATING;

ALGORITHMS;

PARALLEL PROCESSING SYSTEMS;

EID: 84863896884     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31125-3_1     Document Type: Conference Paper

References (23)

1. Agrawal, K., Leiserson, C.E., He, Y., Hsu, W.J.: Adaptive work-stealing with parallelism feedback. ACM Trans. Comput. Syst. 26(3), 7:1-7:32 (2008), http://doi.acm.org/10.1145/1394441.1394443
2. Alon, N., Spencer, J.: The probabilistic method. Wiley-Interscience (2000)
3. An, P., Jula, A., Rus, S., Saunders, S., Smith, T.G., Tanase, G., Thomas, N., Amato, N.M., Rauchwerger, L.: Stapl: An Adaptive, Generic Parallel C++ Library. In: Dietz, H.G. (ed.) LCPC 2001. LNCS, vol. 2624, pp. 193-208. Springer, Heidelberg (2003)
4. Blackford, L.S., Choi, J., Cleary, A., D'Azevedo, E., Demmel, J., Dhillon, I., Dongarra, J., Hammarling, S., Henry, G., Petitet, A., Stanley, K., Walker, D., Whaley, R.C.: ScaLAPACK Users' Guide. Society for Industrial and Applied Mathematics, Philadelphia (1997)
5. Braunstein, A., Mézard, M., Zecchina, R.: Survey propagation: An algorithm for satisfiability. Random Struct. Algorithms 27(2), 201-226 (2005)
6. Eppstein, D.: Spanning trees and spanners. In: Sack, J., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 425-461. Elsevier (2000)
7. Freedman, D., Shepp, L.: Problem 62-3, an unfriendly seating arrangement. SIAM Review 4(2), 150 (1962), http://www.jstor.org/stable/2028372
8. Friedman, H.D., Rothman, D., MacKenzie, J.K.: Problem 62-3. SIAM Review 6(2), 180-182 (1964), http://www.jstor.org/stable/2028090
9. Frigo, M., Johnson, S.G.: The design and implementation of FFTW3. Proceedings of the IEEE 93(2), 216-231 (2005); special issue on Program Generation, Optimization, and Platform Adaptation
10. Frigo, M., Leiserson, C.E., Randall, K.H.: The implementation of the Cilk-5 multithreaded language. In: PLDI, pp. 212-223 (1998)
11. Georgiou, K., Kranakis, E., Krizanc, D.: Random maximal independent sets and the unfriendly theater seating arrangement problem. Discrete Mathematics 309(16), 5120-5129 (2009), http://www.sciencedirect.com/science/article/B6V00- 4W55T4X-2/2/72d38a668c737e68edf497512e606e12
12. Guibas, L.J., Knuth, D.E., Sharir, M.: Randomized incremental construction of delaunay and voronoi diagrams. Algorithmica 7(4), 381-413 (1992)
13. Jensen, J.: Sur les fonctions convexes et les inégalités entre les valeurs moyennes. Acta Mathematica 30(1), 175-193 (1906)
14. Kalé, L.V., Krishnan, S.: Charm++: A portable concurrent object oriented system based on C++. In: OOPSLA, pp. 91-108 (1993)
15. Kulkarni, M., Burtscher, M., Cascaval, C., Pingali, K.: Lonestar: A suite of parallel irregular programs. In: ISPASS, pp. 65-76. IEEE (2009)
16. Kulkarni, M., Burtscher, M., Inkulu, R., Pingali, K., Cascaval, C.: How much parallelism is there in irregular applications? In: Reed, D.A., Sarkar, V. (eds.) PPOPP, pp. 3-14. ACM (2009)
17. Méndez-Lojo, M., Nguyen, D., Prountzos, D., Sui, X., Hassaan, M.A., Kulkarni, M., Burtscher, M., Pingali, K.: Structure-driven optimizations for amorphous dataparallel programs. In: Govindarajan, R., Padua, D.A., Hall, M.W. (eds.) PPOPP, pp. 3-14. ACM (2010)
18. Pingali, K., Nguyen, D., Kulkarni, M., Burtscher, M., Hassaan, M.A., Kaleem, R., Lee, T.H., Lenharth, A., Manevich, R., Méndez-Lojo, M., Prountzos, D., Sui, X.: The tao of parallelism in algorithms. In: Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2011, pp. 12-25. ACM, New York (2011), http://doi.acm.org/ 10.1145/1993498.1993501
19. Püschel, M., Moura, J., Johnson, J., Padua, D., Veloso, M., Singer, B., Xiong, J., Franchetti, F., Gacic, A., Voronenko, Y., Chen, K., Johnson, R., Rizzolo, N.: Spiral: Code generation for dsp transforms. Proceedings of the IEEE 93(2), 232-275 (2005)
20. Reinders, J.: Intel threading building blocks. O'Reilly & Associates, Inc., Sebastopol (2007)
21. Tan, P.N., Steinbach, M., Kumar, V.: Introduction to Data Mining. Addison- Wesley (2005)
22. Tao, T.: Additive combinatorics. Cambridge University Press (2006)
23. Versaci, F., Pingali, K.: Brief announcement: processor allocation for optimistic parallelization of irregular programs. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2011, pp. 261-262. ACM, New York (2011), http://doi.acm.org/10.1145/1989493.1989533