Abstract. We propose a framework to analyze and compare wavelength division multiplexed (WDM) switching networks qualitatively and quantitatively. The framework not only help analyze and compare the complexity of WDM switching networks, but also explain interesting properties of different designs. Then, several important problems arising from this idea are addressed, and complexity bounds are d...

We provide results for implementing resilient consensus for a (countably) infinite collection of processes. – For a known number of faults, we prove the following equivalence result: For every t ≥ 1, there is a t-resilient consensus object for infinitely many processes if and only if there is a t-resilient consensus object for t + 1 processes. – For an unknown or infinite number of faults, we c...

We apply the classic theory of linearizability to operations that must wait for some other thread to establish a precondition. We model such an operation as a request and a follow-up, each with its own linearization point. Linearization of the request marks the point at which a thread’s wishes become visible to its peers; linearization of the follow-up marks the point at which the request is fu...

This paper investigates whether the assumption of unique identifiers is essential for wait-free distributed computing using shared objects of various types. Algorithms where all processes are programmed identically and do not use unique identifiers are called anonymous. A variety of results are given about the anonymous solvability of two key problems, consensus and naming, in systems of variou...

An efficient roll-forward checkpointing/recovery scheme for distributed systems has been presented. This work is an improvement of our earlier work. The use of the concept of forced checkpoints helps to design a single phase non-blocking algorithm to find consistent global checkpoints. It offers the main advantages of both the synchronous and the asynchronous approaches, that is simple recovery...

This paper intends to give a semantical perspective on the recent work by Herlihy, Shavit and Rajsbaum on computability and complexity results for t-resilient and wait-free protocols for distributed systems. It is an extended abstract a of a talk given at the Imperial College Workshop, Oxford, Christ Church on the 2nd of April 1996.

This paper presents polynomial-time algorithms for the construction of deterministic and internally non-blocking concentrators from multi-stage cascades of 2x2 sorters. The approach is a generalization of "Fast Knockout" and "Sortout" techniques. The goal is to construct best known m-to-n networks of 2x2 sorters for m-to-n concentration, where m and n are within the practical range. The main cr...

The Choice Coordination Problem with k alternatives (kCCP) was introduced by Rabin in 1982 [Rab82]. The goal is to design a wait-free protocol for n asynchronous processes which causes all correct processes to agree on one out of k possible alternatives. The agreement on a single choice is complicated by the fact that there is no a priori agreement on names for the alternatives. Furthermore pro...

We present a generic module, called Fast Collect. Fast Collect is an implementation of Single-Writer Multi-Reader (SWMR) Shared-Memory in an asynchronous system in which a processor updates its cell and then reads in any order all the other cells. Our simple implementation of Fast Collect uses some MultiWriter, Multi-Reader (MWMR) variables and one local boolean per processor, such that eventua...