Efficient work stealing for fine grained parallelism

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 2010, Pages 313-322

  Faxén, Karl Filip ^a  

^a SWEDISH INSTITUTE OF COMPUTER SCIENCE   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COARSE-GRAINED; EXTREME CASE; FINE GRAINED; FINE GRAINS; FINE-GRAINED PARALLELISM; GRAIN SIZE; LOW OVERHEAD; OPTERON; SPEED-UPS; TASK PARALLELISM; WORK-STEALING;

APPLICATION PROGRAMMING INTERFACES (API);

PARALLEL ARCHITECTURES;

EID: 78649540832     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2010.39     Document Type: Conference Paper

References (25)

1. OpenMP application programming interface, version 3.0, May 2008. Available from www.openmp.org.
2. Sarita V. Adve and Kourosh Gharachorloo. Shared memory consistency models: A tutorial. Computer, 29(12):66-76, 1996.
3. Nimar S. Arora, Robert D. Blumofe, and C. Greg Plaxton. Thread scheduling for multiprogrammed multiprocessors. In SPAA '98: Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures, pages 119-129, New York, NY, USA, 1998. ACM.
4. Robert D. Blumofe and Charles E. Leiserson. Scheduling multithreaded computations by work stealing. J. ACM, 46(5):720-748, 1999.
5. F. Warren Burton and M. Ronan Sleep. Executing functional programs on a virtual tree of processors. In FPCA '81: Proceedings of the 1981 conference on Functional programming languages and computer architecture, pages 187-194, New York, NY, USA, 1981. ACM.
6. Philippe Charles, Christian Grothoff, Vijay Saraswat, Christopher Donawa, Allan Kielstra, Kemal Ebcioglu, Christoph von Praun, and Vivek Sarkar. X10: an object-oriented approach to non-uniform cluster computing. In OOPSLA '05, pages 519-538, New York, NY, USA, 2005. ACM.
7. David Chase and Yossi Lev. Dynamic circular work-stealing deque. In SPAA '05: Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures, pages 21-28, New York, NY, USA, 2005. ACM.
8. Gilberto Contreras and Margaret Martonosi. Characterizing and improving the performance of the intel threading building blocks runtime system. In International Symposium on Workload Characterization (IISWC 2008), September 2008.
9. E. W. Dijkstra. Solution of a problem in concurrent programming control. Commun. ACM, 8(9):569, 1965.
10. James Dinan, Sriram Krishnamoorthy, D. Brian Larkins, Jarek Nieplocha, and P. Sadayappan. Scalable work stealing. In SC09. ACM, November 2009.
11. Alejandro Duran, Julita Corbalán, and Eduard Ayguadé. An adaptive cutoff for task parallelism. In SC '08: Proceedings of the 2008 ACM/IEEE conference on Supercomputing, pages 1-11, Piscataway, NJ, USA, 2008. IEEE Press.
12. Alejandro Duran, Julita Corbalán, and Eduard Ayguadé. Evaluation of OpenMP Task Scheduling Strategies. In Rudolf Eigenmann and Bronis R. de Supinski, editors, Lecture Notes in Computer Science: Proceedings of the 4th International Workshop on OpenMP, volume 5004, pages 100-110. Springer, Springer, May 2008.
13. Matteo Frigo, Charles E. Leiserson, and Keith H. Randall. The implementation of the Cilk-5 multithreaded language. In SIGPLAN Conference on Programming Language Design and Implementation, pages 212-223, 1998.
14. Danny Hendler and Nir Shavit. Non-blocking steal-half work queues. In PODC '02: Proceedings of the twenty-first annual symposium on Principles of distributed computing, pages 280-289, New York, NY, USA, 2002. ACM.
15. Sanjeev Kumar, Christopher J. Hughes, and Anthony Nguyen. Carbon: architectural support for fine-grained parallelism on chip multiprocessors. In ISCA '07: Proceedings of the 34th annual international symposium on Computer architecture, pages 162-173, New York, NY, USA, 2007. ACM.
16. D. Lea. A Java fork/join framework. In JAVA '00: Proceedings of the ACM 2000 conference on Java Grande, pages 36-43, New York, 2000. ACM Press.
17. Daan Leijen, Wolfram Schulte, and Sebastian Burckhardt. The design of a task parallel library. SIGPLAN Not., 44(10):227-242, 2009.
18. Maged M. Michael, Martin T. Vechev, and Vijay A. Saraswat. Idempotent work stealing. SIGPLAN Not., 44(4):45-54, 2009.
19. Stephen L. Olivier and Jan F. Prins. Evaluating OpenMP 3.0 run time systems on unbalanced task graphs. In IWOMP '09: Proceedings of the 5th International Workshop on OpenMP, pages 63-78, Berlin, Heidelberg, 2009. Springer-Verlag.
20. Artur Podobas, Mats Brorsson, and Karl-Filip Faxén. A comparison of some recent task-based parallel programming models. In MULTIPROG- 3, January 2009.
21. James Reinders. Intel threading building blocks. O'Reilly & Associates, Inc., Sebastopol, CA, USA, 2007.
22. Jr. Robert H. Halstead. Multilisp: a language for concurrent symbolic computation. ACM Trans. Program. Lang. Syst., 7(4):501-538, 1985.
23. Daniel Spoonhower, Guy E. Blelloch, Phillip B. Gibbons, and Robert Harper. Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures. In SPAA '09: Proceedings of the twentyfirst annual symposium on Parallelism in algorithms and architectures, pages 91-100, New York, NY, USA, 2009. ACM.
24. Jim Sukha. Brief announcement: a lower bound for depth-restricted work stealing. In SPAA '09: Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures, pages 124-126, New York, NY, USA, 2009. ACM.
25. David B. Wagner and Bradley G. Calder. Leapfrogging: a portable technique for implementing efficient futures. SIGPLAN Not., 28(7):208-217, 1993.