Publication:
Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems

Loading...
Thumbnail Image
Authors
Maheswaran, Muthucumaru
Shoukat Ali
Howard Jay Siegel
Hensgen, Debra
Freund, Richard F.
Subjects
NA
Advisors
Date of Issue
1999-06
Date
June 1999
Publisher
Language
Abstract
Dynamic mapping (matching and scheduling) heuristics for a class of independent tasks using heterogeneous distributed computing systems are studied. Two types of mapping heuristics are considered: im- mediate mode and batch mode heuristics. Three new heuristics, one for batch mode and two for immediate mode, are introduced as part of this research. Simulation studies are performed to compare these heuristics with some existing ones. In total, five immediate mode heuristics and three batch mode heuristics are ex- amined. The immediate mode dynamic heuristics consider, to varying degrees and in different ways, task affinity for different machines and machine ready times. The batch mode dynamic heuristics consider these factors, as well as aging of tasks waiting to execute. The simulation results reveal that the choice of which dynamic mapping heuristic to use in a given heterogeneous environment depends on parameters such as: (a) the structure of the heterogeneity among tasks and machines, and (b) the arrival rate of the tasks.
Type
Description
Series/Report No
Department
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Collections