Divisible Load Scheduling and Markov Chain Models

Authors:
M. A. Moges;T. G. Robertazzi
Affiliations:
Department of Engineering Technology, University of Houston, Houston, TX 77204, U.S.A.;Department of Electrical and Computer Engineering, Stony Brook University, Stony Brook, NY 11794, U.S.A.
Venue:
Computers & Mathematics with Applications
Year:
2006

Citing 11
Cited 1

Scheduling divisible jobs on hypercubes

Parallel Computing
Distributed processing of divisible jobs with communication startup costs

GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
Computer Networks and Systems: Queueing Theory and Performance Evaluation

Computer Networks and Systems: Queueing Theory and Performance Evaluation
Scheduling Divisible Loads in Parallel and Distributed Systems

Scheduling Divisible Loads in Parallel and Distributed Systems
Optimizing Computing Costs Using Divisible Load Analysis

IEEE Transactions on Parallel and Distributed Systems
Bandwidth-Centric Allocation of Independent Tasks on Heterogeneous Platforms

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Ten Reasons to Use Divisible Load Theory

Computer
Sharing Partitionable Workloads in Heterogeneous NOWs: Greedier Is Not Better

CLUSTER '01 Proceedings of the 3rd IEEE International Conference on Cluster Computing
UMR: A Multi-Round Algorithm for Scheduling Divisible Workloads

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Optimal Algorithms for Scheduling Divisible Workloads on Heterogeneous Systems

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Divisible Load Theory: A New Paradigm for Load Scheduling in Distributed Systems

Cluster Computing

Modeling and control for wireless networked control system

International Journal of Automation and Computing

Quantified Score

Hi-index	0.09

Visualization

Abstract

In this paper, the equivalence between various divisible load-scheduling policies and continuous time Markov chains is demonstrated. This provides a basic unification of both data parallel divisible load scheduling and Markov chain models for the first time in 16 years of research. Such equivalence is demonstrated for divisible scheduling on linear daisy chains and single and two level tree networks.