Sciweavers

231 search results - page 42 / 47
» Asynchronous failure detectors
Sort
View
TCS
2008
13 years 8 months ago
A timed semantics of Orc
Orc is a kernel language for structured concurrent programming. Orc provides three powerful combinators that define the structure of a concurrent computation. These combinators su...
Ian Wehrman, David Kitchin, William R. Cook, Jayad...
TON
1998
68views more  TON 1998»
13 years 8 months ago
Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks
Abstract—The total transmission capacity required by a transport network to satisfy demand and protect it from failures contributes significantly to its cost, especially in long...
Rainer R. Iraschko, Mike H. MacGregor, Wayne D. Gr...
FPGA
2010
ACM
182views FPGA» more  FPGA 2010»
13 years 6 months ago
A comprehensive approach to modeling, characterizing and optimizing for metastability in FPGAs
Metastability is a phenomenon that can cause system failures in digital circuits. It may occur whenever signals are being transmitted across asynchronous or unrelated clock domain...
Doris Chen, Deshanand Singh, Jeffrey Chromczak, Da...
PODC
2011
ACM
12 years 11 months ago
The complexity of robust atomic storage
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...
Dan Dobre, Rachid Guerraoui, Matthias Majuntke, Ne...
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
14 years 9 months ago
From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon