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

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.

[1]  Frederic Magoules.  Fundamentals of Grid Computing: Theory, Algorithms and Technologies , 2009 .

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

[3]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

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

[5]  Ken Kennedy,et al.  TaskScheduling Strategies forWorkflow-based Applications inGrids , 2005 .

[6]  S. Ghanbari,et al.  On-line Mapping Algorithms in Highly Heterogeneous Computational Grids : A Learning Automata Approach , 2005 .

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

[8]  Liria Matsumoto Sato,et al.  Improvement on Scheduling Dependent Tasks for Grid Applications , 2009, 2009 International Conference on Computational Science and Engineering.

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

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

[11]  Mohammad Reza Meybodi,et al.  Learning Automata Based Algorithms for Mapping of a Class of Independent Tasks over Highly Heterogeneous Grids , 2005, EGC.

[12]  Gregory A. Koenig,et al.  Time Utility Functions for Modeling and Evaluating Resource Allocations in a Heterogeneous Computing System , 2011, 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum.

[13]  Anthony A. Maciejewski,et al.  A hybrid Branch-and-Bound and evolutionary approach for allocating strings of applications to heterogeneous distributed computing systems , 2008, J. Parallel Distributed Comput..

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

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

[16]  Anthony A. Maciejewski,et al.  Dynamic resource allocation heuristics that manage tradeoff between makespan and robustness , 2007, The Journal of Supercomputing.

[17]  Sadiq M. Sait,et al.  Task matching and scheduling in heterogeneous systems using simulated evolution , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[18]  Peter Norvig,et al.  Artificial intelligence - a modern approach, 2nd Edition , 2003, Prentice Hall series in artificial intelligence.

[19]  Imtiaz Ahmad,et al.  An Integrated Technique for Task Matching and Scheduling onto Distributed Heterogeneous Computing Systems , 2002, J. Parallel Distributed Comput..

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

[21]  Emmanuel Jeannot,et al.  Multicriteria Scheduling Heuristics for Gridrpc Systems , 2006, Int. J. High Perform. Comput. Appl..

[22]  Guoliang Chen,et al.  A benefit function mapping heuristic for a class of meta-tasks in grid environments , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[23]  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..

[24]  Attila Gürsoy,et al.  A Novel Economic-Based Scheduling Heuristic for Computational Grids , 2007, Int. J. High Perform. Comput. Appl..

[25]  Eddy Caron,et al.  Definition, modelling and simulation of a grid computing scheduling system for high throughput computing , 2007, Future Gener. Comput. Syst..

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

[27]  Albert Y. Zomaya,et al.  Robust task scheduling for volunteer computing systems , 2010, The Journal of Supercomputing.

[28]  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).

[29]  Francine Berman,et al.  New Grid Scheduling and Rescheduling Methods in the GrADS Project , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[30]  Douglas G. Down,et al.  Linear Programming Based Affinity Scheduling for Heterogeneous Computing Systems , 2007, PDPTA.

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

[32]  Oisín Curran,et al.  A workflow model for heterogeneous computing environments , 2009, Future Gener. Comput. Syst..

[33]  Jiang Changjun,et al.  A heuristic scheduling strategy for independent tasks on grid , 2005, Eighth International Conference on High-Performance Computing in Asia-Pacific Region (HPCASIA'05).

[34]  Bora Uçar,et al.  Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositories , 2007, J. Parallel Distributed Comput..

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

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

[37]  Emmanuel Jeannot,et al.  Scheduling Messages For Data Redistribution: An Experimental Study , 2006, Int. J. High Perform. Comput. Appl..

[38]  Anthony A. Maciejewski,et al.  Dynamic Resource Management in Energy Constrained Heterogeneous Computing Systems Using Voltage Scaling , 2008, IEEE Transactions on Parallel and Distributed Systems.

[39]  Juan Li,et al.  Comparison and analysis of eight scheduling heuristics for the optimization of energy consumption and makespan in large-scale distributed systems , 2010, The Journal of Supercomputing.

[40]  Sanjeev Baskiyar,et al.  A low complexity algorithm for dynamic scheduling of independent tasks onto heterogeneous computing systems , 2005, ACM-SE 43.

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

[42]  Gilles Fedak,et al.  Scheduling independent tasks sharing large data distributed with BitTorrent , 2005, The 6th IEEE/ACM International Workshop on Grid Computing, 2005..

[43]  Francine Berman,et al.  Adaptive Computing on the Grid Using AppLeS , 2003, IEEE Trans. Parallel Distributed Syst..

[44]  Jie Pan,et al.  Introduction to Grid Computing , 2009 .

[45]  Anthony A. Maciejewski,et al.  Heuristics for Robust Resource Allocation of Satellite Weather Data Processing on a Heterogeneous Parallel System , 2011, IEEE Transactions on Parallel and Distributed Systems.

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

[47]  Enrico Gobbetti,et al.  Encyclopedia of Electrical and Electronics Engineering , 1999 .

[48]  Francisco Vilar Brasileiro,et al.  Trading Cycles for Information: Using Replication to Schedule Bag-of-Tasks Applications on Computational Grids , 2003, Euro-Par.

[49]  Ladislau Bölöni,et al.  Characterizing Resource Allocation Heuristics for Heterogeneous Computing Systems , 2005, Adv. Comput..