Real-time scheduling of divisible loads in cluster computing environments

Authors:
Xuan Lin;Anwar Mamat;Ying Lu;Jitender Deogun;Steve Goddard
Affiliations:
University of Nebraska, Lincoln, United States;University of Nebraska, Lincoln, United States;University of Nebraska, Lincoln, United States;University of Nebraska, Lincoln, United States;University of Nebraska, Lincoln, United States
Venue:
Journal of Parallel and Distributed Computing
Year:
2010

Citing 31
Cited 2

Distributed Scheduling of Tasks with Deadlines and Resource Requirements

IEEE Transactions on Computers
Multiprocessor Online Scheduling of Hard-Real-Time Tasks

IEEE Transactions on Software Engineering
Dynamic real-time task scheduling on hypercubes

Journal of Parallel and Distributed Computing
An Opportunity Cost Approach for Job Assignment in a Scalable Computing Cluster

IEEE Transactions on Parallel and Distributed Systems
Scheduling Divisible Loads in Parallel and Distributed Systems

Scheduling Divisible Loads in Parallel and Distributed Systems
Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems

IEEE Transactions on Parallel and Distributed Systems
An Efficient Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems

IEEE Transactions on Parallel and Distributed Systems
Using moldability to improve the performance of supercomputer jobs

Journal of Parallel and Distributed Computing
Dynamic, Reliability-Driven Scheduling of Parallel Real-Time Jobs in Heterogeneous Systems

ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
Ten Reasons to Use Divisible Load Theory

Computer
Pfair scheduling: beyond periodic task systems

RTCSA '00 Proceedings of the Seventh International Conference on Real-Time Systems and Applications
Scheduling Real Time Parallel Structure on Cluster Computing

ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Market-based Proportional Resource Sharing for Clusters

Market-based Proportional Resource Sharing for Clusters
Dynamic Integrated Scheduling of Hard Real-Time, Soft Real-Time and Non-Real-Time Processes

RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
On-line scheduling of scalable real-time tasks on multiprocessor systems

Journal of Parallel and Distributed Computing
Supporting Dynamic QoS in Linux

RTAS '04 Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium
Schedulability-Driven Partitioning and Mapping for Multi-Cluster Real-Time Systems

ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
Divisible Load Theory: A New Paradigm for Load Scheduling in Distributed Systems

Cluster Computing
Libra: a computational economy-based job scheduling system for clusters

Software—Practice & Experience
A Data Scheduling Algorithm for Autonomous Distributed Real-Time Applications in Grid Computing

ICPP '04 Proceedings of the 2004 International Conference on Parallel Processing
Task Assignment on Uniform Heterogeneous Multiprocessors

ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
VRE-NET: A QoS-supported Network Subsystem for Multimedia Applications

AINA '06 Proceedings of the 20th International Conference on Advanced Information Networking and Applications - Volume 01
Scheduling real time parallel structures on cluster computing with possible processor failures

ISCC '04 Proceedings of the Ninth International Symposium on Computers and Communications 2004 Volume 2 (ISCC"04) - Volume 02
A taxonomy of market-based resource management systems for utility-driven cluster computing

Software—Practice & Experience
Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment

Journal of Parallel and Distributed Computing
On-Line Hard Real-Time Scheduling of Parallel Tasks on Partitionable Multiprocessors

ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 02
Real-Time Divisible Load Scheduling for Cluster Computing

RTAS '07 Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium
Offer-based scheduling of deadline-constrained Bag-of-Tasks applications for utility computing systems

IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Moldable parallel job scheduling using job efficiency: an iterative approach

JSSPP'06 Proceedings of the 12th international conference on Job scheduling strategies for parallel processing
Adaptive job scheduling via predictive job resource allocation

JSSPP'06 Proceedings of the 12th international conference on Job scheduling strategies for parallel processing
Efficient scheduling of sporadic, aperiodic, and periodic tasks with complex constraints

RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium

Requirement-aware strategies for scheduling real-time divisible loads on clusters

Journal of Parallel and Distributed Computing
Improving Performance on Data-Intensive Applications Using a Load Balancing Methodology Based on Divisible Load Theory

International Journal of Parallel Programming

Quantified Score

Hi-index	0.01

Visualization

Abstract

Cluster computing has become an important paradigm for solving large-scale problems. To enhance the quality of service (QoS) and provide performance guarantees in a cluster computing environment, various real-time scheduling algorithms and workload models have been investigated. Computational loads that can be arbitrarily divided into independent tasks represent many real-world applications. However, the problem of providing performance guarantees to divisible load applications has only recently been studied systematically. In this work, three important and necessary design decisions, (1) workload partitioning, (2) node assignment, and (3) task execution order, are identified for real-time divisible load scheduling. A scheduling framework that can configure different policies for each of the three design decisions is proposed and used to generate various algorithms. This paper systematically studies these algorithms and identifies scenarios where the choices of design parameters have significant effects.