Sciweavers

Share
ICDE
2011
IEEE
265views Database» more  ICDE 2011»
7 years 11 months ago
RAFTing MapReduce: Fast recovery on the RAFT
MapReduce is a computing paradigm that has gained a lot of popularity as it allows non-expert users to easily run complex analytical tasks at very large-scale. At such scale, task...
Jorge-Arnulfo Quiané-Ruiz, Christoph Pinkel...
TC
2010
8 years 5 months ago
The Design and Evaluation of a Self-Organizing Superpeer Network
—Superpeer architectures exploit the heterogeneity of nodes in a peer-to-peer (P2P) network by assigning additional responsibilities to higher capacity nodes. In the design of a ...
Pawel Garbacki, Dick H. J. Epema, Maarten van Stee...
TELSYS
2002
100views more  TELSYS 2002»
8 years 6 months ago
An Efficient Rerouting Scheme for MPLS-Based Recovery and Its Performance Evaluation
The path recovery in MPLS is the technique to reroute traffic around a failure or congestion in a LSP. Currently, there are two kinds of model for path recovery: rerouting and prot...
Gaeil Ahn, Jongsoo Jang, Woojik Chun
TC
2008
8 years 7 months ago
STAR : An Efficient Coding Scheme for Correcting Triple Storage Node Failures
Proper data placement schemes based on erasure correcting code are one of the most important components for a highly available data storage system. For such schemes, low decoding ...
Cheng Huang, Lihao Xu
CORR
2008
Springer
97views Education» more  CORR 2008»
8 years 7 months ago
Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures
Single node failures represent more than 85% of all node failures in the today's large communication networks such as the Internet [10]. Also, these node failures are usually...
Amit M. Bhosle, Teofilo F. Gonzalez
CONEXT
2007
ACM
8 years 11 months ago
Proactive replication in distributed storage systems using machine availability estimation
Distributed storage systems provide data availability by means of redundancy. To assure a given level of availability in case of node failures, new redundant fragments need to be ...
Alessandro Duminuco, Ernst Biersack, Taoufik En-Na...
PODC
1994
ACM
8 years 11 months ago
A Checkpoint Protocol for an Entry Consistent Shared Memory System
Workstation clusters are becoming an interesting alternative to dedicated multiprocessors. In this environment, the probability of a failure, during an application's executio...
Nuno Neves, Miguel Castro, Paulo Guedes
WG
1998
Springer
8 years 11 months ago
Graphs with Bounded Induced Distance
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...
Serafino Cicerone, Gabriele Di Stefano
IPPS
2002
IEEE
9 years 2 days ago
Reliable Communication in Faulty Star Networks
‘ We take advantage of the hierarchical structure of the star graph network to obtain an efficient method for constructing node-disjoint paths between arbitrary pairs of nodes in...
Khaled Day, Abdel Elah Al-Ayyoub
PPOPP
2005
ACM
9 years 21 days ago
Fault tolerant high performance computing by a coding approach
As the number of processors in today’s high performance computers continues to grow, the mean-time-to-failure of these computers are becoming significantly shorter than the exe...
Zizhong Chen, Graham E. Fagg, Edgar Gabriel, Julie...
books