More info

• Group members
• Publications
• Coauthors
• Talks
• Thesis
• CV
• Related Conferences

Research news

• April 2008
  I was named a Microsoft New Faculty Fellowship Finalist. Congratulations to the other finalists and the 5 new Fellows.
• April 2008
  John Musacchio from UC Santa Cruz will be visiting the week of the 9th.
• March 2008
  My thesis was given an Honorable Mention among the finalists for the dissertation award for operations research in telecommunications given by INFORMS.
• February 2008
  Heavy-tails expert Bert Zwart will be visiting the week of the 25th.
• February 2008
  My paper with Misja was accepted to Sigmetrics!
• January 2008
  My thesis is a finalist for the dissertation award for operations research in telecommunications given by INFORMS.
• December 2007
  My thesis is a co-recipient of the 2007 CMU SCS Distinguished Dissertation Award.

Seminars

• CS
• Lunch Bunches
• EE
• ACM
• CMI
• SISL
• HSS
• IQI

Publication list

(show abstracts)

• On the Gittins Index in an M/GI/1 queue
  Samuli Aalto, Urtzi Ayesta and Adam Wierman
  Under preparation.
• Moment conditions for the foreground-background queue
  Misja Nuyens and Adam Wierman
  Under preparation.
• Asymptotic cumulants of scheduling policies
  Adam Wierman
  Under preparation.
• Is it possible to balance fairness, politeness, and efficiency?
  Adam Wierman and David Raz
  Under preparation.

• Many flows asymptotics for SMART scheduling policies
  Chang Woo Yang, Adam Wierman, Sanjay Shakkottai and Mor Harchol-Balter
  Under submission.
• Aggregate modeling of multi-processing workstations
  A.A.A. Kock, L.F.P. Etman, J.E. Rooda, L.J.B.F. Adan, M. van Vuuren and Adam Wierman
  Under submission.
• The effect of local scheduling in load balancing designs
  Ho-Lin Chen, Jason Marden and Adam Wierman
  Under submission.
• Distributed welfare games with applications to sensor coverage
  Jason Marden and Adam Wierman
  Under submission.

• Preventing large sojourn times using SMART scheduling
  Misja Nuyens, Adam Wierman and Bert Zwart
  Operations Research, 2008. 56(1):88-101.
• The foreground-background queue: a survey
  Misja Nuyens and Adam Wierman
  Performance Evaluation, 2008. 65(3-4):286-307.
• Scheduling despite inexact job-size information
  Adam Wierman and Misja Nuyens
  Proceedings of ACM Sigmetrics, 2008.

• Fairness and classifications
  Adam Wierman
  Invited paper in Performance Evaluation Review, 2007. 34(4):4 - 12.
• Scheduling for today's computer systems: Bridging theory and practice
  Adam Wierman
  Co-recipient of the CMU SCS Distinguished Dissertation Award
  Finalist receiving Honorable Mention for the INFORMS OR in Telecommunications Dissertation Award Ph.D. Thesis, 2007.
• Scheduling in polling systems
  Adam Wierman, Erik Winands and Onno Boxma
  Performance Evaluation, 2007. 64:1009-1028. Also appeared in the Proceedings of IFIP Performance 2007.
• Revisiting the performance of large jobs in the M/GI/1 queue
  Adam Wierman
  Proceedings of the Allerton conference, 2007.

• How many servers are best in a dual-priority M/PH/k system?
  Adam Wierman, Takayuki Osogami, Mor Harchol-Balter and Alan Scheller-Wolf
  Performance Evaluation, 2006. 63(12):1253-1272.
• Open versus closed: A cautionary tale
  Bianca Schroeder, Adam Wierman and Mor Harchol-Balter
  Proceedings of NSDI, 2006.
• How to determine a good multi-programming level for external scheduling
  Bianca Schroeder, Mor Harchol-Balter, Arun Iyengar, Erich Nahum and Adam Wierman
  Proceedings of IEEE ICDE, 2006.
• Tail asymptotics for policies favoring short jobs in a many-flows regime
  Chang Woo Yang, Adam Wierman, Sanjay Shakkottai and Mor Harchol-Balter
  Proceedings of ACM Sigmetrics, 2006.
• On the effect of inexact size information in size based policies
  Adam Wierman
  Performance Evaluation Review, 2006. 34(3):21-23.

• Nearly insensitive bounds on SMART scheduling
  Adam Wierman, Mor Harchol-Balter and Takayuki Osogami
  Proceedings of ACM Sigmetrics, 2005.
• Classifying scheduling policies with respect to higher moments of response time
  Adam Wierman and Mor Harchol-Balter
  Proceedings of ACM Sigmetrics, 2005.
• Multi-server queueing systems with multiple priority classes
  Mor Harchol-Balter, Takayuki Osogami, Alan Scheller-Wolf and Adam Wierman
  Queueing Systems, 2005. 51:331-360.
• A theoretical scheduling toolbox
  Adam Wierman
  Thesis Proposal, 2005.

• A note comparing response times in the M/GI/1/FB and M/GI/1/PS queues
  Adam Wierman, Nikhil Bansal and Mor Harchol-Balter
  Operations Research Letters, 2004. 32:73-76.
• An improved upper bound for the pebbling threshold of the path
  Adam Wierman, Julia Salzman, Michael Jablonski and Anant Godbole
  Discrete Mathematics, 2004. 275:367-373.
• Formalizing SMART scheduling
  Adam Wierman and Mor Harchol-Balter
  Performance Evaluation Review, 2004. 32(2):12-13.
• A recursive analysis technique for multi-dimensionally infinite Markov chains
  Takayuki Osogami, Adam Wierman, Mor Harchol-Balter and Alan Scheller-Wolf
  Performance Evaluation Review, 2004. 32(2):3-5.

• Modeling TCP-Vegas under on/off traffic
  Adam Wierman, Takayuki Osogami and Jorgen Olsen
  Performance Evaluation Review, 2003. 31(2):6-8.
• A unified framework for modeling TCP-Vegas, TCP-SACK, and TCP-Reno
  Adam Wierman, Takayuki Osogami and Jorgen Olsen
  Proceedings of MASCOTS, 2003.
• Classifying scheduling policies with respect to unfairness in an M/GI/1
  Adam Wierman and Mor Harchol-Balter
  Best Student Paper Award recipient
  Proceedings of ACM Sigmetrics, 2003.

• Competitive analysis of M/GI/1 queueing policies
  Nikhil Bansal and Adam Wierman
  Carnegie Mellon School of Computer Science Technical Report CMU-CS-02-201, 2002.
• Understanding the slowdown of large jobs in an M/GI/1 system
  Mor Harchol-Balter, Karl Sigman and Adam Wierman
  Performance Evaluation Review, 2002. 30(3):9-11.
• Asymptotic convergence of scheduling policies with respect to slowdown
  Mor Harchol-Balter, Karl Sigman and Adam Wierman
  Performance Evaluation, 2002. 49(1-4):241-256.