Decoupling computation and data scheduling in distributed data-intensive applications

• Published in: 11th International Symposium on High-Performance Distributed Computing (HPDC-11 2002) pp. 352 - 358
• Main Authors: Ranganathan, K., Foster, I.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 2002
• Subjects: Application software; Bioinformatics; Computer science; Distributed computing; Laboratories; Large-scale systems; Physics computing; Processor scheduling; Resource management; Scheduling algorithm
• ISBN: 0769516866; 9780769516868
• ISSN: 1082-8907
• DOI: 10.1109/HPDC.2002.1029935

In high-energy physics, bioinformatics, and other disciplines, we encounter applications involving numerous, loosely coupled jobs that both access and generate large data sets. So-called Data Grids seek to harness geographically distributed resources for such large-scale data-intensive problems. Yet effective scheduling in such environments is challenging, due to a need to address a variety of metrics and constraints while dealing with multiple, potentially independent sources of jobs and a large number of storage, compute, and network resources. We describe a scheduling framework that addresses these problems. Within this framework, data movement operations may be either tightly bound to job scheduling decisions or, alternatively, performed by a decoupled, asynchronous process on the basis of observed data access patterns and load. We develop a family of algorithms and use simulation studies to evaluate various combinations. Our results suggest that while it is necessary to consider the impact of replication, it is not always necessary to couple data movement and computation scheduling. Instead, these two activities can be addressed separately, thus significantly simplifying the design and implementation.