Divisible Load Scheduling and Markov Chain Models

M. A. Moges; T. G. Robertazzi

doi:10.1016/j.camwa.2006.05.016

Divisible Load Scheduling and Markov Chain Models

M. A. Moges
, T. G. Robertazzi

Electrical Engineering

University of Houston

Research output: Contribution to journal › Article › peer-review

13 Scopus citations

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.

Original language	English
Pages (from-to)	1529-1542
Number of pages	14
Journal	Computers and Mathematics with Applications
Volume	52
Issue number	10-11
DOIs	https://doi.org/10.1016/j.camwa.2006.05.016
State	Published - Nov 2006

Keywords

Divisible jobs
Divisible loads
Linear networks
Markov chains
Scheduling
Tree networks

Access to Document

10.1016/j.camwa.2006.05.016

Cite this

@article{305e55e151114bec9d374544b30504fa,

title = "Divisible Load Scheduling and Markov Chain Models",

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.",

keywords = "Divisible jobs, Divisible loads, Linear networks, Markov chains, Scheduling, Tree networks",

author = "Moges, \{M. A.\} and Robertazzi, \{T. G.\}",

year = "2006",

month = nov,

doi = "10.1016/j.camwa.2006.05.016",

language = "English",

volume = "52",

pages = "1529--1542",

journal = "Computers and Mathematics with Applications",

issn = "0898-1221",

number = "10-11",

}

TY - JOUR

T1 - Divisible Load Scheduling and Markov Chain Models

AU - Moges, M. A.

AU - Robertazzi, T. G.

PY - 2006/11

Y1 - 2006/11

N2 - 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.

AB - 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.

KW - Divisible jobs

KW - Divisible loads

KW - Linear networks

KW - Markov chains

KW - Scheduling

KW - Tree networks

UR - https://www.scopus.com/pages/publications/33846881324

U2 - 10.1016/j.camwa.2006.05.016

DO - 10.1016/j.camwa.2006.05.016

M3 - Article

AN - SCOPUS:33846881324

SN - 0898-1221

VL - 52

SP - 1529

EP - 1542

JO - Computers and Mathematics with Applications

JF - Computers and Mathematics with Applications

IS - 10-11

ER -

Divisible Load Scheduling and Markov Chain Models

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this