Richard J. Cole, Bruce M. Maggs  Home/Search
Context Related
| umass.edu/~ramesh/Pub/ColeMS94.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: umass.edu/~ramesh/pubs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we study the ability of array-based networks to tolerate worstcase faults. We show that an N \Theta N two-dimensional array can sustain N 1\Gammaffl worst-case faults, for any fixed ffl ? 0, and still emulate a fully functioning N \Theta N array with only constant slowdown. Previously it was known only that an array could tolerate a constant number of faults with constant slowdown. We also show that if faulty nodes are allowed to communicate, but not compute, then an N-node... (Update)
Cited by: More
Improved Bounds for Online Multi-Path Routing in Faulty.. - Rührup, Schindelhauer (2006) (Correct)
Online Routing in Faulty Meshes with Sub-linear.. - Rührup, Schindelhauer (2005) (Correct)
The Effect of Faults on Network Expansion - Bagchi, Bhargava, Chaudhary.. (2004) (Correct)
Similar documents (at the sentence level):
67.4%: Reconfiguring Arrays with Faults Part I: Worst-Case Faults - Cole, Maggs, Sitaraman (1997) (Correct)
Active bibliography (related documents): More All
0.7: On the Fault Tolerance of Some Popular Bounded-Degree.. - Leighton, Maggs, Sitamaran (1995) (Correct)
0.2: Fault Tolerant Networks With Small Degree - Zhang (2000) (Correct)
0.2: Packet Routing in Fixed-Connection Networks: A Survey - Grammatikakis, Hsu.. (1998) (Correct)
Similar documents based on text: More All
0.2: Communication Fault Tolerance in Parallel Computers - Sitaraman (1993) (Correct)
0.2: Strong Fault-Tolerance: Parallel Routing in Star Networks with.. - Oh, Chen (2001) (Correct)
0.1: Performance and Bus Transfer Influences - Schönberg, Mehnert, Hamann.. (1998) (Correct)
Related documents from co-citation: More All
4: Fast algorithms for routing around faults in multibutterflies and randomly-wired.. - Leighton, Maggs - 1992
2: Percolation theory and computing with faulty arrays of processors (context) - Mathies - 1992
2: Fault tolerance in networks of bounded degree (context) - Dwork, Peleg et al. - 1988
BibTeX entry: (Update)
R. J. Cole, B. M. Maggs, and R. K. Sitaraman. Reconfiguring arrays with faults part I: Worst-case faults. SIAM Journal on Computing, 26(6), Dec. 1997. To appear. http://citeseer.ist.psu.edu/article/cole97reconfiguring.html More
@article{ cole97reconfiguring,
author = "Richard J. Cole and Bruce M. Maggs and Ramesh K. Sitaraman",
title = "Reconfiguring Arrays with Faults Part I: Worst-Case Faults",
journal = "SIAM J. Comput.",
volume = "26",
number = "6",
pages = "1581-1611",
year = "1997",
url = "citeseer.ist.psu.edu/article/cole97reconfiguring.html" }
Citations (may not include all citations):163 Efficient dispersal of information for security (context) - Rabin - 1989
84 Universal packet routing algorithms (context) - Leighton, Maggs et al. - 1988
53 Workpreserving emulations of fixed-connection networks - Koch, Leighton et al. - 1989
36 Asymptotically tight bounds for computing with faulty arrays.. (context) - Kaklamanis, Karlin et al. - 1990
28 the fault tolerance of some popular bounded-degree networks - Leighton, Maggs et al. - 1992
21 the computational equivalence of hypercube-derived networks (context) - Schwabe - 1990
18 Wafer-scale integration of systolic arrays (context) - Leighton, Leiserson - 1985
18 Configuration of VLSI arrays in the presence of defects (context) - Greene, Gamal - 1984
17 Robust algorithms for packet routing in a mesh (context) - Raghavan - 1989
15 Percolation theory and computing with faulty arrays of proce.. (context) - Mathies - 1992
12 Department of Computer Science (context) - Fellows, in et al. - 1985
11 Computing with faulty arrays (context) - Aumann, Ben-Or - 1992
10 Efficient self-embedding of butterfly networks with random f.. (context) - Tamaki - 1992
10 Fault-tolerant meshes with small degree - Bruck, Cypher et al. - 1993
9 perfect hash functions and disjoint paths (context) - Ajtai, Alon et al. - 1992
5 Robust bounded-degree networks with small diameters (context) - Tamaki - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.umass.edu/~ramesh/pubs.html): More
Simple Algorithms for Routing on Butterfly Networks with.. - Maggs, Sitaraman (1992) (Correct)
On the Fault Tolerance of Some Popular Bounded-Degree.. - Leighton, Maggs, Sitamaran (1995) (Correct)
Routing on Butterfly Networks with Random Faults - Cole, Maggs, Sitaraman (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC