Sciweavers

716 search results - page 95 / 144
» Tolerating Faults in Synchronization Networks
Sort
View
106
Voted
SIROCCO
2003
15 years 5 months ago
Polynomial-Time Computable Backup Tables for Shortest-Path Routing
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...
Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihi...
ISCA
2002
IEEE
115views Hardware» more  ISCA 2002»
15 years 8 months ago
SafetyNet: Improving the Availability of Shared Memory Multiprocessors with Global Checkpoint/Recovery
We develop an availability solution, called SafetyNet, that uses a unified, lightweight checkpoint/recovery mechanism to support multiple long-latency fault detection schemes. At...
Daniel J. Sorin, Milo M. K. Martin, Mark D. Hill, ...
139
Voted
SIGMETRICS
2010
ACM
201views Hardware» more  SIGMETRICS 2010»
15 years 8 months ago
Transparent, lightweight application execution replay on commodity multiprocessor operating systems
We present S, the first system to provide transparent, lowoverhead application record-replay and the ability to go live from replayed execution. S i...
Oren Laadan, Nicolas Viennot, Jason Nieh
266
Voted
PADL
2009
Springer
16 years 4 months ago
Operational Semantics for Declarative Networking
Declarative Networking has been recently promoted as a high-level programming paradigm to more conveniently describe and implement systems that run in a distributed fashion over a ...
Juan A. Navarro, Andrey Rybalchenko
116
Voted
SNPD
2007
15 years 5 months ago
Biswapped Networks and Their Topological Properties
In this paper, we propose a new class of interconnection networks, called “biswapped networks” (BSNs). Each BSN is built of 2n copies of some n-node basis network using a simp...
Wenjun Xiao, Weidong Chen, Mingxin He, Wenhong Wei...