Professional bio
Adam Wierman is an Assistant Professor of Computer Science at the California Institute of Technology, where he is a member of the Lee Center for Advanced Networking, the Center for the Mathematics of Information, and the Social and Information Sciences Laboratory. He received his PhD (2007) and MS (2004) in Computer Science from Carnegie Mellon University under the supervision of Mor Harchol-Balter where he was a co-recipient of the Distinguished Dissertation Award. He also briefly served as a visiting researcher at the EURANDOM institute under the supervision of Onno Boxma and Ivo Adan. He is a recipient of an NSF Graduate Research Fellowship, a Siebel Scholars Fellowship, an ACM Sigmetrics best student paper award, and multiple teaching awards, including the Alan J. Perlis Student Teaching Award and the Carnegie Mellon University Graduate Student Teaching Award.
Wierman's research interests are in improving computer system design through the use of analytic modeling and performance analysis. His main focus is on the scheduling and resource allocation decisions in distributed systems; however, he has also been involved with the design of manufacturing systems and telecommunication protocols. In order to provide performance analysis of computer systems, his work draws on tools that are traditionally used in the operations research community, in particular stochastic modeling, queueing theory, and game theory.