Study of an Iterative Technique to Minimize Completion Times of Non-Makespan Machines

Heterogeneous computing (HC) is the coordinated use of different types of machines, networks, and interfaces to maximize the combined performance and/or cost effectiveness of the system. Heuristics for allocating resources in an HC system have different optimization criteria. A common optimization criterion is to minimize the completion time of the last to finish machine (makespan). In some environments, it is useful to minimize the finishing times of the other machines in the system, i.e., those machines that are not the last to finish. Consider a production environment where a set of known tasks are to be mapped to resources off-line before execution begins. Minimizing the finishing times of all the machines will provide the earliest available ready time for these machines to execute tasks that were not initially considered. In this study, we examine an iterative approach that decreases machine finishing times by repeatedly running a resource allocation heuristic. The goal of this study is to investigate whether this iterative procedure can reduce the finishing time of some machines compared to the mapping initially generated by the heuristic. We show that the effectiveness of the iterative approach is heuristic dependent and study the behavior of the iterative approach for each of the chosen heuristics. This work which identifies heuristics can and cannot attain improvements in the completion time of non-make span machines using this iterative approach.

[1]  Ishfaq Ahmad,et al.  Optimal task assignment in heterogeneous distributed computing systems , 1998, IEEE Concurr..

[2]  Howard Jay Siegel,et al.  Heterogeneous Distributed Computing , 1999 .

[3]  Anthony A. Maciejewski,et al.  Resource allocation for periodic applications in a shipboard environment , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[4]  Hong Zhang,et al.  Segmented min-min: a static mapping algorithm for meta-tasks on heterogeneous computing systems , 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556).

[5]  Klara Nahrstedt,et al.  QoS and Contention-Aware Multi-Resource Reservation , 2004, Cluster Computing.

[6]  R. F. Freund,et al.  Guest Editor's Introduction: Heterogeneous Processing , 1993 .

[7]  R. F. Freund,et al.  Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems , 1999, J. Parallel Distributed Comput..

[8]  Atakan Dogan,et al.  Genetic Algorithm Based Scheduling of Meta-Tasks with Stochastic Execution Times in Heterogeneous Computing Systemst1 , 2004, Cluster Computing.

[9]  Viktor K. Prasanna,et al.  Heterogeneous computing: challenges and opportunities , 1993, Computer.

[10]  L. Darrell Whitley,et al.  Leap Before You Look: An Effective Strategy in an Oversubscribed Scheduling Problem , 2004, AAAI.

[11]  Oscar H. Ibarra,et al.  Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors , 1977, JACM.

[12]  Francine Berman,et al.  Heuristics for scheduling parameter sweep applications in grid environments , 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556).

[13]  Ladislau Bölöni,et al.  A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems , 2001, J. Parallel Distributed Comput..

[14]  Arif Ghafoor,et al.  A distributed heterogeneous supercomputing management system , 1993, Computer.

[15]  L. Darrell Whitley,et al.  The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best , 1989, ICGA.

[16]  Anurag Kumar,et al.  Performance Analysis and Scheduling of Stochastic Fork-Join Jobs in a Multicomputer System , 1993, IEEE Trans. Parallel Distributed Syst..

[17]  Arif Ghafoor,et al.  Estimation of Execution times on Heterogeneous Supercomputer Architectures , 1993, 1993 International Conference on Parallel Processing - ICPP'93.