A Symmetric Tree Structure Interconnection Network and its Message Traffic

Woo, Nam-Sung; Agrawala,

doi:10.1109/tc.1985.1676626

IEEE Trans. Comput.

1985

DOI: 10.1109/tc.1985.1676626

|View full text |Cite

A Symmetric Tree Structure Interconnection Network and its Message Traffic

Nam-Sung Woo

Agrawala Agrawala

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1987

1995

Publication Types

Select...

Article5

Relationship

Self Cite0

Independent5

Authors

Journals

Cited by 6 publications

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Construction of large‐size interconnection networks with high performance

Shen

Back

1993

Networks

View full text Add to dashboard Cite

This paper proposes a new method, recursive expansion (RE), for systematically constructing interconnection networks of arbitrary large size with high performance. On the basis of two small-size networks, a frame and a unit, the RE method works in a manner of recursively replacing each node in the frame with an expanded network containing a set of copies of the unit and each edge in the frame with a set of interunit connections connecting a pair of the networks until a network of the desired size has been obtained. By RE, we can construct various kinds of large-size and low-cost interconnection networks. Two applications of the method, the Sf network based on the torus and the Sef network based on the hypercube, show that our method can produce networks with cost O((log32n)l(log32 log n)) (degree O(1)) and O(log n log log n) (degree O(log log n)). In addition to low cost, networks constructed by RE also possess other properties such as high constructability, good extendability, symmetric topology, and efficient message routing. This paper describes an algorithm, for automatically constructing arbitrary large size networks with high performance. For constructing a network of size n, through r phases RE on the basis of a frame of degree d, and a unit of size nu and degree d,, the algorithm has a time complexity O((max((d,/n,), (d,,/f)})fnf). Finally, a routing algorithm for networks constructed by RE is presented. The routing algorithm can realize point-to-point message routing without using a global routing table at each node and has a time

show abstract

Construction of large‐size interconnection networks with high performance

Shen

Back

1993

Networks

View full text Add to dashboard Cite

show abstract

Construction of large-size interconnection networks with high performance

Shen

Back

1992

Microprocessing and Microprogramming

View full text Add to dashboard Cite

On synthesizing cube and tree for parallel processing

Basu

Dattagupta

1995

Microprocessing and Microprogramming

View full text Add to dashboard Cite

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

A Symmetric Tree Structure Interconnection Network and its Message Traffic

Cited by 6 publications

References 8 publications

Construction of large‐size interconnection networks with high performance

Construction of large‐size interconnection networks with high performance

Construction of large-size interconnection networks with high performance

On synthesizing cube and tree for parallel processing

Contact Info

Product

Resources

About