Sciweavers

716 search results - page 99 / 144
» Tolerating Faults in Synchronization Networks
Sort
View
113
Voted
IPPS
1997
IEEE
15 years 7 months ago
Nearly Optimal One-To-Many Parallel Routing in Star Networks
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
Chi-Chang Chen, Jianer Chen
165
Voted
EUROPAR
2009
Springer
15 years 1 months ago
A Least-Resistance Path in Reasoning about Unstructured Overlay Networks
Unstructured overlay networks for peer-to-peer applications combined with stochastic algorithms for clustering and resource location are attractive due to low-maintenance costs and...
Giorgos Georgiadis, Marina Papatriantafilou
130
Voted
DSN
2002
IEEE
15 years 8 months ago
Ditto Processor
Concentration of design effort for current single-chip Commercial-Off-The-Shelf (COTS) microprocessors has been directed towards performance. Reliability has not been the primary ...
Shih-Chang Lai, Shih-Lien Lu, Jih-Kwon Peir
145
Voted
DSN
2008
IEEE
15 years 5 months ago
Reliability of flat XOR-based erasure codes on heterogeneous devices
XOR-based erasure codes are a computationallyefficient means of generating redundancy in storage systems. Some such erasure codes provide irregular fault tolerance: some subsets o...
Kevin M. Greenan, Ethan L. Miller, Jay J. Wylie
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