![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Bianca Schroeder 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 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) 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) Susanne Albers , Bianca Schröder: An Experimental Study of Online Scheduling Algorithms. ACM Journal of Experimental Algorithms 7 : 3 (2002) Mor Harchol-Balter , Nikhil Bansal , Bianca Schroeder, Mukesh Agrawal : SRPT Scheduling for Web Servers. JSSPP 2001 : 11-20 Susanne Albers , Bianca Schröder: An Experimental Study of Online Scheduling Algorithms. Algorithm Engineering 2000 : 11-22 Bianca Schroeder, Mor Harchol-Balter : Evaluation of Task Assignment Policies for Supercomputing Servers: The Case for Load Unbalancing and Fairness. HPDC 2000 : 211-220 1 [ 3 ] [ 5 ] 2 [ 7 ] [ 8 ] 3 [ 2 ] [ 4 ] 4 [ 3 ] [ 5 ] 5 [ 1 ] [ 3 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] 6 [ 9 ] [ 10 ] 7 [ 7 ] [ 8 ] 8 [ 9 ] [ 10 ] 9 [ 9 ] ![]() ©2006 Association for Computing Machinery |