Sciweavers

242 search results - page 36 / 49
» Computing bounds for fault tolerance using formal techniques
Sort
View
INFOCOM
2009
IEEE
15 years 4 months ago
MARA: Maximum Alternative Routing Algorithm
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
Yasuhiro Ohara, Shinji Imahori, Rodney Van Meter
64
Voted
DAC
2006
ACM
15 years 10 months ago
Timing-based delay test for screening small delay defects
The delay fault test pattern set generated by timing unaware commercial ATPG tools mostly affects very short paths, thereby increasing the escape chance of smaller delay defects. ...
Nisar Ahmed, Mohammad Tehranipoor, Vinay Jayaram
PODC
2012
ACM
13 years 2 days ago
Byzantine broadcast in point-to-point networks using local linear coding
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
Guanfeng Liang, Nitin H. Vaidya
HPDC
2005
IEEE
15 years 3 months ago
411 on scalable password service
In this paper we present 411, a password distribution system for high performance environments that provides security and scalability. We show that existing solutions such as NIS ...
Federico D. Sacerdoti, Mason J. Katz, Philip M. Pa...
CLUSTER
2003
IEEE
15 years 2 months ago
A Case Study of Parallel I/O for Biological Sequence Search on Linux Clusters
In this paper we analyze the I/O access patterns of a widely-used biological sequence search tool and implement two variations that employ parallel-I/O for data access based on PV...
Yifeng Zhu, Hong Jiang, Xiao Qin, David R. Swanson