Adam Wierman

Adam Wierman is Professor of Computer Science in the Department of Computing and Mathematical Sciences at the California Institute of Technology. He is known for his work on scheduling (computing), heavy tails, green computing, queueing theory, and algorithmic game theory.

Adam Wierman
BornMay 1979 (1979-05) (age 41)
Minneapolis, Minnesota
NationalityAmerican
Alma materCarnegie Mellon University
Known forScheduling (computing), Heavy tails, Green computing, Queueing Theory, Algorithmic Game Theory
AwardsCarnegie Mellon School of Computer Science Distinguished Dissertation Award (2007), ACM SIGMETRICS Rising Star award (2011), IEEE William R. Bennet Prize (2014)
Scientific career
Fieldscomputer science, operations research
InstitutionsCalifornia Institute of Technology
ThesisScheduling for Today's Computer Systems: Bridging Theory and Practice (2007)
Doctoral advisorMor Harchol-Balter
Websitewww.cs.caltech.edu/~adamw/

Academic biography

Wierman studied at Carnegie Mellon University, where he completed his BS in Computer Science and Mathematics in 2001 and his MS and PhD degrees in Computer Science in 2004 and 2007. His PhD work was supervised by Mor Harchol-Balter.[1] His dissertation received the Carnegie Mellon School of Computer Science Distinguished Dissertation Award.[2] He has been on the faculty of the California Institute of Technology since 2007.[3]

Research

Wierman's research has centred on resource allocation and scheduling decisions in computer systems and services.[4] More specifically, his work has focused both on developing analytic techniques in stochastic modelling, queueing theory, scheduling theory, and game theory, and on applying these techniques to application domains such as energy-efficient computing, data centres, social networks, and electricity markets.

Awards and honors

Wierman was the recipient of an NSF CAREER award in 2009 and the ACM SIGMETRICS Rising Star award in 2011.[4] His work has received "Best Paper" awards at the ACM SIGMETRICS, IEEE INFOCOM, and IFIP Performance conferences, among others.[1] An extension of his work[5] was used in HP's Net-zero Data Center Architecture, which was named a 2013 Computerworld Honours Laureate. His work[6] received the 2014 IEEE William R. Bennet Prize.

gollark: _prepares eggs for sending off_
gollark: I have 5 left which I'm saving for some nebulous "later".
gollark: _perpetually needs more reds_
gollark: Mostly because I'm trying to mix getting shadow walkers, random hatchlings and CB rares, which is kind of hard.
gollark: DOES THE SAME

References
  1. Adam Wierman, curriculum vitae. Retrieved August 11, 2014
  2. CMU SCS Student Awards. Retrieved August 11, 2014]
  3. Adam Wierman at the Caltech Directory
  4. "Adam Wierman Wins 2011 SIGMETRICS Rising Star Researcher Award".
  5. Liu, Zhenhua; Chen, Yuan; Bash, Cullen; Wierman, Adam; Gmach, Daniel; Wang, Zhikui; Marwah, Manish; Hyser, Chris (2012), "Renewable and cooling aware workload management for sustainable data centers", ACM Sigmetrics Performance Evaluation Review, 40: 175, doi:10.1145/2318857.2254779
  6. Lin, Minghong; Wierman, Adam; Andrew; Thereska, Eno (2013), "Dynamic Right-Sizing for Power-Proportional Data Centers", IEEE/ACM Transactions on Networking, 21 (5): 1378–1391, doi:10.1109/TNET.2012.2226216, hdl:1959.3/235775
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.