The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Mor Harchol-Balter: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mor Harchol-Balter, Mark Crovella, Cristina D. Murta
    On Choosing a Task Assignment Policy for a Distributed Server System. [Citation Graph (0, 0)][DBLP]
    Computer Performance Evaluation (Tools), 1998, pp:231-242 [Conf]
  2. Takayuki Osogami, Mor Harchol-Balter
    Necessary and Sufficient Conditions for Representing General Distributions by Coxians. [Citation Graph (0, 0)][DBLP]
    Computer Performance Evaluation / TOOLS, 2003, pp:182-199 [Conf]
  3. Takayuki Osogami, Mor Harchol-Balter
    A Closed-Form Solution for Mapping General Distributions to Minimal PH Distributions. [Citation Graph (0, 0)][DBLP]
    Computer Performance Evaluation / TOOLS, 2003, pp:200-217 [Conf]
  4. 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). [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:294-302 [Conf]
  5. Bianca Schroeder, Mor Harchol-Balter
    Evaluation of Task Assignment Policies for Supercomputing Servers: The Case for Load Unbalancing and Fairness. [Citation Graph (0, 0)][DBLP]
    HPDC, 2000, pp:211-220 [Conf]
  6. Mor Harchol-Balter
    Task Assignment with Unknown Duration. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2000, pp:214-224 [Conf]
  7. Mor Harchol-Balter, Cuihong Li, Takayuki Osogami, Alan Scheller-Wolf, Mark S. Squillante
    Analysis of Task Assignment with Cycle Stealing under Central Queue. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2003, pp:628-0 [Conf]
  8. David T. McWherter, Bianca Schroeder, Anastassia Ailamaki, Mor Harchol-Balter
    Priority Mechanisms for OLTP and Transactional Web Applications. [Citation Graph (0, 0)][DBLP]
    ICDE, 2004, pp:535-546 [Conf]
  9. David T. McWherter, Bianca Schroeder, Anastassia Ailamaki, Mor Harchol-Balter
    Improving Preemptive Prioritization via Statistical Characterization of OLTP Locking. [Citation Graph (0, 0)][DBLP]
    ICDE, 2005, pp:446-457 [Conf]
  10. Bianca Schroeder, Mor Harchol-Balter, Arun Iyengar, Erich M. Nahum
    Achieving Class-Based QoS for Transactional Workloads. [Citation Graph (0, 0)][DBLP]
    ICDE, 2006, pp:153- [Conf]
  11. Bianca Schroeder, Mor Harchol-Balter, Arun Iyengar, Erich M. Nahum, Adam Wierman
    How to Determine a Good Multi-Programming Level for External Scheduling. [Citation Graph (0, 0)][DBLP]
    ICDE, 2006, pp:60- [Conf]
  12. Mor Harchol-Balter, Nikhil Bansal, Bianca Schroeder, Mukesh Agrawal
    SRPT Scheduling for Web Servers. [Citation Graph (0, 0)][DBLP]
    JSSPP, 2001, pp:11-20 [Conf]
  13. Mor Harchol-Balter, Frank Thomson Leighton, Daniel Lewin
    Resource Discovery in Distributed Networks. [Citation Graph (0, 0)][DBLP]
    PODC, 1999, pp:229-237 [Conf]
  14. Nikhil Bansal, Mor Harchol-Balter
    Analysis of SRPT scheduling: investigating unfairness. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS/Performance, 2001, pp:279-290 [Conf]
  15. Mark Crovella, Mor Harchol-Balter, Cristina D. Murta
    Task Assignment in a Distributed System: Improving Performance by Unbalancing Load (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SIGMETRICS, 1998, pp:268-269 [Conf]
  16. Varun Gupta, Mor Harchol-Balter, Alan Scheller-Wolf, Uri Yechiali
    Fundamental characteristics of queues with fluctuating load. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS/Performance, 2006, pp:203-215 [Conf]
  17. Mor Harchol-Balter, Allen B. Downey
    Exploiting Process Lifetime Distributions for Dynamic Load Balancing. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS, 1996, pp:13-24 [Conf]
  18. Takayuki Osogami, Mor Harchol-Balter, Alan Scheller-Wolf
    Analysis of cycle stealing with switching cost. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS, 2003, pp:184-195 [Conf]
  19. Adam Wierman, Mor Harchol-Balter
    Classifying scheduling policies with respect to unfairness in an M/GI/1. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS, 2003, pp:238-249 [Conf]
  20. Adam Wierman, Mor Harchol-Balter
    Classifying scheduling policies with respect to higher moments of conditional response time. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS, 2005, pp:229-240 [Conf]
  21. Adam Wierman, Mor Harchol-Balter, Takayuki Osogami
    Nearly insensitive bounds on SMART scheduling. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS, 2005, pp:205-216 [Conf]
  22. Chang-Woo Yang, Adam Wierman, Sanjay Shakkottai, Mor Harchol-Balter
    Tail asymptotics for policies favoring short jobs in a many-flows regime. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS/Performance, 2006, pp:97-108 [Conf]
  23. Micah Adler, Peter Gemmell, Mor Harchol-Balter, Richard M. Karp, Claire Kenyon
    Selection in the Presence of Noise: The Design of Playoff Systems. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:564-572 [Conf]
  24. Mor Harchol-Balter, Paul E. Black
    Queueing Analysis of Oblivious Packet-Routing Networks. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:583-592 [Conf]
  25. Mor Harchol-Balter, Allen B. Downey
    Exploiting Process Lifetime Distributions for Dynamic Load Balancing. [Citation Graph (0, 0)][DBLP]
    SOSP, 1995, pp:236- [Conf]
  26. Mor Harchol-Balter, Cuihong Li, Takayuki Osogami, Alan Scheller-Wolf, Mark S. Squillante
    Cycle stealing under immediate dispatch task assignment. [Citation Graph (0, 0)][DBLP]
    SPAA, 2003, pp:274-285 [Conf]
  27. Mor Harchol-Balter, David Wolfe
    Bounding delays in packet-routing networks. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:248-257 [Conf]
  28. Mark Crovella, Robert Frangioso, Mor Harchol-Balter
    Connection Scheduling in Web Servers. [Citation Graph (0, 0)][DBLP]
    USENIX Symposium on Internet Technologies and Systems, 1999, pp:- [Conf]
  29. Bianca Schroeder, Mor Harchol-Balter
    Evaluation of Task Assignment Policies for Supercomputing Servers: The Case for Load Unbalancing and Fairness. [Citation Graph (0, 0)][DBLP]
    Cluster Computing, 2004, v:7, n:2, pp:151-161 [Journal]
  30. Mor Harchol-Balter
    Task assignment with unknown duration. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2002, v:49, n:2, pp:260-288 [Journal]
  31. Mor Harchol-Balter, Mark Crovella, Cristina D. Murta
    On Choosing a Task Assignment Policy for a Distributed Server System. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1999, v:59, n:2, pp:204-228 [Journal]
  32. 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. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:1, pp:73-76 [Journal]
  33. Mor Harchol-Balter, Karl Sigman, Adam Wierman
    Asymptotic convergence of scheduling policies with respect to slowdown. [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 2002, v:49, n:1/4, pp:241-256 [Journal]
  34. Takayuki Osogami, Mor Harchol-Balter, Alan Scheller-Wolf
    Analysis of cycle stealing with switching times and thresholds. [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 2005, v:61, n:4, pp:347-369 [Journal]
  35. Adam Wierman, Takayuki Osogami, Mor Harchol-Balter, Alan Scheller-Wolf
    How many servers are best in a dual-priority M/PH/k system? [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 2006, v:63, n:12, pp:1253-1272 [Journal]
  36. Takayuki Osogami, Mor Harchol-Balter
    Closed form solutions for mapping general distributions to quasi-minimal PH distributions. [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 2006, v:63, n:6, pp:524-552 [Journal]
  37. Robert C. Hampshire, Mor Harchol-Balter, William A. Massey
    Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates. [Citation Graph (0, 0)][DBLP]
    Queueing Syst., 2006, v:53, n:1-2, pp:19-30 [Journal]
  38. Mor Harchol-Balter, Takayuki Osogami, Alan Scheller-Wolf, Adam Wierman
    Multi-Server Queueing Systems with Multiple Priority Classes. [Citation Graph (0, 0)][DBLP]
    Queueing Syst., 2005, v:51, n:3-4, pp:331-360 [Journal]
  39. 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). [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1594-1623 [Journal]
  40. Nikhil Bansal, Mor Harchol-Balter
    Analysis of M/G/1/SRPT under transient overload. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS Performance Evaluation Review, 2001, v:29, n:3, pp:12-14 [Journal]
  41. Mor Harchol-Balter
    Job placement with unknown duration and no preemption. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS Performance Evaluation Review, 2001, v:28, n:4, pp:3-5 [Journal]
  42. Mor Harchol-Balter, Takayuki Osogami, Alan Scheller-Wolf
    Robustness of threshold policies in beneficiary-donor model. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS Performance Evaluation Review, 2005, v:33, n:2, pp:36-38 [Journal]
  43. Mor Harchol-Balter, Karl Sigman, Adam Wierman
    Understanding the slowdown of large jobs in an M/GI/1 system. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS Performance Evaluation Review, 2002, v:30, n:3, pp:9-11 [Journal]
  44. Takayuki Osogami, Adam Wierman, Mor Harchol-Balter, Alan Scheller-Wolf
    A recursive analysis technique for multi-dimensionally infinite Markov chains. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS Performance Evaluation Review, 2004, v:32, n:2, pp:3-5 [Journal]
  45. Adam Wierman, Mor Harchol-Balter
    Formalizing SMART scheduling. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS Performance Evaluation Review, 2004, v:32, n:2, pp:12-13 [Journal]
  46. Mor Harchol-Balter, Allen B. Downey
    Exploiting Process Lifetime Distributions for Dynamic Load Balancing. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Syst., 1997, v:15, n:3, pp:253-285 [Journal]
  47. Mor Harchol-Balter, Bianca Schroeder, Nikhil Bansal, Mukesh Agrawal
    Size-based scheduling to improve web performance. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Syst., 2003, v:21, n:2, pp:207-233 [Journal]
  48. Bianca Schroeder, Mor Harchol-Balter
    Web servers under overload: How scheduling can help. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Internet Techn., 2006, v:6, n:1, pp:20-52 [Journal]
  49. Bianca Schroeder, Adam Wierman, Mor Harchol-Balter
    Open Versus Closed: A Cautionary Tale. [Citation Graph (0, 0)][DBLP]
    NSDI, 2006, pp:- [Conf]
  50. Varun Gupta, Mor Harchol-Balter, Karl Sigman, Ward Whitt
    Analysis of join-the-shortest-queue routing for web server farms. [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 2007, v:64, n:9-12, pp:1062-1081 [Journal]

  51. Self-adaptive admission control policies for resource-sharing systems. [Citation Graph (, )][DBLP]


  52. Surprising results on task assignment in server farms with high-variability workloads. [Citation Graph (, )][DBLP]


  53. Optimal power allocation in server farms. [Citation Graph (, )][DBLP]


  54. Scheduling for Server Farms: Approaches and Open Problems. [Citation Graph (, )][DBLP]


Search in 0.041secs, Finished in 0.044secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002