Why segregating short jobs from long jobs under high variability is not always a win

2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009

Volumn , Issue , 2009, Pages 121-127

  Harchol Balter, Mor ^a   Scheller Wolf, Alan ^b   Young, Andrew ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c MORGAN STANLEY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CYCLE-STEALING; GREEDY POLICY; HIGH VARIABILITY; HYPEREXPONENTIAL; JOB SIZE; PARETO DISTRIBUTIONS; POOR PERFORMANCE; SERVER FARMS; SERVICE DEMAND; TASK ASSIGNMENT;

SIZE DISTRIBUTION;

SERVERS;

EID: 77949635020     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2009.5394853     Document Type: Conference Paper

References (23)

1. Eitan Bachmat and Hagit Sarfati. Analysis of size interval task assigment policies. Performance Evaluation Review, 36(2), 2008.
2. Paul Barford and Mark Crovella. Generating representative Web workloads for network and server performance evaluation. In Proceedings of the ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, pages 151-160, July 1998.
3. James Broberg, Zahir Tari, and Panlop Zeephongsekul. Task assignment with work-conserving migration. Parallel Computing, 32:808-830, 2006.
4. John Buzacott and George Shanthikumar. Stochastic Models in Manufacturing Systems. Prentice Hall, 1993.
5. Valeria Cardellini, Emiliano Casalicchio, Michele Colajanni, and Philip Yu. The state of the art in locally distributed web-server systems. Technical report, 2001.
6. Gianfranco Ciardo, Alma Riska, and Evgenia Smirni. Equiload: a load balancing policy for clustered web servers. Performance Evaluation, 46:101-124, 2001.
7. Mark Crovella and Azer Bestavros. Self-similarity in World Wide Web traffic: Evidence and possible causes. pages 160-169, May 1996.
8. Muhammad El-Taha and Bacel Maddah. Allocation of service time in a multiserver system. Management Science, 52(4):623-637, 2006.
9. Hanhua Feng, Vishal Misra, and Dan Rubenstein. Optimal statefree, size-aware dispatching for heterogeneous M/G-type systems. Performance Evaluation, 62:475-492, 2005.
10. Bin Fu, James Broberg, and Zahir Tari. Task assignment strategy for overloaded systems. In Proceedings of the Eighth IEEE International Symposium on Computers and Communications, 2003.
11. Mor Harchol-Balter. Task assignment with unknown duration. Journal of the ACM, 49(2):260-288, March 2002.
12. Mor Harchol-Balter, Mark Crovella, and Cristina Murta. On choosing a task assignment policy for a distributed server system. IEEE Journal of Parallel and Distributed Computing, 59:204-228, 1999.
13. Mor Harchol-Balter and Allen Downey. Exploiting process lifetime distributions for dynamic load balancing. In Proceedings of ACM SIGMETRICS, pages 13-24, Philadelphia, PA, May 1996. Best Paper Award for Integrating Systems and Theory.
14. Mor Harchol-Balter, Cuihong Li, Takayuki Osogami, Alan Scheller-Wolf, and Mark Squillante. Cycle stealing under immediate dispatch task assignment. In 15th ACM Symposium on Parallel Algorithms and Architectures, pages 274-285, San Diego, CA, June 2003.
15. Mor Harchol-Balter, Cuihong Li, Takayuki Osogami, Alan Scheller-Wolf, and Mark Squillante. Task assignment with cycle stealing under central queue. In 23rd International Conference on Distributed Computing Systems, pages 628-637, Providence, RI, May 2003.
16. Mor Harchol-Balter, Alan Scheller-Wolf, and Andrew Young. Surprising results on task assignment in server farms with high-variability workloads. In ACM Sigmetrics 2009 Conference on Measurement and Modeling of Computer Systems, 2009.
17. Wallace Hopp and Mark Spearman. Factory Physics. McGraw Hill/Irwin, 2 edition, 2000.
18. Steven Hotovy, David Schneider, and Timothy O'Donnell. Analysis of the early workload on the Cornell Theory Center IBM SP2. 1996.
19. Kazumasa Oida and Kazumasa Shinjo. Characteristics of deterministic optimal routing for a simple traffic control problem. In Performance, Computing and Communications Conference, IPCCC, February 1999.
20. Bianca Schroeder and Mor Harchol-Balter. Evaluation of task assignment policies for supercomputing servers: The case for load unbalancing and fairness. Cluster Computing: The journal of Networks, Software Tools, and Applications, 7(2):151-161, April 2004.
21. Anees Shaikh, Jennifer Rexford, and Kang Shin. Load-sensitive routing of long-lived IP flows. In Proceedings of ACM SIGCOMM, September 1999.
22. Zahir Tari, James Broberg, Albert Zomaya, and Roberto Baldoni. A least flow-time first load sharing approach for distributed server farm. Journal of Parallel and Distributed Computing, 65:832-842, 2005.
23. Nigel Thomas. Comparing job allocation schemes where service demand is unknown. Journal of Computer and System Sciences, 74:1067-1081, 2008.