Lifeline-based global load balancing

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP

Volumn , Issue , 2011, Pages 201-211

  Saraswat, Vijay ^a   Kambadur, Prabhanjan ^a   Kodali, Sreedhar ^a   Grove, David ^a   Krishnamoorthy, Sriram ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b PACIFIC NORTHWEST NATIONAL LABORATORY   (United States)

Author keywords

Distributed computing; Global load balancing; Parallel programming; UTS; Work stealing; X10

Indexed keywords

DISTRIBUTED COMPUTING; GLOBAL LOADS; UTS; WORK-STEALING; X10;

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE REUSABILITY; DISTRIBUTED COMPUTER SYSTEMS; GRAPHIC METHODS; PARALLEL ARCHITECTURES; PARALLEL PROGRAMMING; TREES (MATHEMATICS);

COMPUTER CRIME;

EID: 79952810744     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1941553.1941582     Document Type: Conference Paper

References (32)

1. J. E. Baldeschwieler, R. D. Blumofe, and E. A. Brewer. Atlas: an infrastructure for global computing. In EW 7: Proceedings of the 7th workshop on ACMSIGOPS European workshop, pages 165-172, New York, NY, USA, 1996. ACM.
2. R. Batoukov and T. Sorevik. A Generic Parallel Branch and Bound Environment on a Network of Workstations. In HiPer'99: Proceedings of High Performance Computing on Hewlett- Packard Systems, pages 474-483, 1999.
3. P. Berenbrink, T. Friedetzky, and L. A. Goldberg. The natural work-stealing algorithm is stable. SIAM J. Comput., 32(5):1260- 1279, 2003.
4. S. M. Blackburn, R. L. Hudson, R. Morrison, J. E. B. Moss, D. S. Munro, and J. Zigman. Starting with termination: a methodology for building distributed garbage collection algorithms. Aust. Comput. Sci. Commun., 23(1):20-28, 2001.
5. R. D. Blumofe and C. E. Leiserson. Scheduling Multithreaded Computations by Work Stealing. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS), pages 356-368, 1994.
6. R. D. Blumofe and P. A. Lisiecki. Adaptive and reliable parallel computing on networks of workstations. In ATEC'97: Proceedings of the annual conference on USENIX Annual Technical Conference, pages 10-10, Berkeley, CA, USA, 1997. USENIX Association.
7. 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, pages 536- 545, Washington, DC, USA, 2008. IEEE Computer Society.
8. J. Dean, S. Ghemawat, and G. Inc. Mapreduce: simplified data processing on large clusters. In In OSDI'04: Proceedings of the 6th conference on Symposium on Opearting Systems Design and Implementation, pages 137-150. USENIX Association, 2004.
9. E. Dijkstra and C. Scholten. Termination detection for diffusing computations. In Information Processing Letters, volume 11, pages 1-4, 1980.
10. E. W. Dijkstra. Derivation of a termination detection algorithm for distributed computations. pages 507-512, 1987.
11. J. Dinan, D. B. Larkins, P. Sadayappan, S. Krishnamoorthy, and J. Nieplocha. Scalable work stealing. In SC'09: Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis, pages 1-11, New York, NY, USA, 2009. ACM.
12. J. Dinan, S. Olivier, G. Sabin, J. Prins, P. Sadayappan, and C.-W. Tseng. Dynamic Load Balancing of Unbalanced Computations Using Message Passing. In IPDPS 07: Parallel and Distributed Processing Symposium, pages 1-8, Long Beach, CA, March 2007. IEEE International.
13. T. A. El-Ghazawi, W. W. Carlson, and J. M. Draper. UPC Language Specification, 1.1 edition, May 2003. http://www.gwu.-edu/̃upc/downloads/ upcspecs1.1p2pre1.pdf.
14. N. Francez and M. Rodeh. Achieving distributed termination without freezing. IEEE Trans. Softw. Eng., 8(3):287-292, 1982. (Pubitemid 12515825)
15. M. Frigo, C. E. Leiserson, and K. H. Randall. The implementation of the Cilk-5 multithreaded language. In Proceedings of the ACM SIGPLAN'98 Conference on Programming Language Design and Implementation, pages 212-223, Montreal, Quebec, Canada, June 1998. Proceedings published in ACM SIGPLAN Notices, Vol. 33, No. 5, May, 1998. (Pubitemid 128454798)
16. A. Grama and V. Kumar. State of the Art in Parallel Search Techniques for Discrete Optimization Problems. IEEE Trans. on Knowl. and Data Eng., 11(1):28-35, 1999.
17. Y. Guo, R. Barik, R. Raman, and V. Sarkar. Work-First and Help- First Scheduling Policies for Async-Finish Task Parallelism. In Proceedings of the 23rd IEEE International Parallel and Distributed Processing Symposium, May 2009.
18. L. V. Kalé and S. Krishnan. CHARM++: A portable concurrent object oriented system based on C++. In Proceedings of Object Oriented Programming Systems, Languages and Applications, ACM Sigplan Notes, volume 28, pages 91-108, 1993.
19. P. Kambadur, A. Gupta, A. Ghoting, H. Avron, and A. Lumsdaine. PFunc:Modern task parallelism for modern high performance computing. In Proceedings of the 2008 ACM/IEEE conference on Supercomputing (SC), Portland, Oregon, November 2009.
20. V. Kumar, A. Y. Grama, and N. R. Vempaty. Scalable load balancing techniques for parallel computers. J. Parallel Distrib. Comput., 22(1):60-79, 1994.
21. Message Passing Interface Forum. MPI, June 1995. http://www.mpi-forum. org/.
22. Message Passing Interface Forum. MPI-2, July 1997. http://www.mpi-forum. org/.
23. E. Mohr, D. A. Kranz, and R. H. Halstead Jr. Lazy Task Creation: A Technique for Increasing the Granularity of Parallel Programs. IEEE Trans. Parallel Distrib. Syst., 2(3):264-280, 1991. (Pubitemid 21690571)
24. S. Olivier, J. Huan, J. Liu, J. Prins, J. Dinan, P. Sadayappan, and C.-W. Tseng. UTS: an unbalanced tree search benchmark. In LCPC'06: Proceedings of the 19th international conference on Languages and compilers for parallel computing, pages 235-250, Berlin, Heidelberg, 2007. Springer-Verlag.
25. S. Olivier, J. Huan, J. Liu, J. Prins, J. Dinan, P. Sadayappan, and C.-W. Tseng. Uts: an unbalanced tree search benchmark. In Proceedings of the 19th international conference on Languages and compilers for parallel computing, LCPC'06, pages 235-250, Berlin, Heidelberg, 2007. Springer-Verlag.
26. S. Olivier and J. Prins. Scalable dynamic load balancing using UPC. In ICPP'08: Proceedings of the 2008 37th International Conference on Parallel Processing, pages 123-131, Washington, DC, USA, 2008. IEEE Computer Society.
27. OpenMP Architecture Review Board. OpenMP Application Program Interface, v3.0. May 2008.
28. J. Prins, J. Huan, B. Pugh, C.-W. Tseng, and P. Sadayappan. UPC Implementation of an Unbalanced Tree Search Benchmark. Technical Report 03-034, University of North Carolina at Chapel Hill, October 2003.
29. J. Reinders. Intel Threading Building Blocks. O'Reilly, 2007.
30. V. Saraswat, G. Almasi, G. Bikshandi, C. Cascaval, D. Cunningham, D. Grove, S. Kodali, I. Peshansky, and O. Tardieu. The asynchronous partitioned global address space model. In AMP'10: Proceedings of The FirstWorkshop on Advances inMessage Passing, June 2010.
31. A. B. Sinha and L. V. Kalé. A load balancing strategy for prioritized execution of tasks. In IIPS'93: Proceedings of International Parallel Processing Symposium, pages 230-237, 1993.
32. R. V. van Nieuwpoort, T. Kielmann, and H. E. Bal. Efficient load balancing for wide-area divide-and-conquer applications. In PPoPP'01: Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programming, pages 34-43, New York, NY, USA, 2001. ACM.