 | David McWherter, Bianca Schroeder, Natassa Ailamaki, and Mor Harchol-Balter: Priority Mechanisms for OLTP and Transactional Web Applications. In 20th International Conference on Data Engineering, (2004), p. 535 PDF |
| David McWherter, Bianca Schroeder, Natassa Ailamaki, and Mor Harchol-Balter: Priority Mechanisms for OLTP and Transactional Web Applications. In 20th International Conference on Data Engineering, (2004), p. 535 PDF |
| Takayuki Osogami, Mor Harchol-Balter, Alan Scheller-Wolf, and Li Zhang: An Adaptive Threshold-Based Policy for Sharing Servers with Affinities. Submitted to the Technical Report CMU-CS-04-112, 2004 PDF |
| Takayuki Osogami, Mor Harchol-Balter, Alan Scheller-Wolf: Analysis of Cycle Stealing with Switching Cost. SIGMETRICS 2003 PDF |
| Mor Harchol-Balter, Cuihong Li, Takayuki Osogami, Alan Scheller-Wolf: Cycle Stealing under Immediate Dispatch Task Assignment. SPAA 2003 PDF |
| Adam Wierman, Nikhil Bansal, and Mor Harchol-Balter : A Note Comparing Response Times in the M/GI/1/FB and M/GI/1/PS Queues . To appear in Operations Research Letters PDF |
| Adam Wierman, Mor Harchol-Balter: Classifying Scheduling Policies with Respect to Unfairness in an M/GI/1. SIGMETRICS 2003, Technical Report CMU-CS-02-187 PDF / abs |
| Takayuki Osogami and Mor Harchol-Balter: Necessary and sufficient conditions for representing general distributions by Coxians. To appear in 13th International Conference on Modelling Techniques and Tools for Computer Performance Evaluation (Tools 03) PDF |
| Bianca Schroeder and Mor Harchol-Balter: Web servers under overload: How scheduling can help. To appear in 18th International Teletraffic Congress. Berlin, Germany. September 2003. (Original Technical report Number CMU-CS-02-143) PDF |
| Takayuki Osogami and Mor Harchol-Balter: A closed-form solution for mapping general distributions to minimal PH distributions. To appear in 13th International Conference on Modelling Techniques and Tools for Computer Performance Evaluation (Tools 03) PDF |
| Mor Harchol-Balter, Cuihong Li, Takayuki Osogami, Alan Scheller-Wolf, and Mark Squillante: Cycle Stealing under Immediate Dispatch Task Assignment. To appear in Fifteenth ACM Annual Symposium on Parallel Algorithms and Architectures. San Diego, CA. June, 2003 PDF |
| Takayuki Osogami, Adam Wierman, Mor Harchol-Balter: How many servers are best in a dual-priority FCFS system?. Technical Report CMU-CS-03-201, 2003 PDF |
| Adam Wierman, Takayuki Osogami, Mor Harchol-Balter, Alan Scheller-Wolf: Analyzing the Effect of Prioritized Background Tasks in Multiserver Systems. Technical Report CMU-CS-03-213, 2003 PDF |
| Mor Harchol-Balter, Nikhil Bansal, Bianca Schroeder, Mukesh Agrawal: Size-based Scheduling to Improve Web Performance. Currently being reviewed PDF |
| Mor Harchol-Balter, Karl Sigman, and Adam Wierman: Asymptotic Convergence of Scheduling Policies with respect to Slowdown. Performance Evaluation. Volume 49, September 2002 PDF |
| Mor Harchol-Balter, Karl Sigman, and Adam Wierman: Understanding the Slowdown of Large Jobs in an M/GI/1 System. MAMA 2002 PDF |
| Nikhil Bansal, Mor Harchol-Balter: Analysis of SRPT scheduling: investigating unfairness. SIGMETRICS/Performance 2001: 279-290 PDF / abs |
| Mor Harchol-Balter: Job Placement with Unknown Duration and No Preemption. Performance Evaluation Review Volume 28, No. 4, March 2001. Invited paper PDF |
| Mor Harchol-Balter, Nikhil Bansal, Bianca Schroeder, Mukesh Agrawal: Implementation of SRPT Scheduling in Web Servers. Technical report Number CMU-CS-00-170, includes Flash results and Later technical report version including Apache results and Abstract PDF |
| Matthew Andrews, Antonio Fernández, Mor Harchol-Balter, Frank Thomson Leighton, Lisa Zhang: General Dynamic Routing with Per-Packet Delay Guarantees of O(Distance + 1/Session Rate). SIAM J. Comput. 30(5): 1594-1623 (2000) PDF / abs |
| Mor Harchol-Balter: Task Assignment with Unknown Duration. ICDCS 2000: 214-224 PDF / abs |
| Bianca Schroeder, Mor Harchol-Balter: Evaluation of Task Assignment Policies for Supercomputing Servers: The Case for Load Unbalancing and Fairness. 9th IEEE Symposium on High Performance Distributed Computing (HPDC '00) , Pittsburgh, Pennsylvania, August 2000. PDF |
CENTER
Carnegie
Mellon 
Aladdin
