Delegated isolation

ACM SIGPLAN Notices

Volumn 46, Issue 10, 2011, Pages 885-902

  Lublinerman, Roberto ^a   Zhao, Jisheng ^b   Budimlić, Zoran ^b   Chaudhuri, Swarat ^b   Sarkar, Vivek ^b  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b RICE UNIVERSITY   (United States)

Author keywords

Contention; Irregular parallelism; Isolation; Programming abstractions

Indexed keywords

COARSE-GRAINED; COMMUNICATION PRIMITIVES; CONTENTION; DATA PARALLEL; DATA RACES; DATA-DRIVEN; HABANERO; IRREGULAR PARALLELISM; ISOLATION; LIVENESS; LOW OVERHEAD; NEW MODEL; PARALLEL PROGRAM; PARALLELIZATIONS; PROGRAMMABILITY; PROGRAMMING ABSTRACTIONS; SHARED DATA; SHARED DATA STRUCTURE; SHARED MEMORIES; TRANSACTIONAL MEMORY; UNION-FIND DATA STRUCTURES;

DATA STRUCTURES; PARALLEL ARCHITECTURES; PARALLEL PROGRAMMING; STORAGE ALLOCATION (COMPUTER);

CONCURRENCY CONTROL;

EID: 84863353152     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/2076021.2048133     Document Type: Conference Paper

References (38)

