Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Load‐balanced and locality‐aware scheduling for data‐intensive workloads at extreme scales

Journal Article · · Concurrency and Computation. Practice and Experience
DOI:https://doi.org/10.1002/cpe.3617· OSTI ID:1786148
 [1];  [2];  [1];  [3];  [1];  [4];  [5]
  1. Department of Computer Science Illinois Institute of Technology 10 W 31st St, Stuart Building, Room 002 Chicago IL 60616 USA
  2. Google Inc. Seattle WA 98103 USA
  3. Hortonworks Inc. Santa Clara CA USA
  4. Los Alamos National Laboratory Los Alamos NM USA
  5. Department of Computer Science Illinois Institute of Technology 10 W 31st St, Stuart Building, Room 002 Chicago IL 60616 USA, Argonne National Laboratory Lemont IL USA

Summary

Data‐driven programming models such as many‐task computing (MTC) have been prevalent for running data‐intensive scientific applications. MTC applies over‐decomposition to enable distributed scheduling. To achieve extreme scalability, MTC proposes a fully distributed task scheduling architecture that employs as many schedulers as the compute nodes to make scheduling decisions. Achieving distributed load balancing and best exploiting data locality are two important goals for the best performance of distributed scheduling of data‐intensive applications. Our previous research proposed a data‐aware work‐stealing technique to optimize both load balancing and data locality by using both dedicated and shared task ready queues in each scheduler. Tasks were organized in queues based on the input data size and location. Distributed key‐value store was applied to manage task metadata. We implemented the technique in MATRIX, a distributed MTC task execution framework. In this work, we devise an analytical suboptimal upper bound of the proposed technique, compare MATRIX with other scheduling systems, and explore the scalability of the technique at extreme scales. Results show that the technique is not only scalable but can achieve performance within 15% of the suboptimal solution. Copyright © 2015 John Wiley & Sons, Ltd.

Sponsoring Organization:
USDOE
Grant/Contract Number:
FC02-06ER25750
OSTI ID:
1786148
Journal Information:
Concurrency and Computation. Practice and Experience, Journal Name: Concurrency and Computation. Practice and Experience Journal Issue: 1 Vol. 28; ISSN 1532-0626
Publisher:
Wiley Blackwell (John Wiley & Sons)Copyright Statement
Country of Publication:
United Kingdom
Language:
English

References (41)

Distributed computing in practice: the Condor experience
  • Thain, Douglas; Tannenbaum, Todd; Livny, Miron
  • Concurrency and Computation: Practice and Experience, Vol. 17, Issue 2-4, p. 323-356 https://doi.org/10.1002/cpe.938
journal January 2005
Scalable Load Balancing Techniques for Parallel Computers journal July 1994
Impact of Over-Decomposition on Coordinated Checkpoint/Rollback Protocol book January 2012
NP-complete scheduling problems journal June 1975
Strategies for dynamic load balancing on highly parallel computers journal January 1993
An approximate analysis of the join the shortest queue (JSQ) policy journal March 1996
FusionFS: Toward supporting data-intensive scientific applications on extreme-scale high-performance computing systems conference October 2014
Optimizing load balancing and data-locality with data-aware scheduling conference October 2014
Achieving Efficient Distributed Scheduling with Message Queues in the Cloud for Many-Task Computing and High-Performance Computing conference May 2014
Overcoming Hadoop Scaling Limitations through Distributed Task Execution conference September 2015
GRAPH/Z: A Key-Value Store Based Scalable Graph Processing System conference September 2015
On the Merits of Distributed Work-Stealing on Selective Locality-Aware Tasks conference October 2013
Hierarchical Load Balancing for Charm++ Applications on Large Supercomputers
  • Zheng, Gengbin; Meneses, Esteban; Bhatele, Abhinav
  • 2010 International Conference on Parallel Processing Workshops (ICPPW), 2010 39th International Conference on Parallel Processing Workshops https://doi.org/10.1109/ICPPW.2010.65
conference September 2010
ZHT: A Light-Weight Reliable Persistent Dynamic Scalable Zero-Hop Distributed Hash Table
  • Li, Tonglin; Zhou, Xiaobing; Brandstatter, Kevin
  • 2013 IEEE International Symposium on Parallel & Distributed Processing (IPDPS), 2013 IEEE 27th International Symposium on Parallel and Distributed Processing https://doi.org/10.1109/IPDPS.2013.110
