Sciweavers

614 search results - page 86 / 123
» A RESTful messaging system for asynchronous distributed proc...
Sort
View
PODC
1997
ACM
15 years 4 months ago
Determining Consensus Numbers
Conditions on a shared object type T are given that are both necessary and sufficient for wait-free n-process consensus to be solvable using objects of type T and registers. The co...
Eric Ruppert
CORR
2010
Springer
146views Education» more  CORR 2010»
15 years 17 days ago
Modified Bully Algorithm using Election Commission
-- Electing leader is a vital issue not only in distributed computing but also in communication network [1, 2, 3, 4, 5], centralized mutual exclusion algorithm [6, 7], centralized ...
Muhammad Mahbubur Rahman, Afroza Nahar
SPAA
2009
ACM
15 years 7 months ago
Locally scalable randomized consensus for synchronous crash failures
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
Bogdan S. Chlebus, Dariusz R. Kowalski
HCW
1998
IEEE
15 years 4 months ago
Implementing Distributed Synthetic Forces Simulations in Metacomputing Environments
A distributed, parallel implementation of the widely used Modular Semi-Automated Forces ModSAF Distributed Interactive Simulation DIS is presented, with Scalable Parallel Processo...
Sharon Brunett, Dan Davis, Thomas Gottschalk, Paul...
166
Voted
BIOWIRE
2007
Springer
15 years 6 months ago
Epcast: Controlled Dissemination in Human-Based Wireless Networks Using Epidemic Spreading Models
Epidemics-inspired techniques have received huge attention in recent years from the distributed systems and networking communities. These algorithms and protocols rely on probabili...
Salvatore Scellato, Cecilia Mascolo, Mirco Musoles...