2010 - ACM Fellow For contributions to the science and engineering of large-scale distributed computer systems.
2000 - Fellow of Alfred P. Sloan Foundation
His primary areas of investigation include Distributed computing, Byzantine fault tolerance, Fault tolerance, Server and Quantum Byzantine agreement. His study on Replication is often connected to Spare part as part of broader study in Distributed computing. The various areas that Mike Dahlin examines in his Replication study include Speculative execution and Commit.
His studies examine the connections between Server and genetics, as well as such issues in Consistency, with regards to Cloud storage and Overhead. The concepts of his Quantum Byzantine agreement study are interwoven with issues in State machine replication and Protocol. Mike Dahlin focuses mostly in the field of Service, narrowing it down to matters related to Cache and, in some cases, File system.
Mike Dahlin focuses on Distributed computing, Server, Replication, Computer network and Scalability. His research on Distributed computing focuses in particular on Quantum Byzantine agreement. His Replication research focuses on Key and how it relates to Event and Set.
His Scalability study combines topics from a wide range of disciplines, such as Correctness and Robustness. His Cache research is multidisciplinary, incorporating perspectives in File system and Self-certifying File System. The Operating system study combines topics in areas such as Dependability and Code.
Mike Dahlin mainly investigates Operating system, Correctness, Distributed computing, Computer security and Virtualization. His research on Correctness also deals with topics like
His research integrates issues of Differential privacy, Cloud computing, Commit and Function in his study of Computer security. As a member of one scientific family, Mike Dahlin mostly works in the field of Virtualization, focusing on Code and, on occasion, Variety, Resource allocation and Concurrency. His work in the fields of Replication, such as State machine replication, overlaps with other areas such as Replica and Erasure code.
Mike Dahlin spends much of his time researching Distributed computing, Server, Cloud computing, Replication and Overhead. He has researched Distributed computing in several fields, including Scalability, Robustness, Operating system, Firmware and Codebase. His biological study spans a wide range of topics, including State, Concurrency, Multi-core processor, Interleaving and State machine replication.
The concepts of his Cloud computing study are interwoven with issues in Resource allocation, Middleware, The Internet and Programming paradigm. His Replication research is multidisciplinary, relying on both Bandwidth, Distributed data store, Key and Code. His Overhead research integrates issues from Causal consistency, Liveness and Byzantine fault tolerance.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Serverless Network File Systems
T. E. Anderson;M. D. Dahlin;J. M. Neefe;D. A. Patterson.
(1995)
Cooperative caching: using remote client memory to improve file system performance
Michael D. Dahlin;Randolph Y. Wang;Thomas E. Anderson;David A. Patterson.
operating systems design and implementation (1994)
Scaling to the end of silicon with EDGE architectures
D. Burger;S.W. Keckler;K.S. McKinley;M. Dahlin.
IEEE Computer (2004)
Making Byzantine fault tolerant systems tolerate Byzantine faults
Allen Clement;Edmund Wong;Lorenzo Alvisi;Mike Dahlin.
networked systems design and implementation (2009)
Separating agreement from execution for byzantine fault tolerant services
Jian Yin;Jean-Philippe Martin;Arun Venkataramani;Lorenzo Alvisi.
symposium on operating systems principles (2003)
A scalable distributed information management system
Praveen Yalagandula;Mike Dahlin.
acm special interest group on data communication (2004)
BAR fault tolerance for cooperative services
Amitanand S. Aiyer;Lorenzo Alvisi;Allen Clement;Mike Dahlin.
symposium on operating systems principles (2005)
Depot: Cloud Storage with Minimal Trust
Prince Mahajan;Srinath Setty;Sangmin Lee;Allen Clement.
ACM Transactions on Computer Systems (2011)
TCP Nice: a mechanism for background transfers
Arun Venkataramani;Ravi Kokku;Mike Dahlin.
operating systems design and implementation (2002)
BAR gossip
Harry C. Li;Allen Clement;Edmund L. Wong;Jeff Napper.
operating systems design and implementation (2006)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Cornell University
University of Washington
University of Massachusetts Amherst
Google (United States)
Microsoft (United States)
IBM (United States)
University of California, Berkeley
The University of Texas at Austin
The University of Texas at Austin
Tata Consultancy Services Venture
University of Surrey
Linköping University
University of Łódź
Tsinghua University
University of Leeds
Max Planck Society
Janssen (Belgium)
University of Freiburg
Kyoto University
University of Paris-Saclay
University of California, San Francisco
Swedish University of Agricultural Sciences
Washington University in St. Louis
Mayo Clinic
University of North Carolina at Chapel Hill
Stanford University