Results 1 
6 of
6
Packet Routing In FixedConnection Networks: A Survey
, 1998
"... We survey routing problems on fixedconnection networks. We consider many aspects of the routing problem and provide known theoretical results for various communication models. We focus on (partial) permutation, krelation routing, routing to random destinations, dynamic routing, isotonic routing ..."
Abstract

Cited by 29 (3 self)
 Add to MetaCart
We survey routing problems on fixedconnection networks. We consider many aspects of the routing problem and provide known theoretical results for various communication models. We focus on (partial) permutation, krelation routing, routing to random destinations, dynamic routing, isotonic routing, fault tolerant routing, and related sorting results. We also provide a list of unsolved problems and numerous references.
Applications of Probabilistic Quorums to Iterative Algorithms
 In Proceedings of 21st International Conference on Distributed Computing Systems (ICDCS21
, 2001
"... ..."
Randomized registers and iterative algorithms
 Distributed Computing
, 2005
"... We present three different specifications of a readwrite register that may occasionally return outofdate values — namely, a (basic) random register, a Prandom register, and a monotone random register. We show that these specifications are implemented by the probabilistic quorum algorithm of Malk ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We present three different specifications of a readwrite register that may occasionally return outofdate values — namely, a (basic) random register, a Prandom register, and a monotone random register. We show that these specifications are implemented by the probabilistic quorum algorithm of Malkhi, Reiter, Wool, and Wright, and we illustrate how to program with such registers in the framework of Bertsekas, using the notation of Üresin and Dubois. Consequently, existing iterative algorithms for a significant class of problems (including solving systems of linear equations, finding shortest paths, constraint satisfaction, and transitive closure) will converge with high probability if executed in a system in which the shared data is implemented with registers satisfying the new specifications. Furthermore, the algorithms in this framework will inherit positive attributes concerning load and faulttolerance from the underlying register implementation. The expected convergence time for iterative algorithms using the monotone implementation is analyzed and shown experimentally to improve on that of the original implementation. The message complexity for iterative algorithms using the monotone probabilistic quorum implementation is shown to improve on that of nonprobabilistic implementations in a quantifiable situation.
Fast, Efficient Mutual and Self Simulations for Shared Memory and Reconfigurable Mesh
 in Proceedings of the 7th IEEE Symposium on Parallel and Distributed Processing
, 1995
"... This paper studies relations between the parallel random access machine (pram) model, and the reconfigurable mesh (rmesh) model, by providing mutual simulations between the models. We present an algorithm simulating one step of an (n lg lg n) processor crcw pram on an n \Theta n rmesh with delay O ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper studies relations between the parallel random access machine (pram) model, and the reconfigurable mesh (rmesh) model, by providing mutual simulations between the models. We present an algorithm simulating one step of an (n lg lg n) processor crcw pram on an n \Theta n rmesh with delay O(lg lg n) with high probability. We use our pram simulation to obtain the first efficient selfsimulation algorithm of an rmesh with general switches: An algorithm running on an n \Theta n rmesh is simulated on a p \Theta p rmesh with delay O((n=p) 2 + lg n lg lg p) with high probability, which is optimal for all p n= p lg n lg lg n. Finally, we consider the simulation of rmesh on the pram. We show that a 2 \Theta n rmesh can be optimally simulated on a crcw pram in \Theta(ff(n)) time, where ff(\Delta) is the slowgrowing inverse Ackermann function. In contrast, a pram with polynomial number of processors cannot simulate the 3 \Theta n rmesh in less than \Omega\Gammaha n= lg lg n) e...
Specification, Implementation and Application of Randomized Regular Registers
, 2000
"... This paper presents a definition of a randomized regular register, shows that the definition is implemented by the probabilistic quorum algorithm of Malkhi, Reiter and Wright (1997) and shows how to program with such registers using the framework of Uresin and Dubois (1990). ..."
Abstract
 Add to MetaCart
This paper presents a definition of a randomized regular register, shows that the definition is implemented by the probabilistic quorum algorithm of Malkhi, Reiter and Wright (1997) and shows how to program with such registers using the framework of Uresin and Dubois (1990).