On Choosing a Task Assignment Policy for a Distributed Server System

Journal of Parallel and Distributed Computing

Volumn 59, Issue 2, 1999, Pages 204-228

  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

Distributed servers; Heavy tailed workloads; High variance; Queueing theory; Scheduling; Task assignment

Indexed keywords

EID: 0000950254     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1999.1577     Document Type: Article

References (17)

1. Crovella M. E., Bestavros A. Self-similarity in World Wide Web traffic: Evidence and possible causes. IEEE/ACM Trans. Networking. 5:Dec. 1997;835-846.
2. Crovella M. E., Lipsky L. Long-lasting transient conditions in simulations with heavy-tailed workloads. Proc. 1997 Winter Simulation Conference. 1997.
3. Crovella M. E., Taqqu M. S., Bestavros A. Heavy-tailed probability distributions in the World Wide Web. A Practical Guide To Heavy Tails. 1998;Chapman & Hall, New York. p. 1-23.
4. Ephremides A., Varaiya P., Walrand J. A simple dynamic routing problem. IEEE Trans. Automatic Control. AC-25:1980;690-693.
5. Harchol-Balter M., Downey A. Exploiting process lifetime distributions for dynamic load balancing. ACM Trans. Comput. Systems. 15:1997.
6. Hotovy S., Schneider D., O'Donnell T. Technical Report. Jan. 1996.
7. G. Irlam, Unix file size survey - 1993, Available at, http://www.base.com/gordoni/ufs93.html , Sep. 1994.
8. Leland W. E., Ott T. J. Load-balancing heuristics and process behavior. Proc. Performance and ACM Sigmetrics. 1986;. p. 54-69.
9. Nelson R. D., Philips T. K. An approximation to the response time for shortest queue routing. Performance Evaluation Rev. 7:1989;181-189.
10. Nelson R. D., Philips T. K. An approximation for the mean response time for shortest queue routing with general interarrival and service times. Performance Evaluation. 17:1998;123-139.
11. Paxson V., Floyd S. Wide-area traffic: The failure of Poisson modeling. IEEE/ACM Trans. Networking. June 1995;226-244.
12. Peterson D. L., Adams D. B. Fractal patterns in DASD I/O traffic. CMG Proc. Dec. 1996.
13. Sozaki S., Ross R. Approximations in finite capacity multiserver queues with Poisson arrivals. J. Appl. Probab. 13:1978;826-834.
14. Weber R. W. On the optimal assignment of customers to parallel servers. J. Appl. Probab. 15:1978;406-413.
15. Whitt W. Deciding which queue to join: Some counterexamples. Oper. Res. 34:Jan. 1986;226-244.
16. Winston W. Optimality of the shortest line discipline. J. Appl. Probab. 14:1977;181-189.
17. Wolff R. W. Stochastic Modeling and the Theory of Queues. 1989;Prentice-Hall, New York.