Sciweavers

12301 search results - page 2225 / 2461
» Distributed Computation in Dynamic Networks
Sort
View
119
Voted
SPAA
2009
ACM
16 years 4 months ago
The weakest failure detector for wait-free dining under eventual weak exclusion
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
Srikanth Sastry, Scott M. Pike, Jennifer L. Welch
141
Voted
PODC
2009
ACM
16 years 4 months ago
Brief announcement: global consistency can be easier than point-to-point communication
Global consistency or Byzantine Agreement (BA) and reliable point-to-point communication are two of the most important and well-studied problems in distributed computing. Informal...
Prasant Gopal, Anuj Gupta, Pranav K. Vasishta, Piy...
103
Voted
ICDCS
2009
IEEE
16 years 26 days ago
On the Utility of Inference Mechanisms
A number of network path delay, loss, or bandwidth inference mechanisms have been proposed over the past decade. Concurrently, several network measurement services have been deplo...
Ethan Blanton, Sonia Fahmy, Greg N. Frederickson
147
Voted
FM
2009
Springer
138views Formal Methods» more  FM 2009»
15 years 10 months ago
What Can Formal Methods Bring to Systems Biology?
This position paper argues that the operational modelling approaches from the formal methods community can be applied fruitfully within the systems biology domain. The results can ...
Nicola Bonzanni, K. Anton Feenstra, Wan Fokkink, E...
153
Voted
ICPP
1993
IEEE
15 years 7 months ago
Scalability Study of the KSR-1
Scalability of parallel architectures is an interesting area of current research. Shared memory parallel programming is attractive stemming from its relative ease in transitioning...
Umakishore Ramachandran, Gautam Shah, Ravi Kumar, ...
« Prev « First page 2225 / 2461 Last » Next »