SLAW: A scalable locality-aware adaptive work-stealing scheduler

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

Volumn , Issue , 2010, Pages

  Guo, Yi ^a   Zhao, Jisheng ^a   Cave, Vincent ^a   Sarkar, Vivek ^a  

^a Rice University   (United States)

Author keywords

Adaptive scheduling; Locality aware scheduling; Task parallelism; Work stealing

Indexed keywords

ADAPTIVE APPROACH; ADAPTIVE SCHEDULING; DATA SIZE; LOCALITY AWARENESS; PARALLEL COMPUTATION; PROGRAMMING MODELS; RUNTIMES; SCHEDULING POLICIES; SCHEDULING TASKS; TASK-SCHEDULING; TEMPORAL DATA; WORST CASE;

DISTRIBUTED COMPUTER SYSTEMS; DISTRIBUTED PARAMETER NETWORKS;

SCHEDULING;

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

References (28)

1. B. Chamberlain, D. Callahan, and H. Zima, "Parallel programmability and the chapel language," Int. J. High Perform. Comput. Appl., vol.21, no.3, pp. 291-312, 2007.
2. Http://projectfortress.sun.com/Projects/Community.
3. P. Charles, C. Grothoff, V. Saraswat, C. Donawa, A. Kielstra, K. Ebcioglu, C. von Praun, and V. Sarkar, "X10: an object-oriented approach to non-uniform cluster computing," in OOPSLA '05.New York, NY, USA: ACM, 2005, pp. 519-538.
4. M. Frigo, C. E. Leiserson, and K. H. Randall, "The implementation of the cilk-5 multithreaded language," SIGPLAN Not., vol.33, no.5, pp. 212-223, 1998.
5. Cilk Arts: http://www.cilk.com.
6. Intel(R) Threading Building Blocks, Intel Corporation.
7. D. Lea, "A java fork/join framework," in JAVA '00: Proceedings of the ACM 2000 conference on Java Grande. New York, NY, USA: ACM, 2000, pp. 36-43.
8. D. Leijen, W. Schulte, and S. Burckhardt, "The design of a task parallel library," vol.44, no.10. New York, NY, USA: ACM, 2009, pp. 227-242.
9. K. Taura, K. Tabata, and A. Yonezawa, "Stackthreads/mp: integrating futures into calling standards," SIGPLAN Not., vol.34, no.8, pp. 60-71, 1999.
10. Y. Guo, R. Barik, R. Raman, and V. Sarkar, "Work-first and help- first scheduling policies for async-finish task parallelism," in IPDPS '09: Proceedings of the 2009 IEEE International Symposium on Paral- lel&Distributed Processing. Washington, DC, USA: IEEE Computer Society, 2009, pp. 1-12.
11. U. A. Acar, G. E. Blelloch, and R. D. Blumofe, "The data locality of work stealing," in SPAA '00: Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures. New York, NY, USA: ACM, 2000, pp. 1-12.
12. "The Habanero Java (HJ) Programming Language." [Online]. Available: http://habanero.rice.edu/hj
13. D. Spoonhower, G. E. Blelloch, P. B. Gibbons, and R. Harper, "Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures," in SPAA '09: Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures. New York, NY, USA: ACM, 2009, pp. 91-100.
14. R. D. Blumofe and C. E. Leiserson, "Scheduling multithreaded computations by work stealing," J. ACM, vol.46, no.5, pp. 720-748, 1999.
15. J. R. Larus and R. Rajwar, Transactional Memory. Morgan and Claypool, 2006.
16. S. Agarwal, R. Barik, D. Bonachea, V. Sarkar, R. K. Shyamasundar, and K. Yelick, "Deadlock-free scheduling of x10 computations with bounded resources," in SPAA '07: Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures. New York, NY, USA: ACM, 2007, pp. 229-240.
17. G. E. Blelloch, P. B. Gibbons, and Y. Matias, "Provably efficient scheduling for languages with fine-grained parallelism," J. ACM, vol.46, no.2, pp. 281-321, 1999.
18. D. Chase and Y. Lev, "Dynamic circular work-stealing deque," in SPAA '05: Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures, 2005.
19. A. Duran, X. Teruel, R. Ferrer, X. Martorell, and E. Ayguade, "Barcelona openmp tasks suite: A set of benchmarks targeting the exploitation of task parallelism in openmp," in ICPP '09: Proceedings of the 2009 International Conference on Parallel Processing. Washington, DC, USA: IEEE Computer Society, 2009, pp. 124-131.
20. R. Haralick and G. Elliott, "Improving tree search efficiency for constraint-satisfaction problems," Artificial Intelligence, 1980.
21. G. Cong, S. Kodali, S. Krishnamoorthy, D. Lea, V. Saraswat, and T. Wen, "Solving large, irregular graph problems using adaptive work-stealing," in ICPP '08: Proceedings of the 2008 37th International Conference on Parallel Processing. Washington, DC, USA: IEEE Computer Society, 2008, pp. 536-545.
22. A. Robison, M. Voss, and A. Kukanov, "Optimization via reflection on work stealing in tbb," in Parallel and Distributed Processing, 2008. IPDPS 2008. IEEE International Symposium on, April 2008, pp. 1-8.
23. Y. Zhao, J. Shi, K. Zheng, H. Wang, H. Lin, and L. Shao, "Allocation wall: a limiting factor of java applications on emerging multi-core platforms," in OOPSLA '09. New York, NY, USA: ACM, 2009, pp. 361-376.
24. G. J. Narlikar, "Scheduling threads for low space requirement and good locality," in SPAA '99: Proceedings ofthe eleventh annual ACM symposium on Parallel algorithms and architectures. New York, NY, USA: ACM, 1999, pp. 83-95.
25. A. Duran, J. Corbaln, and E. Ayguad, "Evaluation of openmp task scheduling strategies," in Proceeding of IWOMP 2008.
26. A. Duran, J. Corbalán, and E. Ayguade, "An adaptive cut-off for task parallelism," in SC '08: Proceedings of the 2008 ACM/IEEE conference on Supercomputing. Piscataway, NJ, USA: IEEE Press, 2008, pp. 1-11.
27. T. Hiraishi, M. Yasugi, S. Umatani, and T. Yuasa, "Backtracking- based load balancing," in PPoPP '09: Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming.New York, NY, USA: ACM, 2009, pp. 55-64.
28. S. Chen, P. B. Gibbons, M. Kozuch, V. Liaskovitis, A. Ailamaki, G. E. Blelloch, B. Falsafi, L. Fix, N. Hardavellas, T. C. Mowry, and C. Wilkerson, "Scheduling threads for constructive cache sharing on cmps," in SPAA '07. New York, NY, USA: ACM, 2007, pp. 105-115.