The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Adam Wierman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Adam Wierman, Takayuki Osogami, Jörgen Olsén
    A Unified Framework for Modeling TCP-Vegas, TCP-SACK, and TCP-Reno. [Citation Graph (0, 0)][DBLP]
    MASCOTS, 2003, pp:269-278 [Conf]
  3. 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]
  4. 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]
  5. Adam Wierman, Mor Harchol-Balter, Takayuki Osogami
    Nearly insensitive bounds on SMART scheduling. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS, 2005, pp:205-216 [Conf]
  6. 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]
  7. Adam Wierman, Julia Salzman, Michael Jablonski, Anant P. Godbole
    An improved upper bound for the pebbling threshold of the n-path. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:275, n:1-3, pp:367-373 [Journal]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. 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]
  15. Adam Wierman, Takayuki Osogami, Jörgen Olsén
    Modeling TCP-vegas under on/off traffic. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS Performance Evaluation Review, 2003, v:31, n:2, pp:6-8 [Journal]
  16. Adam Wierman
    On the effect of inexact size information in size based policies. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS Performance Evaluation Review, 2006, v:34, n:3, pp:21-23 [Journal]
  17. Bianca Schroeder, Adam Wierman, Mor Harchol-Balter
    Open Versus Closed: A Cautionary Tale. [Citation Graph (0, 0)][DBLP]
    NSDI, 2006, pp:- [Conf]
  18. Adam Wierman, Erik M. M. Winands, Onno J. Boxma
    Scheduling in polling systems. [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 2007, v:64, n:9-12, pp:1009-1028 [Journal]

  19. On the Impact of Heterogeneity and Back-End Scheduling in Load Balancing Designs. [Citation Graph (, )][DBLP]


  20. Power-Aware Speed Scaling in Processor Sharing Systems. [Citation Graph (, )][DBLP]


  21. Scheduling despite inexact job-size information. [Citation Graph (, )][DBLP]


  22. Optimality, fairness, and robustness in speed scaling designs. [Citation Graph (, )][DBLP]


  23. Distributed welfare games with applications to sensor coverage. [Citation Graph (, )][DBLP]


  24. Approximate dynamic programming using fluid and diffusion approximations with applications to power management. [Citation Graph (, )][DBLP]


  25. Overcoming limitations of game-theoretic distributed control. [Citation Graph (, )][DBLP]


Search in 0.055secs, Finished in 0.057secs
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