Quasi-static scheduling for safe futures

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP

Volumn , Issue , 2008, Pages 23-32

  Navabi, Armand ^a   Zhang, Xiangyu ^a   Jagannathan, Suresh ^a  

^a Purdue University   (United States)

Author keywords

Concurrency control; Future; Static program analysis

Indexed keywords

APPLICATION DEVELOPERS; ASYNCHRONOUS CONCURRENCY; AUTOMATIC PARALLELIZATION TECHNIQUES; COMPLEX CONTROL; CONCURRENT EXECUTION; DATAFLOW; FUTURE; INTER-PROCEDURAL; JAVA PROGRAM; MULTI-THREADING; QUASI-STATIC SCHEDULING; SEQUENTIAL EXECUTION; SEQUENTIAL PROGRAMS; STATIC PROGRAM ANALYSIS; YIELD BEHAVIORS;

COMPUTER SOFTWARE; DATA FLOW ANALYSIS; JAVA PROGRAMMING LANGUAGE; PARALLEL PROGRAMMING;

CONCURRENCY CONTROL;

EID: 79959427412     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. Multitreemap. http://sourceforge.net/prqjects/multitreemap/.
2. David F. Bacon, Susan L. Graham, and Oliver J. Sharp. Compiler transformations for high-performance computing. ACM Computing Surveys, 26(4):345-420, 1994.
3. S. M. Blackburn, R. Garner, C. Hoffman, A. M. Khan, K. S. McKinley, R. Bentzur, A. Diwan, D. Feinberg, D. Frampton, S. Z. Guyer, M. Hirzel, A. Hosking, M. Jump, H. Lee, J. E. B. Moss, A. Phansalkar, D. Stefanović, T. VanDrunen, D. von Dincklage, and B. Wiedermann. The DaCapo benchmarks: Java benchmarking development and analysis. In OOPSLA, pages 169-190, 2006.
4. Robert D. Blumofe, Christopher F. Joerg, Bradley C. Kuszmaul, Charles E. Leiserson, Keith H. Randall, and YuIi Zhou. Cilk: an efficient multithreaded runtime system. Journal of Parallel Distributed Computing, 37(1):55-69, 1996.
5. John Boyland. Checking interference with fractional permissions. In SAS, pages 55-72, 2003.
6. Michael J. Carey, David J. DeWitt, and Jeffrey F. Naughton. The 007 benchmark. In SIGMOD, pages 12-21, 1993.
7. J. Choi, M. Gupta, M. Serrano, V. C. Sreedhar, and S. Midkiff. Escape analysis for Java. In OOPSLA, pages 1-19, 1999.
8. Chen Ding, Xipeng Shen, Kirk Kelsey, Chris Tice, Ruke Huang, and Chengliang Zhang. Software behavior oriented parallelization. In PLDI, pages 223-234, 2007.
9. Cormac Flanagan and Matthias Felleisen. The semantics of future and its use in program optimizations. In POPL.
10. Mary W. Hall, Brian R. Murphy, Saman P. Amarasinghe, Shih-Wei Liao, and Monica S. Lam. Interprocedural analysis for parallelization. In LCPC, pages 61-80, 1995.
11. R. Halstead. Multilisp: A Language for Concurrent Symbolic Computation. ACM Trans. Program. Lang. Syst., 7(4):501-538, 1985.
12. Tim Harris and Keir Fraser. Language Support for Lightweight Transactions. In OOPSLA, pages 388-402, 2003.
13. Tim Harris and Satnam Singh. Feedback Directed Implicit Parallelism. In IFCP, pages 251-264, 2007.
14. Maurice Herlihy, Victor Luchangco, Mark Moir, and William N. Scherer, III. Software Transactional Memory for Dynamic-Sized Data Structures. In PODC, pages 92-101, 2003.
15. Maurice Herlihy and J. Eliot B. Moss. Transactional memory: architectural support for lock-free data structures. In ISCA, pages 289-300, 1993.
16. Troy A. Johnson, Rudolf Eigenmann, and T. N. Vijaykumar. Min-cut program decomposition for thread-level speculation. In PLDI, pages 59-70, 2004.
17. R. Kelsey, W. Clinger, and J. Rees. Revised 5 report on the algorithmic language scheme. Higher-Order and Symbolic Computation, 11(3):7-105, 1998.
18. David Kranz, Robert H. Halstead, Jr., and Eric Mohr. Mul-T: A High-Performance Parallel Lisp. In PLDI, pages 81-90, 1989.
19. Milind Kulkarni, Keshav Pingali, Bruce Walter, Ganesh Ramanarayanan, Kavita Bala, and L. Paul Chew. Optimistic parallelism requires abstractions. In PLDI, pages 211-222, 2007.
20. O. Lhotak. Spark: A flexible points-to analysis framework for java. Master's thesis, McGill University, 2002.
21. Wei Liu, James Tuck, Luis Ceze, Wonsun Ahn, Karin Strauss, Jose Renau, and Josep Torrellas. Posh: a tls compiler that exploits program structure. In PPOPP, pages 158-167, 2006.
22. B. McCloskey, F. Zhou, D. Gay, and E. Brewer. Autolocker: Synchronization Inference for Atomic Sections. In POPL, pages 346-358, 2006.
23. Rick Mohr, David Kranz, and Robert Halstead. Lazy task creation: A technique for increasing the granularity of parallel programs. In LFP, pages 185-197, 1990.
24. Martin C. Rinard and Pedro C. Diniz. Commutativity analysis: A technique for automatically parallelizing pointer-based computations. In IPPS, pages 14-22, 1996.
25. Martin C. Rinard, Daniel J. Scales, and Monica S. Lam. Jade: A High-Level, Machine-Independent Language for Parallel Programming. IEEE Computer, 26(6):28-38, 1993.
26. R. Rugina and M. C. Rinard. Pointer analysis for structured parallel programs. ACM Trans. Program. Lang. Syst., 25(1):70-116, 2003.
27. L. A. Smith, J. M. Bull, and J. Obdrzalek. A parallel java grande benchmark suite. In ACM Supercomputing, page 8, 2001.
28. J. Greggory Steffan, Christopher B. Colohan, Antonia Zhai, and Todd C. Mowry. A scalable approach to thread-level speculation. In ISCA, pages 1-12, 2000.
29. C. von Praun, L. Ceze, and C. Cascaval. Implicit parallelism with ordered transactions. In PPOPP, pages 79-89, 2007.
30. Adam Welc, Suresh Jagannathan, and Antony Hosking. Safe futures forjava. In OOPSLA, pages 439-453, 2005.
31. L. Rauchwerger Y. Zhan and J. Torrellas. Hardware for speculative run-time parallelization in distributed shared-memory multiprocessors. In HPCA, pages 162-173, 1998.