Sciweavers

194 search results - page 25 / 39
» A Problem-Specific Fault-Tolerance Mechanism for Asynchronou...
Sort
View
ECOOP
2000
Springer
15 years 4 months ago
Distributed Asynchronous Collections: Abstractions for Publish/Subscribe Interaction
ions for Publish/Subscribe Interaction Patrick Th. Eugster1 , Rachid Guerraoui1 , and Joe Sventek2 1 Swiss Federal Institute of Technology, Lausanne 2 Agilent Laboratories Scotland...
Patrick Th. Eugster, Rachid Guerraoui, Joe Sventek
PODC
2010
ACM
15 years 3 months ago
The multiplicative power of consensus numbers
: The Borowsky-Gafni (BG) simulation algorithm is a powerful reduction algorithm that shows that t-resilience of decision tasks can be fully characterized in terms of wait-freedom....
Damien Imbs, Michel Raynal
ISCA
2009
IEEE
159views Hardware» more  ISCA 2009»
15 years 6 months ago
End-to-end register data-flow continuous self-test
While Moore’s Law predicts the ability of semi-conductor industry to engineer smaller and more efficient transistors and circuits, there are serious issues not contemplated in t...
Javier Carretero, Pedro Chaparro, Xavier Vera, Jau...
DEBS
2008
ACM
15 years 1 months ago
Event-based constraints for sensornet programming
We propose a sensornet programming model based on declarative spatio-temporal constraints on events only, not sensors. Where previous approaches conflate events and sensors becaus...
Jie Mao, John Jannotti, Mert Akdere, Ugur Ç...
ICDCS
1996
IEEE
15 years 3 months ago
How to Recover Efficiently and Asynchronously when Optimism Fails
We propose a new algorithm for recovering asynchronously from failures in a distributed computation. Our algorithm is based on two novel concepts - a fault-tolerant vector clock t...
Om P. Damani, Vijay K. Garg