On choosing a task assignment policy for a distributed server system

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1469, Issue , 1998, Pages 231-242

  Harchol Balter, Mor ^a   Crovella, Mark E ^b   Murta, Cristina D ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SIZE DISTRIBUTION;

COMPUTER WORKLOADS; DEGREE OF VARIABILITY; DISTRIBUTED SERVERS; DYNAMIC POLICY; FIRST COME FIRST SERVES; ORDERS OF MAGNITUDE; SERVICE DEMAND; TASK ASSIGNMENT;

ROUTERS;

EID: 84958061023     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68061-6_19     Document Type: Conference Paper

References (15)

1. 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.
2. M. E. Crovella and L. Lipsky. Long-lasting transient conditions in simulations with heavy-tailed workloads. In 1997 Winter Simulation Conference, 1997.
3. 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, pages 1-23. Chapman & Hall, New York, 1998.
4. M. Harchol-Balter, M. E. Crovella, and C. D. Murta. On choosing a task assignment policy for a distributed server system. Technical Report MIT-LCS-TR-757, MIT Laboratory for Computer Science, 1998.
5. M. Harchol-Balter and A. Downey. Exploiting process lifetime distributions for dynamic load balancing. ACM Transactions on Computer Systems, 15(3), 1997.
6. S. Hotovy, D. Schneider, and T. O’Donnell. Analysis of the early workload on the Cornell Theory Center IBM SP2. Technical Report 96TR234, CTC, Jan. 1996.
7. G. Irlam. Unix file size survey, http://www.base.com/gordoni/ufs93.html, 1994.
8. W. E. Leland and T. J. Ott. Load-balancing heuristics and process behavior. In Proceedings of Performance and ACM Sigmetrics, pages 54-69, 1986.
9. R. D. Nelson and T. K. Philips. An approximation for the mean response time for shortest queue routing with general interarrival and service times. Performance Evaluation, 17:123-139, 1998.
10. V. Paxson and S. Floyd. Wide-area traffic: The failure of Poisson modeling. IEEE/ACM Transactions on Networking, pages 226-244, June 1995.
11. D. L. Peterson and D. B. Adams. Fractal patterns in DASD I/O traffic. In CMG Proceedings, December 1996.
12. R. W. Weber. On the optimal assignment of customers to parallel servers. Journal of Applied Probability, 15:406-413, 1978.
13. Ward Whitt. Deciding which queue to join: Some counterexamples. Operations Research, 34(l):226-244, January 1986.
14. W. Winston. Optimality of the shortest line discipline. Journal of Applied Probability, 14:181-189, 1977.
15. R. W. Wolff. Stochastic Modeling and the Theory of Queues. Prentice Hall, 1989.