The proceedings contain 24 papers. The topics discussed include: Shifting Gears: shifting gears: changing algorithms on the fly to expedite byzantine agreement;quorum consensus in nested transaction systems;detection ...
ISBN:
(纸本)089791239X
The proceedings contain 24 papers. The topics discussed include: Shifting Gears: shifting gears: changing algorithms on the fly to expedite byzantine agreement;quorum consensus in nested transaction systems;detection of stable properties in distributed applications;modular verification of asynchronous networks;asynchronous approximate agreement;epidemic algorithms for replicated database maintenance;on the time-complexity of broadcast in radio networks: an exponential gap between determinism and randomization;specifying graceful degradation in distributed systems;update propagation in bakunin data networks;on processor coordination using asynchronous hardware;hierarchical correctness proofs for distributed algorithms;an optimal synchronizer for the hypercube;fault-tolerant decision making in totally asynchronous distributed systems;a hierarchy of temporal properties;the elusive atomic register revisited;specifying message passing systems requires extending temporai logic;constructing multi-reader atomic values from non-atomic values;a protocol for wait-free, atomic, multi-reader shared variables;and a little knowledge goes a long way: simple knowledge-based derivations and correctness proofs for a family of protocols.
When evaluated to true, a stable property remains true forever. Such a stable property may characterize important states of a computation. This is the case of deadlocked or terminated computations. In this paper we ex...
We introduce the input-output automaton, a simple but powerful model of computation in asynchronous distributed networks. With this model we are able to construct modular, hierarchical correctness proofs for distribut...
We study time and knowledge in reliable distributed systems with asynchronous communication. We first describe an extension of Lamport's logical clocks that can be used as if they were perfectly synchronized real-...
详细信息
The proceedings contain 19 papers. The topics discussed include: scale and performance in a distributed file system;caching in the sprite network file system;using idle workstations in a shared computing environment;a...
ISBN:
(纸本)089791242X
The proceedings contain 19 papers. The topics discussed include: scale and performance in a distributed file system;caching in the sprite network file system;using idle workstations in a shared computing environment;attacking the process migration bottleneck;hashed and hierarchical timing wheels: data structures for the efficient implementation of a timer facility;the packet filter: an efficient mechanism for user-level network code;a name service for evolving heterogeneous systems;duality of memory and communication in the implementation of a multiprocessor operating system;time warp operating system;synchronization primitives for a multiprocessor: a formal specification;stored voice in the Etherphone system;grained mobility in the Emerald system;management in QuickSilver;801 storage: architecture and programming;implementation of Argus;exploiting virtual synchrony in distributed systems;log files: an extended file service exploiting write-once storage;a simple and efficient implementation of a small database;reimplementing the cedar file system using logging and group commit.
distributed programs must often display graceful degradation, reacting adaptively to changes in the environment. Under ideal circumstances, the program's behavior satisfies a set of application-dependent constrain...
详细信息
This paper describes a technique for implementing the sort of small databases that frequently occur in the design of operating systems and distributed systems. We take advantage of the existence of very large virtual ...
详细信息
Andrew is a distributedcomputing environment being developed in a joint project by Carnegie Mellon University and IBM. One of the major components of Andrew is a distributed file system which constitutes underlying m...
ISBN:
(纸本)089791242X
Andrew is a distributedcomputing environment being developed in a joint project by Carnegie Mellon University and IBM. One of the major components of Andrew is a distributed file system which constitutes underlying mechanism for sharing information. The goals of the Andrew file system are to support growth up to at least 7000 workstations (one for each student, faculty member, and staff at Carnegie Mellon) while providing users, application programs, and system administrators with the amenities of a shared file system.A fundamental result of our concern with scale is the design decision to transfer whole files between servers and workstations rather than some smaller unit such as records or blocks, as almost all other distributed file systems do. This paper examines the consequences of this and other design decisions and features that bear on the scalability of *** scale affects a distributed system in two ways: it degrades performance and it complicates administration and day-to-day operation. This paper addresses both concerns and shows that the mechanisms we have incorporated cope with them successfully. We start the initial prototype of the system, what we learned from it, and how we changed the system to improve performance. We compare its performance with that of a block-oriented file system, Sun Microsystems' NFS, in order to evaluate the whole file transfer strategy. We then turn to operability, and finish with issues related peripherally to scale and with the ways the present design could be enchanced.
暂无评论