Advances in Distributed Systems

1. Front Matter

   Pages I-VIII

   PDF

2. Part 1 Distributed Algorithms

   1. Time in Distributed System Models and Algorithms

      • Paulo Veríssimo, Michel Raynal

      Pages 1-32

   2. Consensus in Asynchronous Distributed Systems: A Concise Guided Tour

      • Rachid Guerraoui, Michel Hurfinn, Achour Mostefaoui, Riucarlos Oliveira, Michel Raynal, Andre Schiper

      Pages 33-47

   3. Group Communication in Partitionable Distributed Systems

      • Özalp Babaoğlu, Renzo Davoli, Alberto Montresor

      Pages 48-78

   4. Enhancing Replica Management Services to Cope with Group Failures

      • Paul D. Ezhilchelvan, Santosh K. Shrivastava

      Pages 79-103

   5. Recent Advances in Distributed Garbage Collection

      • Marc Shapiro, Fabrice Le Fessant, Paulo Ferreira

      Pages 104-126

   6. Topology-Aware Algorithms for Large-Scale Communication

      • Luís Rodrigues, Paulo Veríssimo

      Pages 127-156

3. Part 2 Systems Architecture

   1. Responsive Protocols for Distributed Multimedia Applications?

      • Fabio Panzieri, Marco Roccetti

      Pages 157-181

   2. Programming Partition-Aware Network Applications?

      • Özalp Babaoğglu, Alberto Bartoli, Gianluca Dini

      Pages 182-212

   3. Deploying Distributed Objects on the Internet

      • Steve J. Caughey, Daniel Hagimont, David B. Ingham

      Pages 213-237

   4. Integrating Group Communication with Transactions for Implementing Persistent Replicated Objects

      • Mark C. Little, Santosh K. Shrivastava

      Pages 238-253

   5. Replication of CORBA Objects

      • Pascal Felber, Rachid Guerraoui, André Schiper

      Pages 254-276

   6. Constructing Dependable Web Services

      • David B. Ingham, Fabio Panzieri, Santosh K. Shrivastava

      Pages 277-294

4. Part 3 Applications Support

   1. Support for Distributed CSCW Applications

      • François J. N. Cosquer, Paulo Veríssimo, Sacha Krakowiak, Loïc Decloedt

      Pages 295-326

   2. Component-Based Programming of Distributed Applications

      • Valèrie Issarny, Luc Bellissard, Michel Riveill, Apostolos Zarras

      Pages 327-353

   3. OPENflow: A CORBA Based Transactional Workflow System

      • Stuart M. Wheater, Santosh K. Shrivastava, Frederic Ranno

      Pages 354-374

   4. Improving the Effectiveness of Web Caching

      • Jean-Marc Menaud, Valérie Issarny, Michel Banâtre

      Pages 375-401

   5. Mobility and Coordination for Distributed Java Applications

      • Paolo Ciancarini, Andrea Giovannini, Davide Rossi

      Pages 402-425

5. Part 4 Case Studies

   1. PerDiS: Design, Implementation, and Use of a PERsistent DIstributed Store

      • Paulo Ferreira, Marc Shapiro, Xavier Blondel, Olivier Fambon, João Garcia, Sytse Kloosterman et al.

      Pages 427-452

   2. The University Student Registration System: A Case Study in Building a High-Availability Distributed Application Using General Purpose Components

      • Mark C. Little, Stuart M. Wheater, David B. Ingham, C. Richard Snow, Harry Whitfield, Santosh K. Shrivastava

      Pages 453-471

In 1992 we initiated a research project on large scale distributed computing systems (LSDCS). It was a collaborative project involving research institutes and universities in Bologna, Grenoble, Lausanne, Lisbon, Rennes, Rocquencourt, Newcastle, and Twente. The World Wide Web had recently been developed at CERN, but its use was not yet as common place as it is today and graphical browsers had yet to be developed. It was clear to us (and to just about everyone else) that LSDCS comprising several thousands to millions of individual computer systems (nodes) would be coming into existence as a consequence both of technological advances and the demands placed by applications. We were excited about the problems of building large distributed systems, and felt that serious rethinking of many of the existing computational paradigms, algorithms, and structuring principles for distributed computing was called for. In our research proposal, we summarized the problem domain as follows: “We expect LSDCS to exhibit great diversity of node and communications capability. Nodes will range from (mobile) laptop computers, workstations to supercomputers. Whereas mobile computers may well have unreliable, low bandwidth communications to the rest of the system, other parts of the system may well possess high bandwidth communications capability. To appreciate the problems posed by the sheer scale of a system comprising thousands of nodes, we observe that such systems will be rarely functioning in their entirety.

• COBRA
• CORBA
• Java
• Multimedia
• algorithm
• algorithms
• cluster computing
• computer communication
• distributed Architectures
• distributed algorithms
• distributed applications
• distributed computing
• distributed systems
• internet services
• programming
• algorithm analysis and problem complexity

• Grenoble Laboratoire SIRAC, INRIA Rhône-Alpes, Université Joseph fourier, Monbonnot Saint-Martin, France

  Sacha Krakowiak

• Department of Computing Science, University of Newcastle upon Tyne, Newcastle upon Tyne, UK

  Santosh Shrivastava

Policies and ethics