-
1
-
A Time Complexity Bound for Adaptive Mutual Exclusion
-
1
-
Introduction
-
1
-
Introduction to Distributed Systems
-
3
-
Distributed Systems Foundations
-
16
-
Quorum-Based Algorithms for Group Mutual Exclusion
-
17
-
Basic Concepts
-
21
-
Distributed System Paradigms
-
32
-
Introduction to CORBA
-
33
-
An Effective Characterization of Computability in Anonymous Networks
-
37
-
PPF in Practice
-
48
-
Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System
-
57
-
Development of PPF Applications
-
63
-
Optimal Unconditional Information Diffusion
-
64
-
CORBA Programming
-
65
-
Initial Development of an Application
-
78
-
Computation Slicing: Techniques and Theory
-
81
-
Graphical Simulation and Performance Analysis of PPFs
-
89
-
Models of Distributed Computing
-
93
-
A Low-Latency Non-blocking Commit Service
-
95
-
Template‐based Implementation
-
108
-
Stable Leader Election
-
115
-
Application Examples
-
123
-
Adaptive Long-lived <Emphasis Type="Italic">O</Emphasis>(<Emphasis Type="Italic">k</Emphasis>
<Superscript>2</Superscript>)-Renaming with <Emphasis Type="Italic">O</Emphasis>(<Emphasis Type="Italic">k</Emphasis>
<Superscript>2</Superscript>) Steps
-
127
-
Object Adaptors
-
133
-
Distributed Systems and Platforms
-
136
-
A New Synchronous Lower Bound for Set Agreement
-
151
-
The Complexity of Synchronous Iterative Do-All with Crashes
-
159
-
Case Study: VP’63- The Vintageport’63 Large-Scale Information System
-
162
-
CORBA Interoperability
-
163
-
Design Studies
-
166
-
Mobile Search for a Black Hole in an Anonymous Ring
-
171
-
Fault-Tolerant Systems Foundations
-
180
-
Randomised Mutual Search for <Emphasis Type="Italic">k</Emphasis> > 2 Agents
-
183
-
CORBA Caching
-
189
-
Counter Examples
-
193
-
Paradigms for Distributed Fault Tolerance
-
194
-
Self-stabilizing Minimum Spanning Tree Construction on Message-Passing Networks
-
209
-
Performance of PPFs
-
209
-
Self Stabilizing Distributed Queuing
-
211
-
Naming Service
-
224
-
A Space Optimal, Deterministic, Self-stabilizing, Leader Election Algorithm for Unidirectional Rings
-
232
-
Trading Object Service
-
235
-
Models of Distributed Fault-Tolerant Computing
-
240
-
Randomized Finite-state Distributed Algorithms As Markov Chains
-
247
-
Instrumentation of Templates
-
255
-
The Average Hop Count Measure For Virtual Path Layouts
-
259
-
Dependable Systems and Platforms
-
261
-
Future Trends
-
269
-
References
-
270
-
Efficient Routing in Networks with Long Range Contacts
-
271
-
Case Study: Making VP’63 Dependable
-
277
-
Event Service
-
277
-
Real-Time Systems Foundations
-
285
-
An Efficient Communication Strategy for Ad-hoc Mobile Networks
-
289
-
Paradigms For Real-Time
-
300
-
A Pragmatic Implementation of Non-blocking Linked-lists
-
315
-
Stabilizing Replicated Search Trees
-
316
-
Object Transaction Service
-
321
-
Models of Distributed Real-Time Computing
-
330
-
Adding Networks
-
342
-
Object Query Service
-
355
-
Distributed Real-Time Systems and Platforms
-
369
-
Case Study: Making VP’63 Timely
-
371
-
References
-
377
-
Fundamental Security Concepts
-
395
-
Security Paradigms
-
427
-
Models of Distributed Secure Computing
-
487
-
Secure Systems and Platforms
-
511
-
Case Study: Making VP’63 Secure
-
519
-
Fundamental Concepts of Management
-
531
-
Paradigms for Distributed Systems Management
-
541
-
Models of Network and Distributed Systems Management
-
557
-
Management Systems and Platforms
-
581
-
Case Study: Managing VP’63
-
i
-
Frontmatter and Index
-
i
-
Frontmatter and Index
