Executing task graphs using work-stealing

Proceedings of the 2010 IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2010

Volumn , Issue , 2010, Pages

  Agrawal, Kunal ^a   Leiserson, Charles E ^b   Sukha, Jim ^b  

^a WASHINGTON UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Cilk; Dag; Dynamic multithreading; Parallel computing; Work span analysis

Indexed keywords

ASYMPTOTICALLY OPTIMAL; DIVIDE AND CONQUER; DYNAMIC MULTITHREADING; DYNAMIC PROGRAMS; DYNAMIC TASKS; IN-DEGREE; LOW OVERHEAD; MULTITHREADED PROGRAMMING; ON THE FLIES; PARALLEL COMPUTING; RUNTIMES; SCHEDULING STRATEGIES; SMITH-WATERMAN ALGORITHM; TASK GRAPH; TIME BOUND;

DISTRIBUTED PARAMETER NETWORKS; FLOW CONTROL; MULTITASKING; PARALLEL ARCHITECTURES;

GRAPHIC METHODS;

EID: 77954005137     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2010.5470403     Document Type: Conference Paper

References (21)

1. E. Allen, D. Chase, J. Hallett, V. Luchango, J.-W. Maessen, S. Ryu, G. L. Steele Jr., and S. Tobin- Hochstadt. The Fortress language specification, version 1.0. Technical report, Sun Microsystems, Inc., March 2008.
2. N.S. Arora, R.D. Blumofe, and C. G. Plaxton. Thread scheduling for multiprogrammed multiprocessors. In ACM Symposium on Parallel Algorithms and Architectures, pages 119-129, Puerto Vallarta, Mexico, 1998.
3. R.D. Blumofe, C.F. Joerg, B.C. Kuszmaul, C. E. Leiserson, K. H. Randall, and Y. Zhou. Cilk: An efficient multithreaded runtime system. In ACM SIG- PLAN Symposium on Principles and Practice of Parallel Programming, pages 207-216, Santa Barbara, California, July 1995.
4. R. D. Blumofe and C. E. Leiserson. Scheduling multithreaded computations by work stealing. Journal of the ACM, 46(5):720-748, 1999.
5. R. D. Blumofe and D. Papadopoulos. Hood: A user-level threads library for multiprogrammed multiprocessors. Technical report, University of Texas at Austin, 1999.
6. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, third edition, 2009.
7. K. Ebcioglu, V. Saraswat, and V. Sarkar. X10: An experimental language for high productivity programming of scalable systems. In Workshop on Productivity and Performance in High-End Computing (P-PHEC), 2005.
8. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In 40th Annual Symposium on Foundations of Computer Science, pages 285-297, New York, New York, Oct. 17-19 1999.
9. M. Frigo, C. E. Leiserson, and K. H. Randall. The implementation of the Cilk-5 multithreaded language. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 212-223, 1998.
10. R. Hoffmann, M. Korch, and T. Rauber. Performance evaluation of task pools based on hardware synchronization. page 44, Washington, DC, 2004. IEEE Computer Society.
11. Intel Corporation. Intel Cilk++ SDK Programmer's Guide, October 2009. Document Number: 322581-001US.
12. T. Johnson, T. A. Davis, and S. M. Hadfield. A concurrent dynamic task graph. Parallel Computing, 22(2):327-333, 1996.
13. M. Korch and T. Rauber. A comparison of task pools for dynamic load balancing of irregular algorithms. Concurrency and Computation: Practice & Experience, 16(1):1-47, 2003.
14. Y.-K. Kwok and I. Ahmad. Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys, 31(4):406-471, 1999.
15. C. E. Leiserson. The Cilk++ concurrency platform. In DAC '09: Proceedings of the 46th Annual Design Automation Conference, pages 522-527, New York, NY, 2009. ACM.
16. M. Y. H. Low, W. Liu, and B. Schmidt. A parallel BSP algorithm for irregular dynamic programming. In 7th International Symposium on Advanced Parallel Processing Technologies, pages 151-160. Springer, 2007.
17. R. Raman and D. Wise. Converting to and from dilated integers. IEEE Transactions on Computers, 57(4):567-573, April 2008.
18. J. Reinders. Intel Threading Building Blocks: Outfitting C++ for Multi-Core Processor Parallelism. O'Reilly, 2007.
19. T. F. Smith and M. S. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology, 147:195-197, 1981.
20. J. D. Ullman. NP-complete scheduling problems. Journal of Computer and System Sciences, 10:384-393, 1975.
21. D. S. Wise and J. D. Frens. Morton-order matrices deserve compilers' support. Technical Report TR533, Indiana University, 1999.