World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
54
Citations
14930
World Ranking
4488
National Ranking
2098

Research.com Recognitions

  • 2010 - ACM Fellow For contributions to the science and engineering of large-scale distributed computer systems.
  • 2000 - Fellow of Alfred P. Sloan Foundation

Overview

Mike Dahlin is affiliated with The University of Texas at Austin in the United States. Their academic work is situated within computer science, particularly focusing on areas relevant to distributed computer systems.

Dahlin has received recognition for contributions to the science and engineering of large-scale distributed computer systems. Notably, they were named an ACM Fellow in 2010. Earlier in their career, they were awarded a fellowship from the Alfred P. Sloan Foundation in 2000.

Best Publications

  • Serverless Network File Systems

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

  • Zyzzyva: Speculative Byzantine fault tolerance

    Ramakrishna Kotla;Lorenzo Alvisi;Mike Dahlin;Allen Clement

  • Cooperative caching: using remote client memory to improve file system performance

    Michael D. Dahlin;Randolph Y. Wang;Thomas E. Anderson;David A. Patterson

  • Depot: Cloud Storage with Minimal Trust

    Prince Mahajan;Srinath Setty;Sangmin Lee;Allen Clement

  • Scaling to the end of silicon with EDGE architectures

    D. Burger;S.W. Keckler;K.S. McKinley;M. Dahlin

  • Making Byzantine fault tolerant systems tolerate Byzantine faults

    Allen Clement;Edmund Wong;Lorenzo Alvisi;Mike Dahlin

  • Separating agreement from execution for byzantine fault tolerant services

    Jian Yin;Jean-Philippe Martin;Arun Venkataramani;Lorenzo Alvisi

  • A scalable distributed information management system

    Praveen Yalagandula;Mike Dahlin

  • BAR fault tolerance for cooperative services

    Amitanand S. Aiyer;Lorenzo Alvisi;Allen Clement;Mike Dahlin

  • TCP Nice: a mechanism for background transfers

    Arun Venkataramani;Ravi Kokku;Mike Dahlin

  • Coordinated placement and replacement for large-scale distributed caches

    M.R. Korupolu;M. Dahlin

  • Upright cluster services

    Allen Clement;Manos Kapritsos;Sangmin Lee;Yang Wang

  • BAR gossip

    Harry C. Li;Allen Clement;Edmund L. Wong;Jeff Napper

  • Design considerations for distributed caching on the Internet

    R. Tewari;M. Dahlin;H.M. Vin;J.S. Kay

  • WebOS: operating system services for wide area applications

    A. Vahdat;T. Anderson;M. Dahlin;E. Belani

  • Interpreting stale load information

    M. Dahlin

  • Method and system for background replication of data objects

    Michael D. Dahlin;Arunkumar Venkataramani;Ravindranath Kokku;Praveen Yalagandula

  • TAPER: tiered approach for eliminating redundancy in replica synchronization

    Navendu Jain;Mike Dahlin;Renu Tewari

  • PRACTI replication

    Nalini Belaramani;Mike Dahlin;Lei Gao;Amol Nayate

  • All about Eve: execute-verify replication for multi-core servers

    Manos Kapritsos;Yang Wang;Vivien Quema;Allen Clement

  • A case for networks of workstations (now)

    T. Anderson;R. Arpacl;D. Culler;M. Dahlin

Frequent Co-Authors

Lorenzo Alvisi
Lorenzo Alvisi Cornell University
Thomas Anderson
Thomas Anderson University of Washington
Arun Venkataramani
Arun Venkataramani University of Massachusetts Amherst
Amin Vahdat
Amin Vahdat Google (United States)
Navendu Jain
Navendu Jain Microsoft (United States)
David A. Patterson
David A. Patterson University of California, Berkeley
Yin Zhang
Yin Zhang The University of Texas at Austin
Harrick M. Vin
Harrick M. Vin Tata Consultancy Services Venture
Calvin Lin
Calvin Lin The University of Texas at Austin

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

Report an issue

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:

Related Online Degrees & Career Pathways

Exploring a degree in Computer Science opens doors to a range of career opportunities and advanced study options. Many students consider aligning their major with the best college degrees for the future to ensure strong job prospects and industry relevance.

For those looking to further their education, online master’s programs have become increasingly popular. If you want to advance your qualifications while minimizing workload, choosing one of the easiest master degree to get may be a practical approach.

Thinking even further, online doctoral programs provide flexible and affordable pathways for career advancement or research. Professionals mindful of costs often explore the cheapest doctorate degree online for substantial savings.

Additionally, education leaders may consider fast-track credentials like edd online programs to quickly enhance their expertise and further their career in academia or administration.

By researching these pathways, you can choose the right degree to match your goals, lifestyle, and budget—setting the stage for success in the dynamic field of Computer Science.

Best Scientists Citing Mike Dahlin

Trending Scientists