1. Richard J. Anderson and Heather Woll. Wait-free parallel algorithms for the union-find problem. In Proceedings of the twenty-third annual ACM symposium on Theory of computing, STOC '91, pages 370-380, New York, NY, USA, 1991. ACM.
2. Ganesh Bikshandi, Jose G. Castanos, Sreedhar B. Kodali, V. Krishna Nandivada, Igor Peshansky, Vijay A. Saraswat, Sayantan Sur, Pradeep Varma, and Tong Wen. Efficient, portable implementation of asynchronous multi-place programs. In Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming, PPoPP '09, pages 271-282, New York, NY, USA, 2009. ACM.
3. Robert D. Blumofe and Charles E. Leiserson. Scheduling multithreaded computations by work-stealing. In Proceedins of the 35th Annual IEEE Conference on Foundations of Computer Science, 1994.
4. Donald Burke, Joshua Epstein, Derek Cummings, Jon Parker, Kenneth Cline, Ramesh Singa, and Shubha Charkravarty. Individual-based computational modeling of smallpox epidemic control strategies. Academic Emergency Medicine, 13(11):1142-1149, 2006. (Pubitemid 44636270)
5. Martin Burtscher, Milind Kulkarni, Dimitrios Prountzos, and Keshav Pingali. On the scalability of an automatically parallelized irregular application. In José Nelson Amaral, editor, Languages and Compilers for Parallel Computing, pages 109-123. Springer-Verlag, Berlin, Heidelberg, 2008.
6. Calin Cascaval, Colin Blundell, Maged Michael, Harold W. Cain, Peng Wu, Stefanie Chiras, and Siddhartha Chatterjee. Software transactional memory: Why is it only a research toy? Queue, 6:46-58, September 2008.
7. Vincent Cavé, Jisheng Zhao, Jun Shirako, and Vivek Sarkar. Habanero-Java: the New Adventures of Old X10. In PPPJ'11: Proceedings of 9th International Conference on the Principles and Practice of Programming in Java, 2011.
8. Robit Chandra, Leonardo Dagum, Dave Kohr, Dror Maydan, Jeff McDonald, and Ramesh Menon. Parallel programming in OpenMP. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2001.
9. Philippe Charles et al. X10: an object-oriented approach to non-uniform cluster computing. In Proceedings of the ACM SIGPLAN conference on Object oriented programming, systems, languages, and applications, pages 519-538, New York, NY, USA, 2005.
10. L. Paul Chew. Guaranteed-quality mesh generation for curved surfaces. In Proceedings of the ninth annual symposium on Computational geometry, SCG '93, pages 274-280, New York, NY, USA, 1993. ACM.
11. 9th DIMACS Implemetation Challenge. Available from http://www.dis. uniroma1.it/-challenge9/.
12. DSTM 2.1 beta. Available from http://www.cs.brown.edu/-mph/.
13. Panagiota Fatourou and Nikolaos D. Kallimanis. Blocking Universal Constructions. Technical report, University of Ioannina, 2011. TR-2011-05.
14. Peter A. Franaszek, John T. Robinson, and Alexander Thomasian. Concurrency control for high contention environments. ACM Trans. Database Syst., 17:304-345, June 1992. (Pubitemid 23609940)
15. Keir Fraser and Tim Harris. Concurrent programming without locks. ACM Trans. Comput. Syst., 25, May 2007.
16. Z. Galil and G. Italiano. Data structures and algorithms for disjoint set union problems. ACM Comput. Surv., 23(3):319-344, 1991.
17. Galois. Available from http://iss.ices.utexas.edu/galois/.
18. Habanero java web page. http://habanero.rice.edu/hj.
19. Tim Harris, James R. Larus, and Ravi Rajwar. Transactional Memory, 2nd Edition. Morgan & Claypool, 2010.
20. Danny Hendler, Itai Incze, Nir Shavit, and Moran Tzafrir. Flat combining and the synchronization-parallelism tradeoff. In Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures, SPAA '10, pages 355-364, New York, NY, USA, 2010. ACM.
21. Danny Hendler and Nir Shavit. Work dealing. In Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures, SPAA '02, pages 164-172, New York, NY, USA, 2002. ACM.
22. Maurice Herlihy, Victor Luchangco, and Mark Moir. A flexible framework for implementing software transactional memory. In Proceedings of the 21st annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications, OOPSLA '06, pages 253-262, New York, NY, USA, 2006. ACM. (Pubitemid 46726085)
23. Dieter Jungnickel. Graphs, Networks and Algorithms. Springer Publishing Company, Incorporated, 3rd edition, 2007.
24. Milind Kulkarni, Martin Burtscher, Calin Cascaval, and Keshav Pingali. Lonestar: A suite of parallel irregular programs. In Performance Analysis of Systems and Software, 2009. ISPASS 2009. IEEE International Symposium on, pages 65 -76, april 2009.
25. Milind Kulkarni, Martin Burtscher, Rajeshkar Inkulu, Keshav Pingali, and Calin 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 '09, pages 3-14, New York, NY, USA, 2009. ACM.
26. Milind Kulkarni, Keshav Pingali, Bruce Walter, Ganesh Ramanarayanan, Kavita Bala, and L. Paul Chew. Optimistic parallelism requires abstractions. In Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation, PLDI '07, pages 211-222, New York, NY, USA, 2007. ACM. (Pubitemid 47630689)
27. The Lonestar Benchmark Suite. Available from http://iss.ices.utexas.edu/ lonestar/.
28. Roberto Lublinerman, Swarat Chaudhuri, and Pavol Cerny. Parallel programming with object assemblies. In Proceedings of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applications, OOPSLA '09, pages 61-80, New York, NY, USA, 2009. ACM.
29. Virendra Marathe, William Scherer, and Michael Scott. Design tradeoffs in modern software transactional memory systems. In Workshop on languages, compilers, and run-time support for scalable systems, 2004.
30. Mario Méndez-Lojo, Donald Nguyen, Dimitrios Prountzos, Xin Sui, M. Amber Hassaan, Milind Kulkarni, Martin Burtscher, and Keshav Pingali. Structure-driven optimizations for amorphous data-parallel programs. In Proceedings of the 15th ACM SIGPLAN symposium on Principles and practice of parallel programming, PPoPP '10, pages 3-14, New York, NY, USA, 2010. ACM.
31. Y. Oyama, K. Taura, and A. Yonezawa. Executing parallel programs with synchronization bottlenecks efficiently. In Proceedings of the international workshop on parallel and distributed computing for symbolic and irregular applications, PDSIA '99, pages 182-204. World Scientific, 1999.
32. Keshav Pingali, Milind Kulkarni, Donald Nguyen, Martin Burtscher, Mario Mendez-Lojo, Dimitrios Prountzos, Xin Sui, and Zifei Zhong. Amorphous data-parallelism in irregular applications. Technical Report TR-09-05, University of Texas at Austin, 2009.
33. Dimitrios Prountzos, Roman Manevich, Keshav Pingali, and Kathryn S. McKinley. A shape analysis for optimizing parallel graph programs. In Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, POPL '11, pages 159-172, New York, NY, USA, 2011. ACM.
34. William Scherer and Michael Scott. Advanced contention management for dynamic software transactional memory. In Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, PODC '05, pages 240-248, New York, NY, USA, 2005. ACM. (Pubitemid 43218401)
35. Nir Shavit and Dan Touitou. Software transactional memory. In Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing, PODC '95, pages 204-213, New York, NY, USA, 1995. ACM.
36. Jun Shirako, David M. Peixotto, Vivek Sarkar, andWilliam N. Scherer. Phasers: a unified deadlock-free construct for collective and point-to-point synchronization. In Proceedings of the 22nd annual international conference on Supercomputing, ICS '08, pages 277-288, New York, NY, USA, 2008. ACM.
37. Sunay Tripathi. FireEngine -A New Networking Architecture for the Solaris Operating System. Technical report, Sun Microsystems, 2004.
38. Yonghong Yan, Jisheng Zhao, Yi Guo, and Vivek Sarkar. Hierarchical place trees: A portable abstraction for task parallelism and data movement. In The 22nd International Workshop on Languages and Compilers for Parallel Computing (LCPC'09), 2009.