Sciweavers

947 search results - page 114 / 190
» Fault Tolerant Computation on Ensemble Quantum Computers
Sort
View
ICN
2005
Springer
15 years 11 months ago
Fault Free Shortest Path Routing on the de Bruijn Networks
It is shown that the de Bruijn graph (dBG) can be used as an architecture for interconnection networks and a suitable structure for parallel computation. Recent works have classiï¬...
Ngoc Chi Nguyen, Vo Dinh Minh Nhat, Sungyoung Lee
SAFECOMP
1999
Springer
15 years 10 months ago
FlexFi: A Flexible Fault Injection Environment for Microprocessor-Based Systems
Microprocessor-based systems are increasingly used to control safety-critical systems (e.g., air and railway traffic control, nuclear plant control, aircraft and car control). In t...
Alfredo Benso, Maurizio Rebaudengo, Matteo Sonza R...
IPPS
1999
IEEE
15 years 10 months ago
Oblivious Deadlock-Free Routing in a Faulty Hypercube
A central problem in massively parallel computing is efficiently routing data between processors. This problem is complicated by two considerations. First, in any massively parall...
Jin Suk Kim, Eric Lehman, Frank Thomson Leighton
AINA
2007
IEEE
16 years 14 days ago
Grid-Aware Evaluation of Regular Path Queries on Spatial Networks
Regular path queries (RPQs), expressed as regular expressions over the alphabet of database edge-labels, are commonly used for guided navigation of graph databases. While convenie...
Zhuo Miao, Dan C. Stefanescu, Alex Thomo
HPCA
2009
IEEE
16 years 6 months ago
Eliminating microarchitectural dependency from Architectural Vulnerability
The Architectural Vulnerability Factor (AVF) of a hardware structure is the probability that a fault in the structure will affect the output of a program. AVF captures both microa...
Vilas Sridharan, David R. Kaeli