On the computational equivalence of hypercube-derived networks

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On the computational equivalence of hypercube-derived networks

Full text

Pdf (1.06 MB)

Source

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

Island of Crete, Greece

Pages: 388 - 397

Year of Publication: 1990

ISBN:0-89791-370-1

Author

E. Schwabe

Department of Mathematics and Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA

Sponsors

IEEE-CS : Computer Society
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture
CTI : Computer Technology Inst.
EATCS : European Association for Theoretical Computer Science
Computer Tech Inst. : Computer Technology Institute

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 9, Citation Count: 8

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/97444.97706 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	Fred Annexstein , Marc Baumslag , Arnold L. Rosenberg, Group action graphs and parallel architectures, SIAM Journal on Computing, v.19 n.3, p.544-569, June 1990 [doi>10.1137/0219037]
	2	V. E. Benes. "Optimal Rearrangeable Multistage Connecting Networks." Bell System Technical Journal, Vol. 43, 1964. pp. 1641-1656.
	3	D. S. Greenberg, L. S. Heath and A. L. Rosenberg. "Optimal embeddings of butterfly-like graphs in the hypercube." Math. Syst. Th., 1990. To appear.
	4	R. Koch , T. Leighton , B. Maggs , S. Rao, Work-preserving emulations of fixed-connection networks, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.227-240, May 14-17, 1989, Seattle, Washington, United States [doi>10.1145/73007.73029]
	5	C. P. Kruskal , M. Snir, A Unified theory of interconnection network structure, Theoretical Computer Science, v.48 n.1, p.75-94, Dec., 1986
	6	F. P. Preparata and J. E. VuiUemin. "The Cube-Connected Cycles: A Versatile Network for Parallel Computation." Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science, 1979. pp. 140-147.
	7	A. Raghunathan and H. Saran. "Is the shuffleexchange better than the butterfly?" Unpubfished manuscript.
	8	H. J. Siegel. "Interconnection Networks for Large-Scale Parallel Processing." Tutorial for 1986 International Conference on Parallel Processing.

CITED BY 8

	Hisao Tamaki, Robust bounded-degree networks with small diameters, Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, p.247-256, June 29-July 01, 1992, San Diego, California, United States
	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
	Christos Kaklamanis , Danny Krizanc , Satish Rao, New graph decompositions and fast emulations in hypercubes and butterflies, Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures, p.325-334, June 30-July 02, 1993, Velen, Germany
	Friedhelm Meyer auf der Heide , Martin Storch , Rolf Wanka, Optimal trade-offs between size and slowdown for universal parallel networks, Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures, p.119-128, June 24-26, 1995, Santa Barbara, California, United States
	E. J. Schwabe, A Benes-Like Theorem for the Shuffle-Exchange Graph, IEEE Transactions on Computers, v.41 n.12, p.1627-1630, December 1992
	Kevin J. Rappoport, On the slowdown of efficient simulations of multibutterflies on butterflies and butterfly-derived networks, Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures, p.176-182, June 24-26, 1996, Padua, Italy
	William Aiello , Sandeep N. Bhatt , Fan R.K. Chung , Arnold L. Rosenberg , Ramesh K. Sitaraman, Augmented Ring Networks, IEEE Transactions on Parallel and Distributed Systems, v.12 n.6, p.598-609, June 2001
	Feng-Hsu Wang , Ferng-Ching Lin, On Routing Maskable Messages in Hypercube-Derived Multistage Interconnection Networks, IEEE Transactions on Parallel and Distributed Systems, v.8 n.3, p.285-291, March 1997