Characterization of the iterative application of makespan heuristics on non-makespan machines in a heterogeneous parallel and distributed environment

Academic Article


  • Heterogeneous computing (HC) is the coordinated use of different types of machines, and networks to process a diverse workload in a manner that will maximize the combined performance and/or cost effectiveness of the system. Heuristics for allocating resources in an HC system are based on some optimization criterion. A common optimization criterion is to minimize the completion time of the machine that finishes last (makespan). In this study, we consider an iterative approach that repeatedly runs a mapping heuristic to minimize the makespan of the considered machines and tasks. For each successive iteration, the makespan machine of the previous iteration and the tasks assigned to it are removed from the set of considered machines and tasks. This study focuses on understanding the different mathematical characteristics of resource allocation heuristics that cause them to behave differently when combined with this iterative approach. This paper has three main contributions. The first contribution is the study of an iterative technique used in conjunction with resource allocation heuristics. The second contribution is the definition and mathematical characterization of "iteration invariant" heuristics. The third contribution is to determine the characteristics of a heuristic that will cause the mapping to change across iterations. © 2012 Springer Science+Business Media, LLC.
  • Authors

    Published In

    Digital Object Identifier (doi)

    Author List

  • Briceño LD; Siegel HJ; MacIejewski AA; Oltikar M
  • Start Page

  • 461
  • End Page

  • 485
  • Volume

  • 62
  • Issue

  • 1