Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems
Howard Jay Siegel
Freund, Richard F.
MetadataShow full item record
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.
Showing items related by title, author, creator and subject.
Dynamic Matching and Scheduling of a Class of Independent Tasks onto Heterogeneous Computing Systems Maheswaran, Muthucumaru; Shoukat Ali; Howard Jay Siegel; Hensgen, Debra; Freund, Richard F. (1999);Dynamic mapping (matching and scheduling) heuristics for a class of independent tasks using heterogeneous dis- tributed computing systems are studied. Two types of map- ping heuristics are considered: on-line and batch ...
A Comparison Study of Static Mapping Heuristics for a Class of Meta-tasks on Heterogeneous Computing Systems Braun, Tracy D.; Siegel, Howard Jay; Beck, Noah; Boloni, Ladislau L.; Maheswaran, Muthucumaru; Reuther, Albert I.; Robertson, James P.; Theys, Mitchell D.; Yao, Bin; Hensgen, Debra; Freund, Richard F. (2001);Heterogeneous computing (HC) environments are well suited to meet the computational demands of large diverse groups of tasks (i. e., a meta- task). The prob lem of mapping (defi ned as matching and scheduling ) these ...
Hogan, Patrick G. (1985-12);Many scientific and technical endeavors require the reconstruction of a three-dimensional solid from a collection of two-dimensional contours. One method for this reconstruction involves a procedure whereby individual ...