Dynamic mapping of a class of independent tasks onto heterogeneous computing systems

Dynamic mapping (matching and scheduling) heuristics For a class of indepen dent tasks using heterogeneous distributed computing systems are studied. T wo types of mapping heuristics are considered, immediate mode and batch mod e heuristics. Three new heuristics, one for batch mode and two for immediat e mode, are introduced as part of this research. Simulation studies art: pe rformed to compare these heuristics with some existing ones. In total five immediate mode heuristics and three batch mode heuristics are examined. The immediate mode dynamic heuristics consider, to varying degrees and in diff erent ways: task affinity for different machines and machine ready times. T he batch mode dynamic heuristics consider these Factors, as well as aging o f tasks waiting to execute. The simulation results reveal that the choice o f which dynamic mapping heuristic to use in a given heterogeneous environme nt depends on parameters such as (a) the structure of the heterogeneity amo ng tasks and machines and (b) the arrival rate of the tasks. (C) 1999 Acade mic Press.