skip to main content
10.1145/1400751.1400862acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
demonstration

The future of distributed computing: renaissance or reformation?

Published: 18 August 2008 Publication History

Abstract

In the near future, nearly all computers, ranging from supercomputers to smoke detectors, will be shared-memory multiprocessors. This change will affect the distributed computing community in two ways. First, as a Renaissance: perhaps for the first time ever, research in concurrent and distributed computing matters to people outside the community. Second, as a Reformation: the experience of confronting real multiprocessors, like early theorists' experience confronting FORTRAN, will force us to address problems obscured by many of today's elegant but naive computational models. This talk explores these possibilities.

Cited By

View all
  • (2009)Parallelizing Deadlock Resolution in Symbolic Synthesis of Distributed ProgramsElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.14.714(92-106)Online publication date: 15-Dec-2009

Index Terms

  1. The future of distributed computing: renaissance or reformation?

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    PODC '08: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
    August 2008
    474 pages
    ISBN:9781595939890
    DOI:10.1145/1400751
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 18 August 2008

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. distributed computing
    2. theory

    Qualifiers

    • Demonstration

    Conference

    PODC '08

    Acceptance Rates

    Overall Acceptance Rate 740 of 2,477 submissions, 30%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)2
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 17 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2009)Parallelizing Deadlock Resolution in Symbolic Synthesis of Distributed ProgramsElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.14.714(92-106)Online publication date: 15-Dec-2009

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media