Fault-tolerant meshes with small degree

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Fault-tolerant meshes with small degree

Full text

Pdf (987 KB)

Source

ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures table of contents

Velen, Germany

Pages: 1 - 10

Year of Publication: 1993

ISBN:0-89791-599-2

Authors

Jehoshua Bruck
Robert Cypher
Ching-Tien Ho

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture
European Comp Soc : European Computer Society

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 15, Citation Count: 5

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/165231.165232 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	M. Ajtai, N. Alon, J. Bruck, R. Cypher, C.T. Ho, M. Noar and E. Szemerddi, Fault Tolerant Graphs, Perfect Hash Functions and Disjoint Paths, Proc. of 33rd Annual IEEE Syrup. on Foundations of Computer Science, pp. 693-702, 1992.
	2	F. Annexstein, Fault tolerance in hypercube-derivative networks, Proceedings of the first annual ACM symposium on Parallel algorithms and architectures, p.179-188, June 18-21, 1989, Santa Fe, New Mexico, United States [doi>10.1145/72935.72955]
	3	Vijay Balasubramanian , Prithviraj Banerjee, A fault tolerant massively parallel processing architecture, Journal of Parallel and Distributed Computing, v.4 n.4, p.363-383, August 1, 1987 [doi>10.1016/0743-7315(87)90025-6]
	4	K. E. Butcher, Design of a Massively Parallel Processor, IEEE Trans. on Computers, vol. C-29, no. 9, pp. 836- 840, September 1980.
	5	C. Berge, Graphs, page 218, a Theorem attributed to Moon, North-Holland, 1985.
	6	J. Bruck, R. Cypher and C.-T. Ho, Fault-Tolerant Meshes with Minimal Numbers of Spares, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, pp. 288-295, Dallas TX, December 1991.
	7	J. Bruck, R. Cypher and C.-T. Ho, Efficient Fault- Tolerant Mesh and Hypercubes Architectures, Proceedings of the 1992 International Symposium on Fanlt- Tolerant Computing, pp. 162-169.
	8	3. Bruck, R. Cypher and C.-T. Ho, Fault-Tolerant de Bruijn and Shuffle-Ezchange Networks, Proceedings of the 1992 International Conference on Parallel Processing, pp. 46-50, Vol. IiI, St. Charles, IL, August 1992.
	9	J. Bruck, R. Cypher and C.-T. Ho, Tolerating Faults in a Mesh with a Row of Spare Nodes, Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, pp. 12-19, Dallas TX, December 1992.
	10	J. Bruck , R. Cypher , D. Soroker, Running algorithms efficiently on faulty hypercubes, Proceedings of the second annual ACM symposium on Parallel algorithms and architectures, p.37-44, July 02-06, 1990, Island of Crete, Greece [doi>10.1145/97444.97455]
	11	Shantanu Dutt , J. P. Hayes, On Designing and Reconfiguring k-Fault-Tolerant Tree Architectures, IEEE Transactions on Computers, v.39 n.4, p.490-503, April 1990 [doi>10.1109/12.54842]
	12	Shantanu Dutt , John P. Hayes, Designing fault-tolerant systems using automorphisms, Journal of Parallel and Distributed Computing, v.12 n.3, p.249-268, July 1991 [doi>10.1016/0743-7315(91)90129-W]
	13	S. Dutt and :I. P. Hayes, Some Practical issues in the Design of Fault-Tolerant Multiprocessors, Proceedings of the 21st International Symposium on Fault-Tolerant Computing, pp. 292-299, June 1991.
	14	J. Hastad , T. Leighton, Fast computation using faulty hypercubes, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.251-263, May 14-17, 1989, Seattle, Washington, United States [doi>10.1145/73007.73031]
	15	J. P. Hayes, A Graph Model for Fault-Tolerant Computing Systems, IEEE Trans. on Computers, vol. C-25, no. 9, pp. 875-884, September 1976.
	16	C. Kaklamanis, A. R. Karlin, F. T. Leighton, V. Milenkovic, P. Raghavan, S. Rao, C. Thomborson and A. Tsantilaz, A symptoticall!t Tight Bounds for Computing with Faulty Arrays of Processors, Proc. of 31st Annum IEEE Syrup. on Foundations of Computer Science, pp. 285-296, October 1990.
	17	S.-Y. Kuo and W. K. Fuchs, E#cient Spare Allocation for Reconfigurable Arrays, IEEE Design and Test, pp. 24-31, February 1987.
	18	T. Leighton and C. E. Leiserson, Wafer Scale integra. tion of S#/stolic Arra#ts, IEEE Trans. on Computers, vol. C-34, no. 5, pp. 448--461, May 1985.
	19	T. Leighton, B. Ma#gs #nd R. Sitar#man, On the Fault Tolerance o} Some Popular Bounded.Degree Networks, Proc. of 33rd Annum IEEE Syrup. on Foundations of Computer Science, pp. 542-552, 1992.
	20	M. Paoli, W. W. Wong and C. K. Wong, Minimum k- Hamiltonian Graphs, II, J. of Graph Theory, Vol. 10, pp. 79-95, 1986.
	21	A. L. Rosenberg, The Diogenes Approach to Testable Fault. Tolerant VLSI Processor Arrays, IEEE Trans. on Computers, Vol. C-32, no. 10, pp. 902-910, October 1983.
	22	V. P. Roychowdhury , Jehoshua Bruck , Thomas Kailath, Efficient Algorithms for Reconfiguration in VLSI/WSI Arrays, IEEE Transactions on Computers, v.39 n.4, p.480-489, April 1990 [doi>10.1109/12.54841]
	23	W. W. Wong and C. K. Woag, Minimum k- Hamiltonian Graphs, :1. of Graph Theory, Vol. 8, pp. 155-165, 1984.

CITED BY 5

	Richard Cole , Bruce Maggs , Ramesh Sitaraman, Multi-scale self-simulation: a technique for reconfiguring arrays with faults, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.561-572, May 16-18, 1993, San Diego, California, United States
	Hisao Tamaki, Construction of the mesh and the torus tolerating a large number of faults, Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures, p.268-277, June 27-29, 1994, Cape May, New Jersey, United States
	Baback A. Izadi , Füsun Özgüner, Enhanced Cluster k-Ary n-Cube, A Fault-Tolerant Multiprocessor, IEEE Transactions on Computers, v.52 n.11, p.1443-1453, November 2003
	Shantanu Dutt , Nihar R. Mahapatra, Node-covering, Error-correcting Codes and Multiprocessors with Very High Average Fault Tolerance, IEEE Transactions on Computers, v.46 n.9, p.997-1015, September 1997
	Saina Jalili , Ali Movaghar , Maryam Sadrmousavi, An improved replacement algorithm in fault-tolerant meshes, Proceedings of the 2007 summer computer simulation conference, July 16-19, 2007, San Diego, California