
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Issam AlAzzoni, Douglas G. Down, "Linear ProgrammingBased Affinity Scheduling of Independent Tasks on Heterogeneous Computing Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 19, no. 12, pp. 16711682, December, 2008.  
BibTex  x  
@article{ 10.1109/TPDS.2008.59, author = {Issam AlAzzoni and Douglas G. Down}, title = {Linear ProgrammingBased Affinity Scheduling of Independent Tasks on Heterogeneous Computing Systems}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {19}, number = {12}, issn = {10459219}, year = {2008}, pages = {16711682}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.59}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Linear ProgrammingBased Affinity Scheduling of Independent Tasks on Heterogeneous Computing Systems IS  12 SN  10459219 SP1671 EP1682 EPD  16711682 A1  Issam AlAzzoni, A1  Douglas G. Down, PY  2008 KW  distributed systems KW  load balancing KW  heterogeneous processors KW  queueing theory VL  19 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] Beowulf Cluster Computing with Linux, T. Sterling, E. Lusk, and W. Gropp, eds., MIT Press, 2003.
[2] I. Foster, C. Kesselman, and S. Tuecke, “The Anatomy of the Grid: Enabling Scalable Virtual Organizations,” Int'l J. High Performance Computing Applications, vol. 15, no. 3, pp. 200222, 2001.
[3] J.K. Kim, S. Shivle, H.J. Siegel, A.A. Maciejewski, T.D. Braun, M. Schneider, S. Tideman, R. Chitta, R.B. Dilmaghani, R. Joshi, A. Kaul, A. Sharma, S. Sripada, P. Vangari, and S.S. Yellampalli, “Dynamically Mapping Tasks with Priorities and Multiple Deadlines in a Heterogeneous Environment,” J. Parallel and Distributed Computing, vol. 67, no. 2, pp. 154169, 2007.
[4] M. Mitzenmacher, “How Useful Is Old Information?” IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 1, pp. 620, 2000.
[5] I. AlAzzoni 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. 105111, 2007.
[6] Y.T. He, I. AlAzzoni, and D. Down, “MARO—MinDrift Affinity Routing for Resource Management in Heterogeneous Computing Systems,” Proc. Conf. of the Centre for Advanced Studies on Collaborative Research (CASCON '07), pp. 7185, 2007.
[7] L. Kontothanassis and D. Goddeau, “Profile Driven Scheduling for a Heterogeneous Server Cluster,” Proc. 34th Int'l Conf. Parallel Processing (ICPP '05), pp. 336345, 2005.
[8] M. Maheswaran, S. Ali, H.J. Siegel, D. Hensgen, and R.F. Freund, “Dynamic Matching and Scheduling of a Class of Independent Tasks onto Heterogeneous Computing Systems,” Proc. Eighth Heterogeneous Computing Workshop (HCW '99), pp. 3044, 1999.
[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 ICLUT0205, Innovative Computing Dept., Univ. of Tennessee, June 2002.
[10] R. Freund, M. Gherrity, S. Ambrosius, M. Campbell, M. Halderman, D. Hensgen, E. Keith, T. Kidd, M. Kussow, J.D. Lima, F. Mirabile, L. Moore, B. Rust, and H.J. Siegel, “Scheduling Resources in MultiUser, Heterogeneous, Computing Environments with SmartNet,” Proc. Seventh Heterogeneous Computing Workshop (HCW'98), pp. 184199, 1998.
[11] R. Freund, T. Kidd, and L. Moore, “SmartNet: A Scheduling Framework for Heterogeneous Computing,” Proc. Second Int'l Symp. Parallel Architectures, Algorithms and Networks (ISPAN '96), pp. 514521, 1996.
[12] A. Sharifnia, “Instability of the JointheShortestQueue and FCFS Policies in Queuing Systems and Their Stabilization,” Operations Research, vol. 45, no. 2, pp. 309314, 1997.
[13] S. Andradóttir, H. Ayhan, and D.G. Down, “Dynamic Server Allocation for Queueing Networks with Flexible Servers,” Operations Research, vol. 51, no. 6, pp. 952968, 2003.
[14] R. Armstrong, “Investigation of Effect of Different RunTime Distributions on SmartNet Performance,” Master's thesis, Naval Postgraduate School, 1997.
[15] M. Mitzenmacher, “The Power of Two Choices in Randomized Load Balancing,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 10, pp. 10941104, Oct. 2001.
[16] Y.T. He, “Exploiting Limited Customer Choice and Server Flexibility,” PhD dissertation, McMaster Univ., 2007.
[17] A. Stolyar, “Optimal Routing in OutputQueued Flexible Server Systems,” Probability in the Eng. and Information Sciences, vol. 19, no. 2, pp. 141189, 2005.
[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. 307320, 2001.
[19] H. Franke, J. Jann, J.E. Moreira, P. Pattnaik, and M.A. Jette, “An Evaluation of Parallel Job Scheduling for ASCI BluePacific,” Proc. ACM/IEEE Conf. Supercomputing (SC '99), pp. 1118, 1999.
[20] P.S. Ansell, K.D. Glazebrook, and C. Kirkbride, “Generalised ‘Join the Shortest Queue’ Policies for the Dynamic Routing of Jobs to Multiclass Queues,” J. Operational Research Soc., vol. 54, pp. 379389, 2003.
[21] K.D. Glazebrook and C. Kirkbride, “Dynamic Routing to Heterogeneous Collections of Unreliable Servers,” Queueing Systems: Theory and Applications, vol. 55, no. 1, pp. 925, 2007.
[22] K. Wasserman, G. Michailidis, and N. Bambos, “Optimal Processor Allocation to Differentiated Job Flows,” Performance Evaluation, vol. 63, no. 1, pp. 114, 2006.
[23] H. Li, D. Groep, and L. Wolters, “Workload Characteristics of a MultiCluster Supercomputer,” Job Scheduling Strategies for Parallel Processing, D.G. Feitelson, L. Rudolph, and U. Schwiegelshohn, eds., pp. 176193, 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.
[25] S. Ali, A.A. Maciejewski, H.J. Siegel, and J.K. Kim, “Measuring the Robustness of a Resource Allocation,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 7, pp. 630641, July 2004.
[26] A.M. Mehta, J. Smith, H.J. Siegel, A.A. Maciejewski, A. Jayaseelan, and B. Ye, “Dynamic Resource Allocation Heuristics That Manage Tradeoff between Makespan and Robustness,” J. Supercomputing, vol. 42, no. 1, pp. 3358, 2007.
[27] V. Shestak, J. Smith, H.J. Siegel, and A.A. Maciejewski, “A Stochastic Approach to Measuring the Robustness of Resource Allocations in Distributed Systems,” Proc. 35th Int'l Conf. Parallel Processing (ICPP '06), pp. 459470, 2006.
[28] H. Chen, “Fluid Approximations and Stability of Multiclass Queueing Networks: WorkConserving Disciplines,” Annals of Applied Probability, vol. 5, pp. 637655, 1995.
[29] H. Chen and D. Yao, Fundamentals of Queueing Networks: Performance, Asymptotics and Optimization. SpringerVerlag, 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. 4977, 1995.
[32] J.G. Dai and S. Meyn, “Stability and Convergence of Moments for Multiclass Queueing Networks via Fluid Limit Models,” IEEE Trans. Automatic Control, vol. 40, pp. 18891904, 1995.