Result 1 to 20 from 1615 total
$f$-sensitivity distance oracles and routing schemes. (English)
Algorithmica 63, No. 4, 861-882 (2012).
1
Fault tolerance in $k$-ary $n$-cube networks. (English)
Theor. Comput. Sci. 460, 34-41 (2012).
2
Completely independent spanning trees in torus networks. (English)
Networks 60, No. 1, 59-69 (2012).
3
Hamiltonian cycles in hypercubes with $2n-4$ faulty edges. (English)
Inf. Sci. 215, 75-82 (2012).
4
From a store-collect object and $Ω$ to efficient asynchronous consensus. (English)
Kaklamanis, Christos (ed.) et al., Euro-Par 2012 parallel processing. 18th international conference, Euro-Par 2012, Rhodes Island, Greece, August 27‒31, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32819-0/pbk). Lecture Notes in Computer Science 7484, 427-438 (2012).
5
HADAB: Enabling fault tolerance in parallel applications running in distributed environments. (English)
Wyrzykowski, Roman (ed.) et al., Parallel processing and applied mathematics. 9th international conference, PPAM 2011, Torun, Poland, September 11‒14, 2011. Revised selected papers, Part I. Berlin: Springer (ISBN 978-3-642-31463-6/pbk). Lecture Notes in Computer Science 7203, 700-709 (2012).
6
Distributed QR factorization based on randomized algorithms. (English)
Wyrzykowski, Roman (ed.) et al., Parallel processing and applied mathematics. 9th international conference, PPAM 2011, Torun, Poland, September 11‒14, 2011. Revised selected papers, Part I. Berlin: Springer (ISBN 978-3-642-31463-6/pbk). Lecture Notes in Computer Science 7203, 235-244 (2012).
7
Edge fault tolerance on sparse networks. (English)
Czumaj, Artur (ed.) et al., Automata, languages, and programming. 39th international colloquium, ICALP 2012, Warwick, UK, July 9‒13, 2012. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-31584-8/pbk). Lecture Notes in Computer Science 7392, 452-463 (2012).
8
A multi-cycle checkpointing protocol that ensures strict 1-rollback. (English)
Inf. Process. Lett. 112, No. 20, 788-793 (2012).
9
$λ^{\prime}$-optimality of bipartite digraphs. (English)
Inf. Process. Lett. 112, No. 17-18, 701-705 (2012).
10
On deriving conditional diagnosability of interconnection networks. (English)
Inf. Process. Lett. 112, No. 17-18, 674-677 (2012).
11
A scalable and fault-tolerant network routing scheme for many-core and multi-chip systems. (English)
J. Parallel Distrib. Comput. 72, No. 11, 1433-1441 (2012).
12
Thread vulnerability in parallel applications. (English)
J. Parallel Distrib. Comput. 72, No. 10, 1171-1185 (2012).
13
On the viability of checkpoint compression for extreme scale fault tolerance. (English)
Alexander, Michael (ed.) et al., Euro-Par 2011: Parallel processing workshops. CCPI, CGWS, HeteroPar, HiBB, HPCVirt, HPPC, HPSS, MDGS, ProPer, Resilience, UCHPC, VHPC, Bordeaux, France, August 29‒September 2, 2011. Revised selected papers, Part II. Berlin: Springer (ISBN 978-3-642-29739-7/pbk). Lecture Notes in Computer Science 7156, 302-311 (2012).
14
Experimental framework for injecting logic errors in a virtual machine to profile applications for soft error resilience. (English)
Alexander, Michael (ed.) et al., Euro-Par 2011: Parallel processing workshops. CCPI, CGWS, HeteroPar, HiBB, HPCVirt, HPPC, HPSS, MDGS, ProPer, Resilience, UCHPC, VHPC, Bordeaux, France, August 29‒September 2, 2011. Revised selected papers, Part II. Berlin: Springer (ISBN 978-3-642-29739-7/pbk). Lecture Notes in Computer Science 7156, 282-291 (2012).
15
Cooperative application/OS DRAM fault recovery. (English)
Alexander, Michael (ed.) et al., Euro-Par 2011: Parallel processing workshops. CCPI, CGWS, HeteroPar, HiBB, HPCVirt, HPPC, HPSS, MDGS, ProPer, Resilience, UCHPC, VHPC, Bordeaux, France, August 29‒September 2, 2011. Revised selected papers, Part II. Berlin: Springer (ISBN 978-3-642-29739-7/pbk). Lecture Notes in Computer Science 7156, 241-250 (2012).
16
Analyzing fault aware collective performance in a process fault tolerant MPI. (English)
Parallel Comput. 38, No. 1-2, 15-25 (2012).
17
Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees. (English)
Discrete Math. 312, No. 21, 3087-3095 (2012).
18
Bounded length, 2-edge augmentation of geometric planar graphs. (English)
Discrete Math. Algorithms Appl. 4, No. 3, 1250036,19p. (2012).
19
Edge fault tolerance of super edge connectivity for three families of interconnection networks. (English)
Inf. Sci. 188, 260-268 (2012).
20
Result 1 to 20 from 1615 total
Start
Contact
Print
General Help
