Sciweavers

170 search results - page 23 / 34
» Interactive Animation of Fault Tolerant Parallel Algorithms
Sort
View
VLSID
2001
IEEE
164views VLSI» more  VLSID 2001»
16 years 2 days ago
An Efficient Parallel Transparent Bist Method For Multiple Embedded Memory Buffers
In this paper, we propose a new transparent built-in self-test ( TBIST ) method to test multiple embedded memory arrays with various sizes in parallel. First, a new transparent tes...
Der-Cheng Huang, Wen-Ben Jone, Sunil R. Das
SPAA
2010
ACM
15 years 4 months ago
Collaborative scoring with dishonest participants
Consider a set of players that are interested in collectively evaluating a set of objects. We develop a collaborative scoring protocol in which each player evaluates a subset of t...
Seth Gilbert, Rachid Guerraoui, Faezeh Malakouti R...
WDAG
2007
Springer
103views Algorithms» more  WDAG 2007»
15 years 5 months ago
Probabilistic Opaque Quorum Systems
Byzantine-fault-tolerant service protocols like Q/U and FaB Paxos that optimistically order requests can provide increased efficiency and fault scalability. However, these protocol...
Michael G. Merideth, Michael K. Reiter
ICPADS
2002
IEEE
15 years 4 months ago
Self-Stabilizing Wormhole Routing on Ring Networks
Wormhole routing is most common in parallel architectures in which messages are sent in small fragments called flits. It is a lightweight and efficient method of routing message...
Ajoy Kumar Datta, Maria Gradinariu, Anthony B. Ken...
SPAA
2003
ACM
15 years 5 months ago
The effect of communication costs in solid-state quantum computing architectures
Quantum computation has become an intriguing technology with which to attack difficult problems and to enhance system security. Quantum algorithms, however, have been analyzed un...
Dean Copsey, Mark Oskin, Tzvetan S. Metodi, Freder...