Parallel programming with object assemblies

Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications, OOPSLA

Volumn , Issue , 2009, Pages 61-80

  Lublinerman, Roberto ^a   Chaudhuri, Swarat ^a   Černý, Pavol ^b  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Data parallelism; Irregular parallelism; Ownership; Parallel programming; Programming abstractions

Indexed keywords

ALIASING; DATA CENTRIC; DATA PARALLELISM; EPIDEMIC SIMULATIONS; IRREGULAR DATA; LOCAL REGION; MANY-TO-ONE; MEMORY ACCESS; MERGE OPERATIONS; MESH REFINEMENT; NATURAL PROGRAMMING; PARALLEL PROGRAMMING MODEL; PROGRAMMING ABSTRACTIONS; SHARED DATA STRUCTURE; SPLIT OPERATIONS;

ABSTRACTING; ACCESS CONTROL; DATA STRUCTURES; JAVA PROGRAMMING LANGUAGE; LINGUISTICS; OBJECT ORIENTED PROGRAMMING; PARALLEL PROGRAMMING; SIMULATORS;

COMPUTER SYSTEMS PROGRAMMING;

EID: 72249085347     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1640089.1640095     Document Type: Conference Paper

References (35)

1. DSTM 2.1 beta. Available from http://www.cs.brown.edu/~mph/.
2. The Lonestar Benchmark Suite. Available from http://iss.ices.utexas.edu/ lonestar/.
3. G. Agha, I. Mason, S. Smith, and C. Talcott. A foundation for actor computation. Journal of Functional Programming, 7(1):1-72, 1997.
4. W. Aiello, Ch. Kalmanek, P. McDaniel, S. Sen, O. Spatscheck, and J. van der Merwe. Analysis of communities of interest in data networks. In PAM, pages 83-96, 2005.
5. J. Barnes and P. Hut. A hierarchical O(NlogN) force-calculation algorithm. Nature, 324(4):446-449, December 1986.
6. C. Boyapati, R. Lee, and M. Rinard. Ownership types for safe programming: preventing data races and deadlocks. In OOPSLA, pages 211-230, 2002.
7. D. Burke, J. Epstein, D. Cummings, J. Parker, K. Cline, R. Singa, and S. Chakravarty. Individual-based computational modeling of smallpox epidemic control strategies. Academic Emergency Medicine, 13(11):1142-1149, 2006.
8. B. Chamberlain, D. Callahan, and H. Zima. Parallel programmability and the chapel language. Int. Journal of High Performance Computing Applications, 21(3):291-312, 2007.
9. S. Chandra, V. Saraswat, V. Sarkar, and R. Bodík. Type inference for locality analysis of distributed data structures. In PPOPP, pages 11-22, 2008.
10. P. Charles, C. Grothoff, V. Saraswat, C. Donawa, A. Kielstra, K. Ebcioglu, C. von Praun, and V. Sarkar. X10: an object-oriented approach to non-uniform cluster computing. In OOPSLA, pages 519-538, 2005.
11. P. Chew. Guaranteed-quality mesh generation for curved surfaces. In Symposium on Computational Geometry, pages 274-280, 1993.
12. S. Chung and A. Condon. Parallel implementation of Boruvka's minimum spanning tree algorithm. In IPPS, pages 302-308, 1996.
13. D. Clarke, T. Wrigstad, J. Östlund, and E. Johnsen. Minimal ownership for active objects. In APLAS, pages 139-154, 2008.
14. E. de Sturler and D. Loher. Parallel iterative solvers for irregular sparse matrices in high performance Fortran. Future Generation Computer Systems, 13(4-5):315-325, 1998.
15. Z. Galil and G. Italiano. Data structures and algorithms for disjoint set union problems. ACM Comput. Surv., 23(3):319-344, 1991.
16. T. Grune Yanoff. Agent-based models as policy decision tools: The case of smallpox vaccination. Technical report, Royal Institute of Technology, Sweden.
17. F. Guidec, P. Calégari, and P. Kuonen. Parallel irregular software for wave propagation simulation. Future Generation Computer Systems, 13(4-5):279-289, 1998.
18. T. Harris and K. Fraser. Language support for lightweight transactions. In OOPSLA, pages 388-402, 2003.
19. T. Harris, S. Marlow, S. L. Peyton Jones, and M. Herlihy. Composable memory transactions. In PPOPP, pages 48-60, 2005.
20. C. Hewitt, P. Bishop, and R. Steiger. A universal modular actor formalism for artificial intelligence. In IJCAI, pages 235-245, 1973.
21. K. Hildrum and P. Yu. Focused community discovery. In ICDM, pages 641-644, 2005.
22. D. Jungnickel and M. Swamy. Graphs, Networks, and Algorithms. Springer, 2004.
23. N. Kobayashi, B. Pierce, and D. Turner. Linearity and the pi-calculus. In POPL, pages 358-371, 1996.
24. M. Kulkarni, M. Burtscher, R. Inkulu, K. Pingali, and C. Cascaval. How much parallelism is there in irregular applications? In PPOPP, pages 3-14, 2009.
25. M. Kulkarni, M. Burtscher, K. Pingali, and C. Cascaval. Lonestar: A suite of parallel irregular programs. In ISPASS, 2009.
26. M. Kulkarni, K. Pingali, G. Ramanarayanan, B. Walter, K. Bala, and L. Chew. Optimistic parallelism benefits from data partitioning. In ASPLOS, pages 233-243, 2008.
27. M. Kulkarni, K. Pingali, B. Walter, G. Ramanarayanan, K. Bala, and P. Chew. Optimistic parallelism requires abstractions. In PLDI, pages 211-222, 2007.
28. J. Larus and C. Kozyrakis. Transactional memory. Communications of the ACM, 51(7), 2008.
29. E. A. Lee. Are new languages necessary for multicore?, 2007.
30. K. Pingali, M. Kulkarni, D. Nguyen, M. Burtscher, M. Mendez-Lojo, D. Prountzos, X. Sui, and Z. Zhong. Amorphous data-parallelism in irregular applications. Technical Report TR-09-05, University of Texas at Austin, 2009.
31. M. F. Spear, V. J. Marathe, L. Dalessandro, and M. L. Scott. Privatization techniques for software transactional memory. In PODC, 2007.
32. S. Srinivasan and A. Mycroft. Kilim: Isolation-typed actors for java. In ECOOP, pages 104-128, 2008.
33. H. Sutter and J. Larus. Software and the concurrency revolution. ACM Queue, 3(7):54-62, 2005.
34. M. Vaziri, F. Tip, and J. Dolby. Associating synchronization constraints with data in an object-oriented language. In POPL, pages 334-345, 2006.
35. M. Wolfe. High-Performance Compilers for Parallel Computing. Addison Wesley, 1995.