Algorithms for Divisible Load Scheduling of Data-intensive Applications

Algorithms for Divisible Load Scheduling of Data-intensive Applications

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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of grid computing 2010-03, Vol.8 (1), p.133-155
Hauptverfasser: Yu, Chen, Marinescu, Dan C.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Collection
Computational grids
Computer Science
Computer simulation
Management of Computing and Information Systems
Mapping
Mathematical models
Optimization
Polynomials
Processor Architectures
Scheduling
User Interfaces and Human Computer Interaction
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:1570-7873
1572-9184
DOI:10.1007/s10723-009-9129-0