This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Alert me to new issues of the journal Add to Saved Citations Download to citation manager Request Permissions Request Reprints Add to My Marked Citations Citing Articles Citing Articles via Google Scholar Citing Articles via Scopus Google Scholar Articles by Quan, D. M. Articles by Hsu, D. F. Search for Related Content Social Bookmarking                         What's this?

Mapping Heavy Communication Grid-Based Workflows Onto Grid Resources Within an SLA Context Using Metaheuristics

SCHOOL OF INFORMATION TECHNOLOGY, INTERNATIONAL UNIVERSITY IN GERMANY, 76646 BRUCHSAL, GERMANY, QUANDM{at}UPB.DE

D. Frank Hsu

DEPARTMENT OF COMPUTER & INFORMATION SCIENCES, FORDHAM UNIVERSITY, 113 WEST 60TH STREET, NEW YORK, NY USA

Service Level Agreements (SLAs) are currently one of the major research topics in grid computing. Among many system components for SLA-related grid jobs, the SLA mapping mechanism has received widespread attention. It is responsible for assigning sub-jobs of a workflow to a variety of grid resources in a way that meets the user's deadline and costs as little as possible. With the distinguished workload and resource characteristics, mapping a heavy communication workflow within an SLA context gives rise to a complicated combinatorial optimization problem. This paper presents the application of various metaheuristics and suggests a possible approach to solving this problem. Performance measurements deliver evaluation results on the quality and efficiency of each method.

Key Words: grid computing • workflow • mapping • planning • Service Level Agreement

International Journal of High Performance Computing Applications, Vol. 22, No. 3, 330-346 (2008)
DOI: 10.1177/1094342007086230


CiteULike    Complore    Connotea    Del.icio.us    Digg    Reddit    Technorati    Twitter    What's this?