Data Intensive Grid Scheduling: Multiple Sources with Capacity Constraints

Han Min Wong; Bharadwaj Veeravalli; Dantong Yu; Thomas G. Robertazzi

Data Intensive Grid Scheduling: Multiple Sources with Capacity Constraints

Han Min Wong, Bharadwaj Veeravalli, Dantong Yu, Thomas G. Robertazzi

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

In this paper, we apply divisible load theory to model the Grid scheduling problem involving multiple sources to multiple sinks, and present an optimized scheduling technique for this scenario. This scheduling technique can be easily extended to schedule resources with buffer space constraints. We provide a step-wise scheduling algorithm for these constraints. Two example calculations will show the practical utility and efficiency of DLT.

Original language	English (US)
Title of host publication	Proceedings of the Fifteenth IASTED International Conference on Parallel and Distributed Computing and Sytems
Editors	T. Gonzalez
Pages	7-11
Number of pages	5
Edition	1
State	Published - 2003
Externally published	Yes
Event	Proceedings of the Fifteenth IASTED International Conference on Parallel and Distributed Computing and Systems - Marina del Rey, CA, United States Duration: Nov 3 2003 → Nov 5 2003

Publication series

Name	Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems
Number	1
Volume	15

Other

Other	Proceedings of the Fifteenth IASTED International Conference on Parallel and Distributed Computing and Systems
Country/Territory	United States
City	Marina del Rey, CA
Period	11/3/03 → 11/5/03

All Science Journal Classification (ASJC) codes

Software
Hardware and Architecture
Computer Networks and Communications

Keywords

Divisible load scheduling theory(DLT)
Grid computing
Heterogeneous computing
Parallel computing
Resource constraints

Cite this

Wong, H. M., Veeravalli, B., Yu, D., & Robertazzi, T. G. (2003). Data Intensive Grid Scheduling: Multiple Sources with Capacity Constraints. In T. Gonzalez (Ed.), Proceedings of the Fifteenth IASTED International Conference on Parallel and Distributed Computing and Sytems (1 ed., pp. 7-11). (Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems; Vol. 15, No. 1).

Wong, Han Min ; Veeravalli, Bharadwaj ; Yu, Dantong et al. / Data Intensive Grid Scheduling : Multiple Sources with Capacity Constraints. Proceedings of the Fifteenth IASTED International Conference on Parallel and Distributed Computing and Sytems. editor / T. Gonzalez. 1. ed. 2003. pp. 7-11 (Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems; 1).

@inproceedings{41ca30ceb66143b59e28e40f086c018a,

title = "Data Intensive Grid Scheduling: Multiple Sources with Capacity Constraints",

abstract = "In this paper, we apply divisible load theory to model the Grid scheduling problem involving multiple sources to multiple sinks, and present an optimized scheduling technique for this scenario. This scheduling technique can be easily extended to schedule resources with buffer space constraints. We provide a step-wise scheduling algorithm for these constraints. Two example calculations will show the practical utility and efficiency of DLT.",

keywords = "Divisible load scheduling theory(DLT), Grid computing, Heterogeneous computing, Parallel computing, Resource constraints",

author = "Wong, {Han Min} and Bharadwaj Veeravalli and Dantong Yu and Robertazzi, {Thomas G.}",

year = "2003",

language = "English (US)",

isbn = "088986392X",

series = "Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems",

number = "1",

pages = "7--11",

editor = "T. Gonzalez",

booktitle = "Proceedings of the Fifteenth IASTED International Conference on Parallel and Distributed Computing and Sytems",

edition = "1",

note = "Proceedings of the Fifteenth IASTED International Conference on Parallel and Distributed Computing and Systems ; Conference date: 03-11-2003 Through 05-11-2003",

}

Wong, HM, Veeravalli, B, Yu, D & Robertazzi, TG 2003, Data Intensive Grid Scheduling: Multiple Sources with Capacity Constraints. in T Gonzalez (ed.), Proceedings of the Fifteenth IASTED International Conference on Parallel and Distributed Computing and Sytems. 1 edn, Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems, no. 1, vol. 15, pp. 7-11, Proceedings of the Fifteenth IASTED International Conference on Parallel and Distributed Computing and Systems, Marina del Rey, CA, United States, 11/3/03.

Data Intensive Grid Scheduling: Multiple Sources with Capacity Constraints. / Wong, Han Min; Veeravalli, Bharadwaj; Yu, Dantong et al.
Proceedings of the Fifteenth IASTED International Conference on Parallel and Distributed Computing and Sytems. ed. / T. Gonzalez. 1. ed. 2003. p. 7-11 (Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems; Vol. 15, No. 1).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Data Intensive Grid Scheduling

T2 - Proceedings of the Fifteenth IASTED International Conference on Parallel and Distributed Computing and Systems

AU - Wong, Han Min

AU - Veeravalli, Bharadwaj

AU - Yu, Dantong

AU - Robertazzi, Thomas G.

PY - 2003

Y1 - 2003

N2 - In this paper, we apply divisible load theory to model the Grid scheduling problem involving multiple sources to multiple sinks, and present an optimized scheduling technique for this scenario. This scheduling technique can be easily extended to schedule resources with buffer space constraints. We provide a step-wise scheduling algorithm for these constraints. Two example calculations will show the practical utility and efficiency of DLT.

AB - In this paper, we apply divisible load theory to model the Grid scheduling problem involving multiple sources to multiple sinks, and present an optimized scheduling technique for this scenario. This scheduling technique can be easily extended to schedule resources with buffer space constraints. We provide a step-wise scheduling algorithm for these constraints. Two example calculations will show the practical utility and efficiency of DLT.

KW - Divisible load scheduling theory(DLT)

KW - Grid computing

KW - Heterogeneous computing

KW - Parallel computing

KW - Resource constraints

UR - http://www.scopus.com/inward/record.url?scp=1542748150&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=1542748150&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:1542748150

SN - 088986392X

SN - 9780889863927

T3 - Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems

SP - 7

EP - 11

BT - Proceedings of the Fifteenth IASTED International Conference on Parallel and Distributed Computing and Sytems

A2 - Gonzalez, T.

Y2 - 3 November 2003 through 5 November 2003

ER -

Wong HM, Veeravalli B, Yu D, Robertazzi TG. Data Intensive Grid Scheduling: Multiple Sources with Capacity Constraints. In Gonzalez T, editor, Proceedings of the Fifteenth IASTED International Conference on Parallel and Distributed Computing and Sytems. 1 ed. 2003. p. 7-11. (Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems; 1).

Data Intensive Grid Scheduling: Multiple Sources with Capacity Constraints

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Keywords

Other files and links

Fingerprint

Cite this