Title
Algorithms For Divisible Load Scheduling Of Data-Intensive Applications
Keywords
Divisible Load Scheduling; Divisible Load Theory (DLT); Grid computing; Load balancing
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. © Springer Science+Business Media B.V. 2009.
Publication Date
2-1-2010
Publication Title
Journal of Grid Computing
Volume
8
Issue
1
Number of Pages
133-155
Document Type
Article
Personal Identifier
scopus
DOI Link
https://doi.org/10.1007/s10723-009-9129-0
Copyright Status
Unknown
Socpus ID
77949273365 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/77949273365
STARS Citation
Yu, Chen and Marinescu, Dan C., "Algorithms For Divisible Load Scheduling Of Data-Intensive Applications" (2010). Scopus Export 2010-2014. 1365.
https://stars.library.ucf.edu/scopus2010/1365