Article

Free access

Fault tolerant networks with small degree

Author:

Li ZhangAuthors Info & Claims

SPAA '00: Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures

Pages 64 - 69

https://doi.org/10.1145/341800.341809

Published: 09 July 2000 Publication History

PDF eReader

Abstract

In this paper, we study the design of fault tolerant networks for arrays and meshes by adding redundant nodes and edges. For a target graph G (linear array or mesh in this paper), a graph G′ is called a κ-fault-tolerant graph of G if when we remove any κ nodes from G′, it still contains a subgraph isomorphic to G. The major quality measures for a fault-tolerant graph are the number of spare nodes it uses and the maximum degree it has. The degree is particularly important in practice as it poses constraints on the scalability of the system. In this paper, we aim at designing fault-tolerant graphs with both small degree and small number of spare nodes. The graphs we obtain have degree O(1) for arrays and O(log³ κ) for meshes. The number of spare nodes used are O(κ log² κ) and O(κ²/log κ), respectively. Compared to the previous results, the number of spare nodes used in our construction has one fewer linear factor in κ.

References

[1]

M. Ajtai, N. Alon, J. Bruck, R. Cypher, C. T. Ho, M. Naor, and E. Szemer6di. Fault tolerant graphs, perfect hash functions and disjoint paths. In Proc. IEEE Syrup. on Foundations of Computer Science, pages 693-702, 1992.

Digital Library

Google Scholar

[2]

N. Alon and F. Chung. Explicit construction of linear sized tolerant networks. Discrete Mathematics, 72:15-19, 1988.

Digital Library

Google Scholar

[3]

Y. Aumann and M. A. Bender. Fault tolerant data structures. In Proc. IEEE Symp. on Foundations of Computer Science, pages 580-589, 1996.

Digital Library

Google Scholar

[4]

J. Bruck, R. Cypher, and C. Ho. Fault-tolerant meshes with small degree. SIAM J. Comput., 26(6):1764-1784, Dec. 1997.

Digital Library

Google Scholar

[5]

P. ErdSs, R. Graham, and E. Szemer6di. On sparse graphs with dense long paths. Computers and Mathematics with Applications, (1):365-369, 1975.

Google Scholar

[6]

J. Hastad, T. Leighton, and M. Newman. Fast computation using faulty hypercubes (extended abstract). In Proc. A CM Symp. on Theory of Computing, pages 251-263, 1989.

Digital Library

Google Scholar

[7]

C. Kaklamanis, A. R. Karlin, F. T. Leighton, V. Milenkovic, P. Raghavan, S. Rao, C. Thomborson, and A. Tsantilas. Asymptotically tight bounds for computing with faulty arrays of processors (extended abstract). In Proc. IEEE Symp. on Foundations of Computer Science, pages 285-296, 1990.

Google Scholar

[8]

F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan-Kaufmann, San Mateo, CA, 1992.

Digital Library

Google Scholar

[9]

T. Leighton, B. Maggs, and R. Sitaraman. On the fault tolerance of some popular bounded-degree networks. In Proc. IEEE Symp. on Foundations of Computer Science, pages 542-552, 1992.

Digital Library

Google Scholar

[10]

A. L. Rosenberg. The Diogenes approach to testable fault-tolerant arrays of processors. IEEE Trans. Comput., C-32:480-489, 1983.

Digital Library

Google Scholar

[11]

A. L. Rosenberg. Fault-tolerant interconnection networks: a graph-theoretic approach. In Proc. 9th Workshop on Graph-Theoretic Concepts in Computer Science, pages 286-297, 1983.

Google Scholar

[12]

H. Tamaki. Construction of the mesh and the torus tolerating a large number of faults. Journal of Computer and System Sciences, 53(3):371-379, Dec. 1996.

Digital Library

Google Scholar

[13]

H. Tamaki. Efficient self-embedding of butterfly networks with random faults. SIAM Journal of Computing, 27(3):614-636, June 1998.

Digital Library

Google Scholar

Cited By

View all

Cichacz SSuchan K(2021)Minimum k-critical bipartite graphsDiscrete Applied Mathematics10.1016/j.dam.2021.06.005302:C(54-66)Online publication date: 30-Oct-2021
https://dl.acm.org/doi/10.1016/j.dam.2021.06.005
Dhas CBelinda JManoja JRamar K(2007)Secure Routing Using Ant Colony Method and RPS AlgorithmProceedings of the International Conference on Computational Intelligence and Multimedia Applications (ICCIMA 2007) - Volume 0410.1109/ICCIMA.2007.378(37-43)Online publication date: 13-Dec-2007
https://dl.acm.org/doi/10.1109/ICCIMA.2007.378
Peng SManohar R(2006)Self-Healing Asynchronous ArraysProceedings of the 12th IEEE International Symposium on Asynchronous Circuits and Systems10.1109/ASYNC.2006.25Online publication date: 13-Mar-2006
https://dl.acm.org/doi/10.1109/ASYNC.2006.25
Show More Cited By

Recommendations

Fault-Tolerant Meshes with Small Degree

