H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 52 Citations 14,289 101 World Ranking 2655 National Ranking 1396

Research.com Recognitions

Awards & Achievements

2010 - ACM Fellow For contributions to the science and engineering of large-scale distributed computer systems.

2000 - Fellow of Alfred P. Sloan Foundation

Overview

What is he best known for?

The fields of study he is best known for:

  • Operating system
  • Computer network
  • The Internet

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.

His most cited work include:

  • Serverless Network File Systems (612 citations)
  • Zyzzyva: speculative byzantine fault tolerance (492 citations)
  • Cooperative caching: using remote client memory to improve file system performance (490 citations)

What are the main themes of his work throughout his whole career to date?

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.

He most often published in these fields:

  • Distributed computing (52.27%)
  • Server (21.97%)
  • Replication (20.45%)

What were the highlights of his more recent work (between 2010-2017)?

  • Operating system (13.64%)
  • Correctness (6.06%)
  • Distributed computing (52.27%)

In recent papers he was focusing on the following fields of study:

Mike Dahlin mainly investigates Operating system, Correctness, Distributed computing, Computer security and Virtualization. His research on Correctness also deals with topics like

  • Scalability and related Robustness and Service,
  • Codebase together with Firmware. His work deals with themes such as Node and Server, which intersect with Distributed computing.

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.

Between 2010 and 2017, his most popular works were:

  • Depot: Cloud Storage with Minimal Trust (163 citations)
  • All about Eve: execute-verify replication for multi-core servers (114 citations)
  • πBox: a platform for privacy-preserving apps (56 citations)

In his most recent research, the most cited papers focused on:

  • Operating system
  • Computer network
  • The Internet

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.

Top Publications

Serverless Network File Systems

T. E. Anderson;M. D. Dahlin;J. M. Neefe;D. A. Patterson.
(1995)

1199 Citations

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)

808 Citations

Zyzzyva: speculative byzantine fault tolerance

Ramakrishna Kotla;Lorenzo Alvisi;Mike Dahlin;Allen Clement.
symposium on operating systems principles (2007)

733 Citations

Scaling to the end of silicon with EDGE architectures

D. Burger;S.W. Keckler;K.S. McKinley;M. Dahlin.
IEEE Computer (2004)

500 Citations

Making Byzantine fault tolerant systems tolerate Byzantine faults

Allen Clement;Edmund Wong;Lorenzo Alvisi;Mike Dahlin.
networked systems design and implementation (2009)

451 Citations

Separating agreement from execution for byzantine fault tolerant services

Jian Yin;Jean-Philippe Martin;Arun Venkataramani;Lorenzo Alvisi.
symposium on operating systems principles (2003)

446 Citations

A scalable distributed information management system

Praveen Yalagandula;Mike Dahlin.
acm special interest group on data communication (2004)

416 Citations

Depot: Cloud Storage with Minimal Trust

Prince Mahajan;Srinath Setty;Sangmin Lee;Allen Clement.
ACM Transactions on Computer Systems (2011)

376 Citations

BAR fault tolerance for cooperative services

Amitanand S. Aiyer;Lorenzo Alvisi;Allen Clement;Mike Dahlin.
symposium on operating systems principles (2005)

375 Citations

TCP Nice: a mechanism for background transfers

Arun Venkataramani;Ravi Kokku;Mike Dahlin.
operating systems design and implementation (2002)

342 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

Top Scientists Citing Mike Dahlin

Rachid Guerraoui

Rachid Guerraoui

École Polytechnique Fédérale de Lausanne

Publications: 45

Gregory R. Ganger

Gregory R. Ganger

Carnegie Mellon University

Publications: 45

Miguel Correia

Miguel Correia

Instituto Superior Técnico

Publications: 43

Michael K. Reiter

Michael K. Reiter

Duke University

Publications: 41

Fernando Pedone

Fernando Pedone

Universita della Svizzera Italiana

Publications: 40

Gregory L. Slaughter

Gregory L. Slaughter

Oracle (United States)

Publications: 40

Thomas E. Saulpaugh

Thomas E. Saulpaugh

Oracle (United States)

Publications: 37

Doug Burger

Doug Burger

Microsoft (United States)

Publications: 36

Thomas Anderson

Thomas Anderson

University of Washington

Publications: 34

Dahlia Malkhi

Dahlia Malkhi

Diem Association

Publications: 31

Bernard A. Traversat

Bernard A. Traversat

Oracle (United States)

Publications: 30

Amin Vahdat

Amin Vahdat

Google (United States)

Publications: 29

Stephen W. Keckler

Stephen W. Keckler

Nvidia (United States)

Publications: 26

Remzi H. Arpaci-Dusseau

Remzi H. Arpaci-Dusseau

University of Wisconsin–Madison

Publications: 25

Andrea C. Arpaci-Dusseau

Andrea C. Arpaci-Dusseau

University of Wisconsin–Madison

Publications: 25

Something went wrong. Please try again later.