By Topic

Embedding binary trees in arrays with optical buses

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yousong Mei ; Dept. of Electr. & Comput. Eng., State Univ. of New York, Buffalo, NY, USA ; Chunming Qiao

Optical bus based architectures have received much attention lately, and how to take advantage of the unique communication capabilities of such architectures in application development needs to be demonstrated. In this paper we first describe an embedding of a binary tree into a Reconfigurable Array with Spanning Optical Buses (or RASOB), which achieves a near minimal expansion cost. We then describe an embedding of a large binary tree into a small RASOB, which achieves a near optimal load balance. In both embeddings, all packet transfers between parents and children in the binary trees can be accomplished in one bus cycle, which implies that the embeddings achieve an optimum dilation cost of 1.

Published in:

Massively Parallel Processing Using Optical Interconnections, 1997., Proceedings of the Fourth International Conference on

Date of Conference:

22-24 June 1997