conference May 2013
Modeling Many-Task Computing Workloads on a Petaflop IBM Blue Gene/P Supercomputer conference May 2013
The Hadoop Distributed File System conference May 2010
Many-task computing for grids and supercomputers conference November 2008
Toward loosely coupled programming on petascale systems conference November 2008
Optimizing Data Locality for Fork/Join Programs Using Constrained Work Stealing
  • Lifflander, Jonathan; Krishnamoorthy, Sriram; Kale, Laxmikant V.
  • SC14: International Conference for High Performance Computing, Networking, Storage and Analysis https://doi.org/10.1109/SC.2014.75
conference November 2014
Swift: Fast, Reliable, Loosely Coupled Parallel Computation conference July 2007
All-Pairs: An Abstraction for Data-Intensive Computing on Campus Grids journal January 2010
Dynamic circular work-stealing deque conference January 2005
X10: an object-oriented approach to non-uniform cluster computing
  • Charles, Philippe; Grothoff, Christian; Saraswat, Vijay
  • Proceedings of the 20th annual ACM SIGPLAN conference on Object oriented programming systems languages and applications - OOPSLA '05 https://doi.org/10.1145/1094811.1094852
conference January 2005
X10: an object-oriented approach to non-uniform cluster computing journal October 2005
Dryad: distributed data-parallel programs from sequential building blocks conference January 2007
Dynamo: amazon's highly available key-value store conference January 2007
Falkon: a Fast and Light-weight tasK executiON framework conference January 2007
Accelerating large-scale data exploration through data diffusion conference January 2008
Analysis of size interval task assignment policies journal August 2008
The quest for scalable support of data-intensive workloads in distributed systems conference January 2009
Scalable work stealing conference January 2009
SLAW: a scalable locality-aware adaptive work-stealing scheduler for multi-core systems conference January 2010
Using simulation to explore distributed key-value stores for extreme-scale system services
  • Wang, Ke; Kulkarni, Abhishek; Lang, Michael
  • Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis on - SC '13 https://doi.org/10.1145/2503210.2503239
conference January 2013
A distributed dynamic load balancer for iterative applications
  • Menon, Harshitha; Kalé, Laxmikant
  • SC13: International Conference for High Performance Computing, Networking, Storage and Analysis, Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis https://doi.org/10.1145/2503210.2503284
conference November 2013
Next generation job management systems for extreme-scale ensemble computing conference January 2014
Towards Scalable Distributed Workload Manager with Monitoring-Based Weakly Consistent Resource Stealing
  • Wang, Ke; Zhou, Xiaobing; Qiao, Kan
  • HPDC'15: The 24th International Symposium on High-Performance Parallel and Distributed Computing, Proceedings of the 24th International Symposium on High-Performance Parallel and Distributed Computing https://doi.org/10.1145/2749246.2749249
conference June 2015
A Dynamically Scalable Cloud Data Infrastructure for Sensor Networks
  • Li, Tonglin; Keahey, Kate; Wang, Ke
  • HPDC'15: The 24th International Symposium on High-Performance Parallel and Distributed Computing, Proceedings of the 6th Workshop on Scientific Cloud Computing https://doi.org/10.1145/2755644.2755650
conference June 2015
The implementation of the Cilk-5 multithreaded language journal May 1998
Epidemic algorithms for replicated database maintenance conference January 1987
Job placement with unknown duration and no preemption journal March 2001
A multi-level load balancing scheme for OR-parallel exhaustive search programs on the multi-PSI
  • Furuichi, M.; Taki, K.; Ichiyoshi, N.
  • Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming - PPOPP '90 https://doi.org/10.1145/99163.99170
conference January 1990

Similar Records

Locality-aware and load-balanced static task scheduling for MapReduce
Journal Article · 2018 · Future Generations Computer Systems · OSTI ID:1580353

Flexible Data-Aware Scheduling for Workflows over an In-Memory Object Store
Conference · 2015 · OSTI ID:1336153

Related Subjects