![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Mor Harchol-Balter Bianca Schroeder , Mor Harchol-Balter, Arun Iyengar , Erich M. Nahum : Achieving Class-Based QoS for Transactional Workloads. ICDE 2006 : 153 Bianca Schroeder , Mor Harchol-Balter, Arun Iyengar , Erich M. Nahum , Adam Wierman : How to Determine a Good Multi-Programming Level for External Scheduling. ICDE 2006 : 60 David T. McWherter , Bianca Schroeder , Anastassia Ailamaki , Mor Harchol-Balter: Improving Preemptive Prioritization via Statistical Characterization of OLTP Locking. ICDE 2005 : 446-457 Adam Wierman , Mor Harchol-Balter, Takayuki Osogami : Nearly insensitive bounds on SMART scheduling. SIGMETRICS 2005 : 205-216 Adam Wierman , Mor Harchol-Balter: Classifying scheduling policies with respect to higher moments of conditional response time. SIGMETRICS 2005 : 229-240 Takayuki Osogami , Mor Harchol-Balter, Alan Scheller-Wolf : Analysis of cycle stealing with switching times and thresholds. Perform. Eval. 61 (4): 347-369 (2005) Mor Harchol-Balter, Takayuki Osogami , Alan Scheller-Wolf , Adam Wierman : Multi-Server Queueing Systems with Multiple Priority Classes. Queueing Syst. 51 (3-4): 331-360 (2005) Mor Harchol-Balter, Takayuki Osogami , Alan Scheller-Wolf : Robustness of threshold policies in beneficiary-donor model. SIGMETRICS Performance Evaluation Review 33 (2): 36-38 (2005) David T. McWherter , Bianca Schroeder , Anastassia Ailamaki , Mor Harchol-Balter: Priority Mechanisms for OLTP and Transactional Web Applications. ICDE 2004 : 535-546 Bianca Schroeder , Mor Harchol-Balter: Evaluation of Task Assignment Policies for Supercomputing Servers: The Case for Load Unbalancing and Fairness. Cluster Computing 7 (2): 151-161 (2004) Adam Wierman , Nikhil Bansal , Mor Harchol-Balter: A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues. Oper. Res. Lett. 32 (1): 73-76 (2004) Adam Wierman , Mor Harchol-Balter: Formalizing SMART scheduling. SIGMETRICS Performance Evaluation Review 32 (2): 12-13 (2004) Takayuki Osogami , Adam Wierman , Mor Harchol-Balter, Alan Scheller-Wolf : A recursive analysis technique for multi-dimensionally infinite Markov chains. SIGMETRICS Performance Evaluation Review 32 (2): 3-5 (2004) Takayuki Osogami , Mor Harchol-Balter: Necessary and Sufficient Conditions for Representing General Distributions by Coxians. Computer Performance Evaluation / TOOLS 2003 : 182-199 Takayuki Osogami , Mor Harchol-Balter: A Closed-Form Solution for Mapping General Distributions to Minimal PH Distributions. Computer Performance Evaluation / TOOLS 2003 : 200-217 Mor Harchol-Balter, Cuihong Li , Takayuki Osogami , Alan Scheller-Wolf , Mark S. Squillante : Analysis of Task Assignment with Cycle Stealing under Central Queue. ICDCS 2003 : 628- Takayuki Osogami , Mor Harchol-Balter, Alan Scheller-Wolf : Analysis of cycle stealing with switching cost. SIGMETRICS 2003 : 184-195 Adam Wierman , Mor Harchol-Balter: Classifying scheduling policies with respect to unfairness in an M/GI/1. SIGMETRICS 2003 : 238-249 Mor Harchol-Balter, Cuihong Li , Takayuki Osogami , Alan Scheller-Wolf , Mark S. Squillante : Cycle stealing under immediate dispatch task assignment. SPAA 2003 : 274-285 Mor Harchol-Balter, Bianca Schroeder , Nikhil Bansal , Mukesh Agrawal : Size-based scheduling to improve web performance. ACM Trans. Comput. Syst. 21 (2): 207-233 (2003) Mor Harchol-Balter: Task assignment with unknown duration. J. ACM 49 (2): 260-288 (2002) Mor Harchol-Balter, Karl Sigman , Adam Wierman : Asymptotic convergence of scheduling policies with respect to slowdown. Perform. Eval. 49 (1/4): 241-256 (2002) Mor Harchol-Balter, Karl Sigman , Adam Wierman : Understanding the slowdown of large jobs in an M/GI/1 system. SIGMETRICS Performance Evaluation Review 30 (3): 9-11 (2002) Mor Harchol-Balter, Nikhil Bansal , Bianca Schroeder , Mukesh Agrawal : SRPT Scheduling for Web Servers. JSSPP 2001 : 11-20 Nikhil Bansal , Mor Harchol-Balter: Analysis of SRPT scheduling: investigating unfairness. SIGMETRICS/Performance 2001 : 279-290 Mor Harchol-Balter: Job placement with unknown duration and no preemption. SIGMETRICS Performance Evaluation Review 28 (4): 3-5 (2001) Nikhil Bansal , Mor Harchol-Balter: Analysis of M/G/1/SRPT under transient overload. SIGMETRICS Performance Evaluation Review 29 (3): 12-14 (2001) Bianca Schroeder , Mor Harchol-Balter: Evaluation of Task Assignment Policies for Supercomputing Servers: The Case for Load Unbalancing and Fairness. HPDC 2000 : 211-220 Mor Harchol-Balter: Task Assignment with Unknown Duration. ICDCS 2000 : 214-224 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) Mor Harchol-Balter, Frank Thomson Leighton , Daniel Lewin : Resource Discovery in Distributed Networks. PODC 1999 : 229-237 Mark Crovella , Robert Frangioso , Mor Harchol-Balter: Connection Scheduling in Web Servers. USENIX Symposium on Internet Technologies and Systems 1999 Mor Harchol-Balter, Mark Crovella , Cristina D. Murta : On Choosing a Task Assignment Policy for a Distributed Server System. J. Parallel Distrib. Comput. 59 (2): 204-228 (1999) Mor Harchol-Balter, Mark Crovella , Cristina D. Murta : On Choosing a Task Assignment Policy for a Distributed Server System. Computer Performance Evaluation (Tools) 1998 : 231-242 Mark Crovella , Mor Harchol-Balter, Cristina D. Murta : Task Assignment in a Distributed System: Improving Performance by Unbalancing Load (Extended Abstract). SIGMETRICS 1998 : 268-269 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). FOCS 1997 : 294-302 Mor Harchol-Balter, Allen B. Downey : Exploiting Process Lifetime Distributions for Dynamic Load Balancing. ACM Trans. Comput. Syst. 15 (3): 253-285 (1997) Mor Harchol-Balter, Allen B. Downey : Exploiting Process Lifetime Distributions for Dynamic Load Balancing. SIGMETRICS 1996 : 13-24 Mor Harchol-Balter, Allen B. Downey : Exploiting Process Lifetime Distributions for Dynamic Load Balancing. SOSP 1995 : 236 Mor Harchol-Balter, David Wolfe : Bounding delays in packet-routing networks. STOC 1995 : 248-257 Micah Adler , Peter Gemmell , Mor Harchol-Balter, Richard M. Karp , Claire Kenyon : Selection in the Presence of Noise: The Design of Playoff Systems. SODA 1994 : 564-572 Mor Harchol-Balter, Paul E. Black : Queueing Analysis of Oblivious Packet-Routing Networks. SODA 1994 : 583-592 1 [ 2 ] 2 [ 19 ] [ 23 ] 3 [ 34 ] [ 40 ] 4 [ 7 ] [ 13 ] 5 [ 16 ] [ 18 ] [ 19 ] [ 23 ] [ 32 ] 6 [ 1 ] 7 [ 8 ] [ 9 ] [ 10 ] [ 11 ] 8 [ 4 ] [ 5 ] [ 6 ] 9 [ 7 ] [ 13 ] 10 [ 11 ] 11 [ 2 ] 12 [ 41 ] [ 42 ] 13 [ 2 ] 14 [ 2 ] 15 [ 7 ] [ 12 ] [ 13 ] 16 [ 12 ] 17 [ 24 ] [ 27 ] 18 [ 34 ] [ 40 ] 19 [ 8 ] [ 9 ] [ 10 ] 20 [ 41 ] [ 42 ] 21 [ 24 ] [ 26 ] [ 27 ] [ 28 ] [ 29 ] [ 30 ] [ 35 ] [ 36 ] [ 37 ] [ 39 ] 22 [ 24 ] [ 26 ] [ 27 ] [ 30 ] [ 35 ] [ 36 ] [ 37 ] 23 [ 15 ] [ 19 ] [ 23 ] [ 33 ] [ 34 ] [ 40 ] [ 41 ] [ 42 ] 24 [ 20 ] [ 21 ] 25 [ 24 ] [ 27 ] 26 [ 20 ] [ 21 ] [ 25 ] [ 30 ] [ 31 ] [ 32 ] [ 36 ] [ 38 ] [ 39 ] [ 41 ] 27 [ 3 ] 28 [ 7 ] [ 13 ] ![]() ©2006 Association for Computing Machinery |