Sciweavers

267 search results - page 28 / 54
» Communication Complexity Under Product and Nonproduct Distri...
Sort
View
WDAG
2004
Springer
86views Algorithms» more  WDAG 2004»
14 years 1 months ago
Message-Optimal and Latency-Optimal Termination Detection Algorithms for Arbitrary Topologies
An important problem in distributed systems is to detect termination of a distributed computation. A computation is said to have terminated when all processes have become passive ...
Neeraj Mittal, Subbarayan Venkatesan, Sathya Peri
COOP
2004
13 years 10 months ago
Model Checking Groupware Protocols
Abstract. The enormous improvements in the efficiency of model-checking techniques in recent years facilitates their application to ever more complex systems of concurrent and dist...
Maurice H. ter Beek, Mieke Massink, Diego Latella,...
CODES
1996
IEEE
14 years 19 days ago
A Model for the Coanalysis of Hardware and Software Architectures
Successful """tiprocessor system design for complex realtime embedded applications requires powerful and comprehensive. yet cost-effective. productive. and maintain...
Fred Rose, Todd Carpenter, Sanjaya Kumar, John Sha...
DEBS
2010
ACM
14 years 11 days ago
Stochastic performance analysis and capacity planning of publish/subscribe systems
Publish/subscribe systems are used increasingly often as a communication mechanism in loosely-coupled distributed applications. With their gradual adoption in mission critical are...
Arnd Schröter, Gero Mühl, Samuel Kounev,...
BIOWIRE
2007
Springer
14 years 2 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...