Design and performance of multipath MIN architectures

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Design and performance of multipath MIN architectures

Full text

Pdf (1.05 MB)

Source

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

San Diego, California, United States

Pages: 286 - 295

Year of Publication: 1992

ISBN:0-89791-483-X

Authors

Frederic T. Chong
Thomas F. Knight, Jr.

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 10, Citation Count: 2

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/140901.141890 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.

	ALM90	S. Arora , T. Leighton , B. Maggs, On-line algorithms for path selection in a nonblocking network, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.149-158, May 13-17, 1990, Baltimore, Maryland, United States [doi>10.1145/100216.100232]
	BP74	L.A. Bassalygo and M. S. Pinsker. Complexity of optimum nonblocking switching networks without reconnections. Problems of Information Transmission, 9:64-66, 1974.
	CED92	Frederic Chong, Eran Egozy, and Andr6 DeHon. Fault tolerance and performance of multipath multistage interconnection networks. In Thomas F. Knight Jr. and John Savage, editors, Advanced Research in VLSI and Parallel Systems 1992, pages 227-242. MIT Press, March 1992.
	CFKA90	David Chaiken , Craig Fields , Kiyoshi Kurihara , Anant Agarwal, Directory-Based Cache Coherence in Large-Scale Multiprocessors, Computer, v.23 n.6, p.49-58, June 1990 [doi>10.1109/2.55500]
	Com90	IEEE Standards Committee. IEEE Standard Test Access Port and Boundary-Scan Architecture. IEEE, 345 East 47th Street, New York, NY 10017-2394, July 1990. IEEE Std 1149.1-1990.
	CS82	L. Ciminiera and A. Serra. A fault-tolerant connecting network for multiprocessor systems. In Proceedings of the 1982 International Conference on Parallel Processing, pages 113-122. IEEE, August 1982.
	D+92	William J. Dally , J. A. Stuart Fiske , John S. Keen , Richard A. Lethin , Michael D. Noakes , Peter R. Nuth , Roy E. Davison , Gregory A. Fyler, The Message-Driven Processor: A Multicomputer Processing Node with Efficient Mechanisms, IEEE Micro, v.12 n.2, p.23-39, March 1992 [doi>10.1109/40.127581]
	DeH90	Andr6 DeHon. MBTA: Modular bootstrapping transit architecture. Transit Note 17, M1T Artificial Intelligence Laboratory, April 1990.
	DeH91a	André DeHon, Practical schemes for fat-tree network construction, Proceedings of the 1991 University of California/Santa Cruz conference on Advanced research in VLSI, p.307-322, April 1991
	DeH91b	Andr6 DeHon. RN2 proposal. Transit Note 44, MIT Artificial Intelligence Laboratory, April 1991.
	DeH92	Andr6 DeHon. Using IEEE-1149 TAP in a faulttolerant architecture. Transit Note 60, MIT Artificial Intelligence Laboratory, January 1992.
	DKM91	Andr6 DeHon, Thomas F. Knight Jr., and Henry Minsky. Fault-tolerant design for multistage routing networks. In International Symposium on Shared Memory Multiprocessing. Information Processing Society of Japan, April 1991.
	JA92	Kirk L. Johnson, The impact of communication locality on large-scale multiprocessor performance, Proceedings of the 19th annual international symposium on Computer architecture, p.392-402, May 19-21, 1992, Queensland, Australia
	Lei85	Charles E. Leiserson, Fat-trees: universal networks for hardware-efficient supercomputing, IEEE Transactions on Computers, v.34 n.10, p.892-901, Oct. 1985
	Len88	Daniel E. Lenoski. A highly integrated, fault-tolerant minicomputer: The nonstop CLX. In Digest of Papers-Compcon Spring 88: Intellectual Leverage, pages 515-519, San Francisco, California, February 1988. IEEE.
	LLM90	Tom Leighton, Derek Lisinski, and Bruce Maggs. Empirical evaluation of randomly-wired multistage networks. In international Conference on Computer Design: VLSI in Computers and Processors. IEEE, 1990.
	LM89	Tom Leighton and Bruce Maggs. Expanders might be practical: fast algorithms for routing around faults on multibutterflies. In IEEE 30th Annual Symposium on Foundations of Computer Science, 1989.
	LM92	F. Thomson Leighton , Bruce M. Maggs, Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks, IEEE Transactions on Computers, v.41 n.5, p.578-587, May 1992 [doi>10.1109/12.142684]
	MDK91	Henry Minsky, Andr6 DeHon, and Thomas F. Knight jr. RNI: Low-latency, dilated, crossbar router. In Hot Chips Symposium iii, 1991.
	RK84	S.M. Reddy and V.P. Kumar. On fault-tolerant multistage interconneetion networks. In Proceedings of the 1984 International Conference on Parallel Process- /rig, pages 155-165. IEEE, August 1984.
	SW89	A. P. Sistla , J. L. Welch, Efficient distributed recovery using message logging, Proceedings of the eighth annual ACM Symposium on Principles of distributed computing, p.223-238, June 1989, Edmonton, Alberta, Canada [doi>10.1145/72981.72997]
	SY85	Rob Strom , Shaula Yemini, Optimistic recovery in distributed systems, ACM Transactions on Computer Systems (TOCS), v.3 n.3, p.204-226, Aug. 1985 [doi>10.1145/3959.3962]
	Thi91	Thinking Machines Corporation, Cambridge, MA. CM5 Technical Summary, October 1991.
	Upf89	E. Upfal, An O(logN) deterministic packet routing scheme, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.241-249, May 14-17, 1989, Seattle, Washington, United States [doi>10.1145/73007.73030]
	VR88	A. Varma and B.D. Rathi. A fault-tolerant routing scheme for unique-path multistage interconnnection networks. Technical Report IBM RC 13441, IBM Research Center, Yorktown Heights, NY, January 1988.
	Web90	Steve Webber. The Stratus architecture. Stratus Technical Report TR-1, Status Computer, Inc., 55 Fairbanks Blvd., Marlboro, Massachusetts 01752, 1990.

CITED BY 2

	Eric A. Brewer , Frederic T. Chong , Tom Leighton, Scalable expanders: exploiting hierarchical random wiring, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.144-152, May 23-25, 1994, Montreal, Quebec, Canada
	A. DeHon , F. Chong , M. Becker , E. Egozy , H. Minsky , S. Peretz , T. F. Knight, Jr., METRO: a router architecture for high-performance, short-haul routing networks, ACM SIGARCH Computer Architecture News, v.22 n.2, p.266-277, April 1994