| Description |
1 online resource (xxi, 678 pages) : illustrations |
| Series |
Lecture Notes in Computer Science, 0302-9743 ; 9363 |
|
Advanced research in computing and software science |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 9363. 0302-9743
|
|
Lecture notes in computer science. Advanced research in computing and software science.
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
Intro; Preface; Organization; Awards and Keynote Lecture; The 2015 Edsger W. Dijkstra Prizein Distributed Computing; The 2015 Doctoral Dissertation Awardin Distributed Computing; DISC 2015 Invited Lecture:System Algorithms for the Cloud and Big Data; Contents; On the Computational Complexity of MapReduce; 1 Introduction; 2 Background and Previous Work; 2.1 MapReduce; 2.2 Complexity; 3 Models; 3.1 MapReduce and MRC; 3.2 Nonuniformity; 3.3 Other Models of Parallel Computation; 4 Space Complexity Classes in MRC0; 5 Hierarchy Theorems; 6 Discussion and Open Problems; References |
|
Efficient Counting with Optimal Resilience1 Introduction; 1.1 Contributions; 1.2 Prior Work; 1.3 Structure of the Article; 2 Preliminaries; 3 Optimal Resilience Boosting; 3.1 The Road Map; 3.2 Agreeing on a Common Counter (Once in a While); 3.3 Reaching Consensus; 3.4 Proofs of Theorems 1 and 2; 4 Less Communication After Stabilisation; 5 Discussion; References; The Computational Power of Beeps; 1 Introduction; 2 Model; 3 Leader Election; 3.1 Leader Election Lower Bound; 3.2 The Universal Leader Election Algorithm; 3.3 Optimal Leader Election; 3.4 Fast Leader Election with Sub-Optimal State |
|
3.5 Fast Leader Election with O(1) States and High Probability4 Solving General Distributed Decision Problems; References; Byzantine Fireflies; 1 Introduction; 2 Model and Problem; 3 Lower Bound; 4 Known Beeping Period; 4.1 Algorithm (Known Period Synchronous Beeping -- KPSB); 4.2 Informal Description; 4.3 Correctness Proof; 5 Unknown Beeping Period; 5.1 Preliminaries; 5.2 Algorithm (Unknown Period Synchronous Beeping -- UPSB); 5.3 Informal Description; 5.4 Correctness Proof; 6 Average Beeping Period; 6.1 Lower Bound; 6.2 Preliminaries; 6.3 Algorithm (Average Period Synchronous Beeping -- APSB) |
|
6.4 Informal Description6.5 Correctness Proof; 7 Synchronous Lighting; 7.1 Problem; 7.2 Algorithm (Average Period Synchronous Lighting -- APSL); 7.3 Correctness Proof; 8 Conclusion; References; Wait-Freedom is Harder Than Lock-Freedom Under Strong Linearizability; 1 Introduction; 2 Preliminaries; 3 Impossibilities; 3.1 Group Valency and Super Valency; 3.2 Impossibility Proof; 4 Lock-Free Implementations; 5 Discussion; References; Simulating a Shared Register in an Asynchronous System that Never Stops Changing; 1 Introduction; 2 Model; 3 The CCReg Algorithm; 4 Correctness Proof; 5 Discussion |
| Summary |
This book constitutes the proceedings of the 29th International Symposium on Distributed Computing, DISC 2015, held in Tokyo, Japan, in October 2015. The 42 full papers and 14 short papers presented in this volume were carefully reviewed and selected from 143 submissions. The papers feature original contributions to theory, design, implementation, modeling, analysis, or application of distributed systems and networks |
| Notes |
English |
| Subject |
Electronic data processing -- Distributed processing -- Congresses
|
|
Computer science.
|
|
Computer networks.
|
|
Software engineering.
|
|
Data structures (Computer science)
|
|
Electronic Data Processing
|
|
Computer Communication Networks
|
|
Computer networks
|
|
Computer science
|
|
Data structures (Computer science)
|
|
Electronic data processing -- Distributed processing
|
|
Software engineering
|
| Genre/Form |
dictionaries.
|
|
proceedings (reports)
|
|
Dictionaries
|
|
Conference papers and proceedings
|
|
Dictionaries.
|
|
Conference papers and proceedings.
|
|
Dictionnaires.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Moses, Yoram, editor
|
| ISBN |
9783662486535 |
|
3662486539 |
|
