Sciweavers

7683 search results - page 1363 / 1537
» Distributed Computing with the CLAN Network
Sort
View
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
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...
ICDCS
2009
IEEE
16 years 1 months 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
FM
2009
Springer
138views Formal Methods» more  FM 2009»
15 years 11 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...
ICSOC
2004
Springer
15 years 9 months ago
Assured service quality by improved fault management
The paradigm shift from device-oriented to service-oriented management has also implications to the area of event correlation. Today’s event correlation mainly addresses the cor...
Andreas Hanemann, Martin Sailer, David Schmitz
« Prev « First page 1363 / 1537 Last » Next »