1119 search results - page 108 / 224 » Computing in the Presence of Timing Failures |
AIMS
2008
Springer
14 years 2 months ago
2008
Springer
It has been shown that sets of convergent operators with a shared fixed point can simulate autonomic control mechanisms, but many questions remain about this management technique....
IPTPS
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we present Chainsaw, a p2p overlay multicast system that completely eliminates trees. Peers are notified of new packets by their neighbors and must explicitly requ...
COLCOM
2009
IEEE
14 years 16 days ago
2009
IEEE
Abstract—For a complex distributed system to be dependable, it must be continuously monitored, so that its failures and imperfections can be discovered and corrected in a timely ...
FOCS
1993
IEEE
13 years 12 months ago
1993
IEEE
: Weprove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where pro...
WG
1998
Springer
14 years 16 hour ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...