Algorithms for Divisible Load Scheduling of Data-intensive Applications

    Authors

    C. Yu;D. C. Marinescu

    Comments

    Authors: contact us about adding a copy of your work at [email protected]

    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

    Language

    English

    First Page

    133

    Last Page

    155

    WOS Identifier

    WOS:000274656200007

    ISSN

    1570-7873

    Share

    COinS
     

    Accessibility Statement

    This item was created or digitized prior to April 24, 2027, or is a reproduction of legacy media created before that date. It is preserved in its original, unmodified state specifically for research, reference, or historical recordkeeping. In accordance with the ADA Title II Final Rule, the University Libraries provides accessible versions of archival materials upon request. To request an accommodation for this item, please submit an accessibility request form.