Conference Necessary and sufficient conditions for representing general distributions by Coxians 2003 • Lecture Notes in Computer Science • 2794:182-199 Osogami T, Harchol-Balter M
Journal Article Size-based scheduling to improve web performance 2003 • ACM Transactions on Computer Systems • 21(2):207-233 Harchol-Balter M, Schroeder B, Bansal N, Agrawal M
Conference Web servers under overload: How scheduling can help 2003 • PROVIDING QUALITY OF SERVICE IN HETEROGENEOUS ENVIRONMENTS, VOLS 5A AND 5B • 5A-B:171-180 Schroeder B, Harchol-Balter M
Conference Analysis of task assignment with cycle stealing under central queue 2002 • Distributed Computing Systems • 628-637 Harchol-Balter M, Li CH, Osogami T, Scheller-Wolf A, Squillante MS
Journal Article Asymptotic convergence of scheduling policies with respect to slowdown 2002 • Performance evaluation (Print) • 49(1-4):241-256 Harchol-Balter M, Sigman K, Wierman A
Journal Article Task assignment with unknown duration 2002 • Journal of the ACM • 49(2):260-288 Harchol-Balter M
Journal Article Understanding the slowdown of large jobs in an M/GI/1 system 2002 • Performance Evaluation Review • 30(3):9-11 Harchol-Balter M, Sigman K, Wierman A
Journal Article Analysis of M/G/1/SRPT under transient overload 2001 • Performance Evaluation Review • 29(3):12-14 Bansal N, Harchol-Balter M
Conference Analysis of SRPT scheduling: investigating unfairness 2001 • Performance Evaluation Review • 29(1):279-290 Bansal N, Harchol-Balter M
Conference Analysis of SRPT scheduling: Investigating unfairness 2001 • Performance Evaluation Review • 29(1):279-290 Bansal N, Harchol-Balter M
Journal Article Job placement with unknown duration and no preemption 2001 • Performance Evaluation Review • 28(4):3-5 Harchol-Balter M
Conference SRPT scheduling for web servers 2001 • Lecture Notes in Computer Science • 2221:11-20 Harchol-Balter M, Bansal N, Schroeder B, Agrawal M
Journal Article Analysis of SRPT Scheduling: Investigating Unfairness 2000 Bansal N, Harchol-Balter M
Conference Evaluation of task assignment policies for supercomputing servers: The case for load unbalancing and fairness 2000 • Proceedings of the IEEE International Symposium on High Performance Distributed Computing • 211-220 Schroeder B, Harchol-Balter M
Journal Article Evaluation of Task Assignment Policies for Supercomputing Servers: The Case for Load Unbalancing and Fairness 2000 Schroeder B, Harchol-Balter M
Journal Article General dynamic routing with per-packet delay guarantees of <i>O</i>(distance+1/session rate) 2000 • SIAM journal on computing (Print) • 30(5):1594-1623 Andrews M, Fernández A, Harchol-Balter M, Leighton T, Zhang L
Conference Task assignment with unknown duration 2000 • Distributed Computing Systems • 214-224 Harchol-Balter M
Conference Connection scheduling in web servers 1999 • 2nd USENIX Symposium on Internet Technologies and Systems, USITS 1999 Crovella ME, Frangioso R, Harchol-Baltery M
Journal Article On choosing a task assignment policy for a distributed server system 1999 • Journal of Parallel and Distributed Computing • 59(2):204-228 Harchol-Balter M, Crovella ME, Murta CD
Journal Article Resource discovery in distributed networks 1999 • Proceedings of the Annual ACM Symposium on Principles of Distributed Computing • 229-237 Harchol-Balter M, Leighton T, Lewin D
Journal Article On choosing a task assignment policy for a distributed server system 1998 • Lecture Notes in Computer Science • 1469:231-242 Harchol-Balter M, Crovella ME, Murta CD
Conference Task assignment in a distributed system (extended abstract): improving performance by unbalancing load 1998 • Performance Evaluation Review • 26(1):268-269 Crovella ME, Harchol-Balter M, Murta CD
Journal Article Task assignment in a distributed system: Improving performance by unbalancing load 1998 • Performance Evaluation Review • 26(1):268-269 Crovella ME, Harchol-Balter M, Murta CD
Journal Article Exploiting Process Lifetime Distributions for Dynamic Load Balancing 1997 • ACM Transactions on Computer Systems • 15(3):253-285 Harchol-Balter M, Downey AB