The data locality of work stealing

Theory of Computing Systems

Volumn 35, Issue 3, 2002, Pages 321-347

  Acar, Umut A ^a   Blelloch, Guy E ^a   Blumofe, Robert D ^b  

^a Carnegie Mellon University   (United States)

^b University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA LOCALITY;

ALGORITHMS; CACHE MEMORY; COMPUTATION THEORY; COMPUTER HARDWARE;

PARALLEL PROCESSING SYSTEMS;

EID: 0036590708     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-002-1057-3     Document Type: Conference Paper

References (37)

1. Thomas E. Anderson, Edward D. Lazowska, and Henry M. Levy. The performance implications of thread management alternatives for shared-memory multiprocessors. IEEE Transactions on Computers, 38(12):1631-1644, December 1989.
2. Nimar S. Arora, Robert D. Blumofe, and C. Greg Plaxton. Thread scheduling for multiprogrammed multiprocessors. In Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 119-129, Puerto Vallarta, Mexico, June 1998.
3. Frank Bellosa and Martin Steckermeier. The performance implications of locality information usage in shared memory multiprocessors. Journal of Parallel and Distributed Computing, 37(1):113-121, August 1996.
4. Guy E. Blelloch. Programming parallel algorithms. Communications of the ACM, 39(3):85-97, March 1996.
5. Guy E. Blelloch, Phillip B. Gibbons, and Yossi Matias. Provably efficient scheduling for languages with fine-grained parallelism. In Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 1-12, Santa Barbara, California, July 1995.
6. Guy Blelloch and Margaret Reid-Miller. Pipelining with futures. In Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 249-259. Newport, Rhode Island, June 1997.
7. Robert D. Blumofe, Matteo Frigo, Christopher F. Joerg, Charles E. Leiserson, and Keith H. Randall. An analysis of dag-consistent distributed shared-memory algorithms. In Proceedings of the Eighth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 297-308, Padua, Italy, June 1996.
8. Robert D. Blumofe, Christopher F. Joerg, Bradley C. Kuszmaul, Charles E. Leiserson, Keith H. Randall, and Yuli Zhou. Cilk: an efficient multithreaded runtime system. Journal of Parallel and Distributed Computing, 37(1):55-69, August 1996.
9. Robert D. Blumofe and Charles E. Leiserson. Scheduling multithreaded computations by work stealing. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS), pages 356-368. Santa Fe, New Mexico, November 1994.
10. Robert D. Blumofe and Dionisios Papadopoulos. The performance of work stealing in multiprogrammed environments. Technical Report TR-98-13, Department of Computer Sciences, The University of Texas at Austin, May 1998.
11. F. Warren Burton and M. Ronan Sleep. Executing functional programs on a virtual tree of processors. In Proceedings of the 1981 Conference on Functional Programming Languages and Computer Architecture, pages 187-194, Portsmouth, New Hampshire, October 1981.
12. David Callahan and Burton Smith. A future-based parallel language for a general-purpose highly-parallel computer. In David Padua, David Gelernter, and Alexandru Nicolau, editors, Languages and Compilers for Parallel Computing, Research Monographs in Parallel and Distributed Computing, pages 95-113. MIT Press, Cambridge, Massachusetts, 1990.
13. Martin C. Carlisle, Anne Rogers, John H. Reppy, and Laurie J. Hendren. Early experiences with OLDEN (parallel programming). In Proceedings 6th International Workshop on Languages and Compilers for Parallel Computing, pages 1-20. Springer-Verlag, New York, August 1993.
14. Rohit Chandra, Anoop Gupta, and John Hennessy. COOL: a Language for parallel programming. In David Padua, David Gelernter, and Alexandru Nicolau, editors, Languages and Compilers for Parallel Computing, Research Monographs in Parallel and Distributed Computing, pages 126-148. MIT Press, Cambridge, Massachusetts, 1990.
15. Rohit Chandra, Anoop Gupta, and John L. Hennessy. Data locality and load balancing in COOL. In Proceedings of the Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), pages 249-259, San Diego, California, May 1993.
16. David E. Culler and Arvind. Resource requirements of dataflow programs. In Proceedings of the International Symposium on Computer Architecture, pages 141-151, 1988.
17. Dawson R. Engler, David K. Lowenthal, and Gregory R. Andrews. Shared Filaments: efficient fine-grain parallelism on shared-memory multiprocessors. Technical Report TR 93-13a, Department of Computer Science, The University of Arizona, April 1993.
18. Mingdong Feng and Charles E. Leiserson. Efficient detection of determinacy races in Cilk programs. In Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 1-11, Newport, Rhode Island, June 1997.
19. Robert H. Halstead, Jr. Implementation of Multilisp: Lisp on a multiprocessor. In Conference Record of the 1984 ACM Symposium on Lisp and Functional Programming, pages 9-17, Austin, Texas, August 1984.
20. Robert H. Halstead, Jr. Multilisp: a language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems, 7(4):501-538, October 1985.
21. High Performance Fortran Forum. High Performance Fortran Language Specification, May 1993.
22. Vijay Karamcheti and Andrew A. Chien. A hierarchical load-balancing framework for dynamic multi-threaded computations. In Proceedings of ACM/IEEE SC98: 10th Anniversary. High Performance Networking and Computing Conference, 1998.
23. Richard M. Karp and Yanjun Zhang. A randomized parallel branch-and-bound procedure. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing (STOC), pages 290-300, Chicago, Illinois, May 1988.
24. Richard M. Karp and Yanjun Zhang. Randomized parallel algorithms for backtrack search and branch-and-bound computation. Journal of the ACM, 40(3):765-789, July 1993.
25. David A. Krantz, Robert H. Halstead, Jr., and Eric Mohr. Mul-T: a high-performance parallel Lisp. In Proceedings of the SIGPLAN '89 Conference on Programming Language Design and Implementation, pages 81-90, 1989.
26. Evangelos Markatos and Thomas LeBlanc. Locality-based scheduling for shared-memory multiprocessors. Technical Report TR-094, Institute of Computer Science, F.O.R.T.H., Crete, Greece, 1994.
27. MIT Laboratory for Computer Science. Cilk 5.2 Reference Manual, July 1998.
28. Eric Mohr, David A. Kranz, and Robert H. Halstead, Jr. Lazy task creation: a technique for increasing the granularity of parallel programs. IEEE Transactions on Parallel and Distributed Systems, 2(3):264-280. July 1991.
29. Grija J. Narlikar. Scheduling threads for low space requirement and good locality. In Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 83-95, June 1999.
30. Dionysios Papadopoulos. Hood: a user-level thread library for multiprogrammed multiprocessors. Master's thesis, Department of Computer Sciences, University of Texas at Austin, August 1998.
31. James Philbin, Jan Edler, Otto J. Anshus, Craig C. Douglas, and Kai Li. Thread scheduling for cache locality. In Proceedings of the Seventh ACM Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), pages 60-71, Cambridge, Massachusetts, October 1996.
32. Dan Stein and Devang Shah. Implementing lightweight threads. In Proceedings of the USENIX 1992 Summer Conference, pages 1-9, San Antonio, Texas, June 1992.
33. Jacobo Valdes. Parsing Flowcharts and Series-Parallel Graphs. Ph.D. thesis, Stanford University, December 1978.
34. Boris Weissman. Performance counters and state sharing annotations: a unified aproach to thread locality. In International Conference on Architectural Support for Programming Languages and Operating Systems, pages 262-273, October 1998.
35. Steven Cameron Woo, Moriyoshi Ohara, Evan Torrie, Jaswinder Pal Singh, and Anoop Gupta. The SPLASH-2 programs: characterization and methodological considerations. In Proceedings of the 22nd Annual International Symposium on Computer Architecture (ISCA), pages 24-36, Santa Margherita Ligure, Italy, June 1995.
36. Yanjun Zhang. Parallel Algorithms for Combinatorial Search Problems. Ph.D. thesis, Department of Electrical Engineering and Computer Science, University of California at Berkeley, November 1989. Also Technical Report UCB/CSD 89/543, Computer Science Division, University of California at Berkeley.
37. Yanjun Zhang and Augustyn Ortynski. The efficiency of randomized parallel backtrack search. In Proceedings of the 6th IEEE Symposium on Parallel and Distributed Processing, pages 14-28, Dallas, Texas, October 1994.