In this paper, we study the design of fault-tolerant networks for arrays and meshes by adding redundant nodes and edges. For a target graph G (linear array or mesh in this paper), a graph G^{\prime} is called a k-fault-tolerant graph of G if when we ...
Superconnected and Hyperconnected Small Degree Transitive Graphs

A graph is said to be superconnected if every minimum vertex cut isolates a vertex. A graph is said to be hyperconnected if each minimum vertex cut creates exactly two components, one of which is an isolated vertex. In this paper, we characterize ...
Connected subgraphs with small degree sums in 3-connected planar graphs

It is well-known that every planar graph has a vertex of degree at most five. Kotzig proved that every 3-connected planar graph has an edge xy such that deg(x) + deg (y) ≤ 13. In this article, considering a similar problem for the case of three or more ...

Comments

Information & Contributors

Information

Published In

SPAA '00: Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures

July 2000

224 pages

ISBN:1581131852

DOI:10.1145/341800

Chairmen:
Gary Miller
Carnegie Mellon Univ. Pittsburgh PA; and Akamai Technologies, Inc.
,
Shang-Hua Teng
Univ. of Illinois at Urbana-Champaign, Urbana

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 July 2000

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SPAA00

Sponsor:

SPAA00: ACM symposium on Parallel Algorithms and Architectures

July 9 - 13, 2000

Maine, Bar Harbor, USA

Acceptance Rates

SPAA '00 Paper Acceptance Rate 24 of 45 submissions, 53%;

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
709
Total Downloads

Downloads (Last 12 months)22
Downloads (Last 6 weeks)2

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Cichacz SSuchan K(2021)Minimum k-critical bipartite graphsDiscrete Applied Mathematics10.1016/j.dam.2021.06.005302:C(54-66)Online publication date: 30-Oct-2021
https://dl.acm.org/doi/10.1016/j.dam.2021.06.005
Dhas CBelinda JManoja JRamar K(2007)Secure Routing Using Ant Colony Method and RPS AlgorithmProceedings of the International Conference on Computational Intelligence and Multimedia Applications (ICCIMA 2007) - Volume 0410.1109/ICCIMA.2007.378(37-43)Online publication date: 13-Dec-2007
https://dl.acm.org/doi/10.1109/ICCIMA.2007.378
Peng SManohar R(2006)Self-Healing Asynchronous ArraysProceedings of the 12th IEEE International Symposium on Asynchronous Circuits and Systems10.1109/ASYNC.2006.25Online publication date: 13-Mar-2006
https://dl.acm.org/doi/10.1109/ASYNC.2006.25
Rosenberg E(2005)Hierarchical topological network designIEEE/ACM Transactions on Networking10.1109/TNET.2005.86010013:6(1402-1409)Online publication date: 1-Dec-2005
https://dl.acm.org/doi/10.1109/TNET.2005.860100
Xin QMiller ESchwarz TLong D(2005)Impact of Failure on Interconnection Networks for Large Storage SystemsProceedings of the 22nd IEEE / 13th NASA Goddard Conference on Mass Storage Systems and Technologies10.1109/MSST.2005.18(189-196)Online publication date: 11-Apr-2005
https://dl.acm.org/doi/10.1109/MSST.2005.18
Sem-Jacobsen FSkeie TLysne OTorudbakken ORongved EJohnsen B(2005)Siamese-TwinProceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 0110.1109/IPDPS.2005.401Online publication date: 4-Apr-2005
https://dl.acm.org/doi/10.1109/IPDPS.2005.401
Peng SManohar R(2005)Fault Tolerant Asynchronous Adder through Dynamic Self-reconfigurationProceedings of the 2005 International Conference on Computer Design10.1109/ICCD.2005.56(171-179)Online publication date: 2-Oct-2005
https://dl.acm.org/doi/10.1109/ICCD.2005.56
Puente VGregorio JVallejo FBeivide R(2004)ImmunetProceedings of the 31st annual international symposium on Computer architecture10.5555/998680.1006718Online publication date: 19-Jun-2004
https://dl.acm.org/doi/10.5555/998680.1006718
Puente VGregorio JVallejo FBeivide R(2004)ImmunetACM SIGARCH Computer Architecture News10.1145/1028176.100671832:2(198)Online publication date: 2-Mar-2004
https://dl.acm.org/doi/10.1145/1028176.1006718
Puente VGregorio JVallejo FBeivide R(2004)Immunet: a cheap and robust fault-tolerant packet routing mechanismProceedings. 31st Annual International Symposium on Computer Architecture, 2004.10.1109/ISCA.2004.1310775(198-209)Online publication date: 2004
https://doi.org/10.1109/ISCA.2004.1310775
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Fault-Tolerant Meshes with Small Degree

Superconnected and Hyperconnected Small Degree Transitive Graphs

Connected subgraphs with small degree sums in 3-connected planar graphs

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Index Terms

Recommendations

Fault-Tolerant Meshes with Small Degree

Superconnected and Hyperconnected Small Degree Transitive Graphs

Connected subgraphs with small degree sums in 3-connected planar graphs

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations