Sciweavers

157 search results - page 9 / 32
» Passing Messages to Lonely Numbers
Sort
View
IPPS
2007
IEEE
15 years 4 months ago
Message Routing and Scheduling in Optical Multistage Networks using Bayesian Inference method on AI algorithms
Optical Multistage Interconnection Networks (MINs) suffer from optical-loss during switching and crosstalk problem in the switches. The crosstalk problem is solved by routing mess...
Ajay K. Katangur, Somasheker Akkaladevi
JDA
2008
85views more  JDA 2008»
14 years 10 months ago
A robust randomized algorithm to perform independent tasks
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Ko...
COORDINATION
2008
Springer
14 years 11 months ago
Actors with Multi-headed Message Receive Patterns
Abstract. The actor model provides high-level concurrency abstractions to coordinate simultaneous computations by message passing. Languages implementing the actor model such as Er...
Martin Sulzmann, Edmund S. L. Lam, Peter Van Weert
JCP
2006
100views more  JCP 2006»
14 years 10 months ago
A Local Enumeration Protocol in Spite of Corrupted Data
We present a novel self-stabilizing version of Mazurkiewicz enumeration algorithm [1]. The initial version is based on local rules to enumerate nodes on an anonymous network. [2] p...
Brahim Hamid, Mohamed Mosbah
SAC
2010
ACM
15 years 4 months ago
Spanders: distributed spanning expanders
We consider self-stabilizing and self-organizing distributed construction of a spanner that forms an expander. The following results are presented. • A randomized technique to r...
Shlomi Dolev, Nir Tzachar