Cycle stealing under immediate dispatch task assignment

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2003, Pages 274-285

  Harchol Balter, Mor ^a   Li, Cuihong ^a   Osogami, Takayuki ^a   Scheller Wolf, Alan ^a   Squillante, Mark S ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b IBM RESEARCH   (United States)

Author keywords

Cycle stealing; Distributed system; Load sharing; Matrix analytic methods; Server farm; Starvation; Supercomputing; Task assignment; Unfairness

Indexed keywords

APPROXIMATION THEORY; COMPUTATION THEORY; COMPUTER ARCHITECTURE; COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; FLOW CONTROL; GRAPH THEORY; MARKOV PROCESSES; SYSTEM STABILITY;

COMPUTATIONAL CYCLES;

SERVERS;

EID: 0038379290     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/777412.777462     Document Type: Conference Paper

References (34)

1. The PSC's Cray J90's. http://www.psc.edu/machines/cray/j90/j90.html, 1998.
2. Supercomputing at the NAS facility. http://www.nas.nasa.gov/Technology/Supercomputing/, 1998.
3. S. Asmussen. Queueing simulation in heavy traffic. Mathematics of Operations Research, 17(1), 1992.
4. F. Bonomi and A. Kumar. Adaptive optimal load balancing in a nonhomogeneous multiserver system with a central job scheduler. IEEE Transactions on Computers, 39(10):1232-1250, October 1990.
5. Cisco Systems Local Director. www.cisco.com/warp/public/cc/pd/cxsr/400/index.shtml.
6. D. Cox. A use of complex probabilities in the theory of stochastic processes. Proceedings of Cambridge Philosophical Society, 51:313-319, 1955.
7. M. E. Crovella and A. Bestavros. Self-similarity in World Wide Web traffic: Evidence and possible causes. IEEE/ACM Transactions on Networking, 5(6):835-846, December 1997.
8. M. E. Crovella, M. S. Taqqu, and A. Bestavros. Heavy-tailed probability distributions in the world wide web. In A Practical Guide To Heavy Tails, chapter 1, pages 1-23. Chapman & Hall, New York, 1998.
9. A. Ephremides, P. Varaiya, and J. Walrand. A simple dynamic routing problem. IEEE Transactions on Automatic Control, AC-25(4):690-693, 1980.
10. M. Harchol-Balter. Task assignment with unknown duration. Journal of the ACM, 49(2), 2002.
11. M. Harchol-Balter, M. Crovella, and C. Murta. On choosing a task assignment policy for a distributed server system. IEEE Journal of Parallel and Distributed Computing, 59:204-228, 1999.
12. M. Harchol-Balter and A. Downey. Exploiting process lifetime distributions for dynamic load balancing. ACM Transactions on Computer Systems, 15(3), 1997.
13. M. Harchol-Balter, C. Li, T. Osogami, A. Scheller-Wolf, and M. Squillante. Task assignment with cycle stealing under central queue. In Proceedings of 23rd International Conference on Distributed Computing Systems, May 2003.
14. S. G. Hotovy. Workload evolution on the Cornell Theory Center IBM SP2. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pages 27-40. Springer-Verlag, 1996. Lecture Notes in Computer Science Vol. 1162.
15. G. Hunt, G. Goldszmidt, R. King, and R. Mukherjee. Network dispatcher: A connection router for scalable internet services. In Proceedings of the 7th International WWW Conference, April 1998.
16. V. S. Iyengar, L. H. Trevillyan, and P. Bose. Representative traces for processor models with infinite cache. In Proceedings of the International Symposium on High-Performance Computer Architecture (HPCA), pages 62-72, February 1996.
17. M. A. Johnson and M. F. Taaffe. An investigation of phase-distribution moment-matching algorithms for use in queueing models. Queueing Systems, 8:129-147, 1991.
18. A. Lang and J. L. Arthur. Parameter approximation for phase-type distributions. In S. R. Chakravarthy and A. S. Alfa, editors, Matrix-Analytic Methods in Stochastic Models, pages 151-206. Marcel Dekker, 1997.
19. G. Latouche and V. Ramaswami. Introduction to Matrix Analytic Methods in Stochastic Modeling. ASA-SIAM, Philadelphia, 1999.
20. C. Leiserson. The Pleiades alpha cluster at M.I.T.. Documentation at: //http://bonanza.lcs.mit.edu/, 1998.
21. C. Leiserson. The Xolas supercomputing project at M.I.T.. Documentation available at: http://xolas.lcs.mit.edu, 1998.
22. W. E. Leland and T. J. Ott. Load-balancing heuristics and process behavior. In Proceedings of Performance and ACM Sigmetrics, pages 54-69, 1986.
23. J. D. C. Little. A proof of the queuing formula L = λW. Operations Research, 9:383-387, 1961.
24. M. F. Neuts. Matrix-Geometric Solutions in Stochastic Models. Johns Hopkins University Press, 1981.
25. M. F. Neuts. Structured Stochastic Matrices of M/G/1 Type and Their Applications. Marcel Dekker, 1989.
26. T. Osogami, M. Harchol-Balter, and A. Scheller-Wolf. Analysis of cycle stealing with switching cost. In ACM Sigmetrics 2003 Conference on Measurement and Modeling of Computer Systems, June 2003.
27. V. Paxson and S. Floyd. Wide-area traffic: The failure of Poisson modeling. IEEE/ACM Transactions on Networking, pages 226-244, June 1995.
28. D. L. Peterson and D. B. Adams. Fractal patterns in DASD I/O traffic. In CMG Proceedings, December 1996.
29. K. W. Ross and D. D. Yao. Optimal load balancing and scheduling in a distributed computer system. Journal of the ACM, 38(3):676-690, July 1991.
30. B. Schroeder and M. Harchol-Balter. Evaluation of task assignment policies for supercomputing servers: The case for load unbalancing and fairness. In Proceedings of HPDC 2000, pages 211-219, 2000.
31. M. S. Squillante, D. D. Yao, and L. Zhang. Web traffic modeling and web server performance analysis. In Proceedings of the IEEE Conference on Decision and Control, December 1999.
32. W. Whitt. Planning queueing simulations. Management Science, 35(11), 1989.
33. W. Winston. Optimality of the shortest line discipline. Journal of Applied Probability, 14:181-189, 1977.
34. R. W. Wolff. Stochastic Modeling and the Theory of Queues. Prentice Hall, 1989.