Impossibility results for distributed computing

被引：0
|
作者：
机构：
[1] Attiya, Hagit
[2] Ellen, Faith
来源：
| 1600年 / Morgan and Claypool Publishers卷 / 05期
关键词：
Distributed computer systems - Problem solving - Computation theory;
D O I：
10.2200/S00551ED1V01Y201311DCT012
中图分类号：
学科分类号：
摘要：
To understand the power of distributed systems, it is necessary to understand their inherent limitations: What problems cannot be solved in particular systems, or without sufficient resources (such as time or space). is book presents key techniques for proving such impossibility results and applies them to a variety of different problems in a variety of different system models. Insights gained from these results are highlighted, aspects of a problem that make it difficult are isolated, features of an architecture that make it inadequate for solving certain problems efficiently are identified, and different system models are compared. Copyright © 2014 by Morgan & Claypool All rights reserved.
引用
收藏
相关论文
共 50 条
  • [1] Hundreds of impossibility results for distributed computing
    Faith Fich
    Eric Ruppert
    Distributed Computing, 2003, 16 : 121 - 163
  • [2] Hundreds of impossibility results for distributed computing
    Fich, F
    Ruppert, E
    DISTRIBUTED COMPUTING, 2003, 16 (2-3) : 121 - 163
  • [3] Distributed Computing Theory: Algorithms, Impossibility Results, Models, and Proofs
    Lynch, Nancy
    STOC 07: PROCEEDINGS OF THE 39TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, 2007, : 247 - 247
  • [4] Impossibility Results for Distributed Transactional Memory
    Busch, Costas
    Herlihy, Maurice
    Popovic, Miroslav
    Sharma, Gokarna
    PODC'15: PROCEEDINGS OF THE 2015 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2015, : 207 - 215
  • [5] Lower bounds and impossibility results for transactional memory computing
    Department of Computer Science, Techion, Israel
    Bull. Eur. Assoc. Theor. Comput. Sci., (38-52):
  • [6] LOWER BOUNDS AND IMPOSSIBILITY RESULTS FOR TRANSACTIONAL MEMORY COMPUTING
    Fatourou, Panagiota
    Attiya, Hagit
    BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2014, (112): : 37 - 52
  • [7] Time-communication impossibility results for distributed transactional memory
    Busch, Costas
    Herlihy, Maurice
    Popovic, Miroslav
    Sharma, Gokarna
    DISTRIBUTED COMPUTING, 2018, 31 (06) : 471 - 487
  • [8] Time-communication impossibility results for distributed transactional memory
    Costas Busch
    Maurice Herlihy
    Miroslav Popovic
    Gokarna Sharma
    Distributed Computing, 2018, 31 : 471 - 487
  • [9] Certified Impossibility Results and Analyses in Coq of Some Randomised Distributed Algorithms
    Fontaine, Allyx
    Zemmari, Akka
    THEORETICAL ASPECTS OF COMPUTING - ICTAC 2016, 2016, 9965 : 69 - 81
  • [10] Impossibility Bounds for Secure Computing
    Tyagi, Himanshu
    Watanabe, Shun
    2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 2742 - 2746
12345