Subscribe

## Linear Programming-Based Affinity Scheduling of Independent Tasks on Heterogeneous Computing Systems

Issue No.12 - December (2008 vol.19)

pp: 1671-1682

Issam Al-Azzoni , McMaster University, Hamilton

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.59

ABSTRACT

Resource management systems (RMS) are an important component in heterogeneous computing (HC) systems. One of the jobs of an RMS is the mapping of arriving tasks onto the machines of the HC system. Many different mapping heuristics have been proposed in recent years. However, most of these heuristics suffer from several limitations. One of these limitations is the performance degradation that results from using outdated global information about the status of all machines in the HC system. This paper proposes several heuristics which address this limitation by only requiring partial information in making the mapping decisions. These heuristics utilize the solution to a linear programming (LP) problem which maximizes the system capacity. Simulation results show that our heuristics perform very competitively while requiring dramatically less information.

INDEX TERMS

distributed systems, load balancing, heterogeneous processors, queueing theory

CITATION

Issam Al-Azzoni, "Linear Programming-Based Affinity Scheduling of Independent Tasks on Heterogeneous Computing Systems",

*IEEE Transactions on Parallel & Distributed Systems*, vol.19, no. 12, pp. 1671-1682, December 2008, doi:10.1109/TPDS.2008.59REFERENCES

- [1]
Beowulf Cluster Computing with Linux, T. Sterling, E. Lusk, and W. Gropp, eds., MIT Press, 2003.- [5] I. Al-Azzoni and D. Down, “Linear Programming Based Affinity Scheduling for Heterogeneous Computing Systems,”
Proc. Int'l Conf. Parallel and Distributed Processing Techniques and Applications (PDPTA '07), pp. 105-111, 2007.- [9] D. Arnold, S. Agrawal, S. Blackford, J. Dongarra, M. Miller, K. Seymour, K. Sagi, Z. Shi, and S. Vadhiyar, ”Users' Guide to NetSolve V1.4.1,” Technical Report ICL-UT-02-05, Innovative Computing Dept., Univ. of Tennessee, June 2002.
- [14] R. Armstrong, “Investigation of Effect of Different Run-Time Distributions on SmartNet Performance,” Master's thesis, Naval Postgraduate School, 1997.
- [16] Y.-T. He, “Exploiting Limited Customer Choice and Server Flexibility,” PhD dissertation, McMaster Univ., 2007.
- [18] T.D. Braun, H.J. Siegel, and A.A. Maciejewski, “Heterogeneous Computing: Goals, Methods, and Open Problems,”
Proc. Eighth Int'l Conf. High Performance Computing (HiPC '01), pp. 307-320, 2001.- [19] H. Franke, J. Jann, J.E. Moreira, P. Pattnaik, and M.A. Jette, “An Evaluation of Parallel Job Scheduling for ASCI Blue-Pacific,”
Proc. ACM/IEEE Conf. Supercomputing (SC '99), pp. 11-18, 1999.- [23] H. Li, D. Groep, and L. Wolters, “Workload Characteristics of a Multi-Cluster Supercomputer,”
Job Scheduling Strategies for Parallel Processing, D.G. Feitelson, L. Rudolph, and U. Schwiegelshohn, eds., pp. 176-193, Springer Verlag, 2004.- [24] J. Smith, L. Briceno, A.A. Maciejewski, H.J. Siegel, T. Renner, V. Shestak, J. Ladd, A. Sutton, D. Janovy, S. Govindasamy, A. Alqudah, R. Dewri, and P. Prakash, “Measuring the Robustness of Resource Allocations in a Stochastic Dynamic Environment,”
Proc. 21st Int'l Parallel and Distributed Processing Symp. (IPDPS), 2007.- [29] H. Chen and D. Yao,
Fundamentals of Queueing Networks: Performance, Asymptotics and Optimization. Springer-Verlag, 2001.- [30] J.G. Dai,
Stability of Fluid and Stochastic Processing Networks. Centre for Mathematical Physics and Stochastics, publication no. 9, http:/www.maphysto.dk/, 1999.- [31] J.G. Dai, “On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach via Fluid Limit Models,”
Annals of Applied Probability, vol. 5, pp. 49-77, 1995. |