Beyond nested parallelism: Tight bounds on work-stealing overheads for parallel futures

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2009, Pages 91-100

  Spoonhower, Daniel ^a   Blelloch, Guy E ^a   Gibbons, Phillip B ^b   Harper, Robert ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b INTEL CORPORATION   (United States)

Author keywords

Futures; Performance bounds; Scheduling; Work stealing

Indexed keywords

CACHE MISS; EMPIRICAL MEASUREMENT; FUTURES; NESTED PARALLELISM; PARALLEL IMPLEMENTATIONS; PARALLEL TASK; PERFORMANCE BOUNDS; PIPELINED PARALLELISM; PROCESSOR EXECUTION; QUICKSORT; TIGHT BOUND;

PALLADIUM;

EID: 70449659519     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1583991.1584019     Document Type: Conference Paper

References (26)

1. Umut A. Acar, Guy E. Blelloch, and Robert D. Blumofe. The data locality of work stealing. Theory of Comput. Syst., 35(3):321-347, 2002.
2. Shivali Agarwal, Rajkishore Barik, Dan Bonachea, Vivek Sarkar, Rudrapatna K. Shyamasundar, and Katherine Yelick. Deadlock-free scheduling of X10 computations with bounded resources. In Proc. of the Symp. on Parallel Algorithms and Architectures, pages 229-240. ACM, 2007.
3. Nimar S. Arora, Robert D. Blumofe, and C. Greg Plaxton. Thread scheduling for multiprogrammed multiprocessors. In Proc. of the Symp. on Parallel Algorithms and Architectures, pages 119-129. ACM, 1998.
4. Arvind, Rishiyur S. Nikhil, and Keshav K. Pingali. I-structures: data structures for parallel computing. ACM Trans. Program. Lang. Syst., 11(4):598-632, 1989.
5. Guy E. Blelloch and Margaret Reid-Miller. Pipelining with futures. In Proc. of the Symp. on Parallel Algorithms and Architectures, pages 249-259. ACM, 1997.
6. Guy E. Blelloch, Phillip B. Gibbons, Girija J. Narlikar, and Yossi Matias. Space-efficient scheduling of parallelism with synchronization variables. In Proc. of the Symp. on Parallel Algorithms and Architectures, pages 12-23. ACM, 1997.
7. Guy E. Blelloch, Phillip B. Gibbons, and Yossi Matias. Provably efficient scheduling for languages with fine-grained parallelism. J. ACM, 46(2):281-321, 1999.
8. Robert D. Blumofe and Charles E. Leiserson. Space-efficient scheduling of multithreaded computations. In Proc. of the Symp. on Theory of Comput., pages 362-371. ACM, 1993.
9. Robert D. Blumofe and Charles E. Leiserson. Scheduling multithreaded computations by work stealing. J. ACM, 46(5):720-748, 1999.
10. Robert D. Blumofe, Christopher F. Joerg, Bradley C. Kuszmaul, Charles E. Leiserson, Keith H. Randall, and Yuli Zhou. Cilk: an efficient multithreaded runtime system. In Proc. of the Symp. on Principles and Practice of Parallel Program., pages 207-216. ACM, 1995.
11. Robert D. Blumofe, Matteo Frigo, Christopher F. Jo-erg, Charles E. Leiserson, and Keith H. Randall. An analysis of dag-consistent distributed shared-memory algorithms. In Proc. of the Symp. on Parallel Algorithms and Architectures, pages 297-308. ACM, 1996.
12. F. Warren Burton and M. Ronan Sleep. Executing functional programs on a virtual tree of processors. In Proc. of the Conference on Funct. Program. Lang. and Comp. Architecture, pages 187-194. ACM, 1981.
13. Guojing Cong, Sreedhar Kodali, Sriram Krishnamoorthy, Doug Lea, Vijay Saraswat, and Tong Wen. Solving large, irregular graph problems using adaptive work-stealing. In Proc. of the Intl. Conf. on Parallel Processing, pages 536-545. IEEE Computer Society, 2008.
14. John T. Feo, David C. Cann, and Rodney R. Oldehoeft. A report on the Sisal language project. J. Parallel Distrib. Comput., 10(4):349-366, 1990.
15. Matteo Frigo, Charles E. Leiserson, and Keith H. Randall. The implementation of the Cilk-5 multithreaded language. In Proc. of the Conf. on Program. Lang. Design and Implementation, pages 212-223. ACM, 1998.
16. Seth Copen Goldstein, Klaus Erik Schauser, and David E. Culler. Lazy threads: implementing a fast parallel call. J. Parallel Distrib. Comput., 37(1):5-20, 1996.
17. Michael I. Gordon, William Thies, and Saman Amarasinghe. Exploiting coarse-grained task, data, and pipeline parallelism in stream programs. In Proc. of the Int. Conf. on Architectural Support for Program. Lang. and Operating Sys., pages 151-162. ACM, 2006.
18. Robert H. Halstead, Jr. Implementation of Multilisp: Lisp on a multiprocessor. In Proc. of the Symp. on LISP and Funct. Program., pages 9-17. ACM, 1984.
19. Robert H. Halstead, Jr. Multilisp: a language for con-current symbolic computation. ACM Trans. Program. Lang. Syst., 7(4):501-538, 1985.
20. Intel Corporation. Intel Threading Building Blocks. www. threadingbuildingblocks.org, 2009.
21. David A. Kranz, Robert H. Halstead, Jr., and Eric Mohr. Mul-T: a high-performance parallel Lisp. In Proc. of the Conf. on Program. Language Design and Implementation, pages 81-90. ACM, 1989.
22. Doug Lea. A Java fork/join framework. In Proc. of the Conference on Java Grande, pages 36-43. ACM, 2000.
23. Robin Milner, Mads Tofte, Robert Harper, and David MacQueen. The Definition of Standard ML (Revised). MIT Press, 1997.
24. Eric Mohr, David A. Kranz, and Robert H. Halstead, Jr. Lazy task creation: a technique for increasing the granularity of parallel programs. In Proc. of the Conf. on LISP and Funct. Program., pages 185-197. ACM, 1990.
25. Daniel Spoonhower, Guy E. Blelloch, Robert Harper, and Phillip B. Gibbons. Space profiling for parallel functional programs. In Proc. of the Int. Conf. on Funct. Program., pages 253-264. ACM, 2008.
26. Stephen Weeks. Whole-program compilation in MLton. In Proc. of the Workshop on ML, page 1. ACM, 2006.