Title

Algorithms for Divisible Load Scheduling of Data-intensive Applications

Authors

Authors

C. Yu;D. C. Marinescu

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Abbreviated Journal Title

J. Comput.

Keywords

Divisible Load Scheduling; Divisible Load Theory (DLT); Load balancing; Grid computing; DISTRIBUTED COMPUTATION; NETWORK; WORKSTATIONS; HEURISTICS; SYSTEMS; TASKS; Computer Science, Information Systems; Computer Science, Theory &; Methods

Abstract

In this paper we introduce the Divisible Load Scheduling (DLS) family of algorithms for data-intensive applications. The polynomial time algorithms partition the input data and generate optimal mappings to collection of autonomous and heterogeneous computational systems. We prove the optimality of the solution and report a simulation study of the algorithms.

Journal Title

Journal of Grid Computing

Volume

8

Issue/Number

1

Publication Date

1-1-2010

Document Type

Article

DOI Link

http://dx.doi.org/10.1007/s10723-009-9129-0

Language

English

First Page

133

Last Page

155

WOS Identifier

WOS:000274656200007

ISSN

1570-7873

Recommended Citation

"Algorithms for Divisible Load Scheduling of Data-intensive Applications" (2010). Faculty Bibliography 2010s. 998.
https://stars.library.ucf.edu/facultybib2010/998