This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Embedding Binary X-Trees and Pyramids in Processor Arrays with Spanning Buses
June 1994 (vol. 5 no. 6)
pp. 664-672

We study the problem of network embeddings in 2-D array architectures in which eachrow and column of processors are interconnected by a bus. These architectures areespecially attractive if optical buses are used that allow simultaneous access by multipleprocessors through either wavelength division multiplexing or message pipelining, thusovercoming the bottlenecks caused by the exclusive access of buses. In particular, wedefine S-trees to include both binary X-trees and pyramids, and present two embeddingsof X-trees into 2-D processor arrays with spanning buses. The first embedding has theproperty that all neighboring nodes in X-trees are mapped to the same bus in the targetarray, thus allowing any two neighbors in the embedded S-trees to communicate witheach other in one routing step. The disadvantage of this embedding is its relatively highexpansion cost. In contrast, the second embedding has an expansion cost approachingunity, but does not map all neighboring nodes in X-trees to the same bus. Theseembeddings allow all algorithms designed for binary trees, pyramids, as well as X-trees to be executed on the target arrays.

[1] S. H. Bokhari, "Finding maximum on an array processor with a global bus,"IEEE Trans. Comput., vol. C-32, no. 2, pp. 133-139, Feb. 1984.
[2] V. Cantoni and S. Levialdi, Eds.,Pyramidal Systems for Computer Vision. Berlin: Springer-Verlag, 1986.
[3] Y. C. Chen, W. T. Chen, G. H. Chen, and J. P. Sheu, "Designing efficient parallel algorithms on mesh-connected computers with multiple broadcasting,"IEEE Trans. Parallel Distrib. Syst., vol. 1, no. 2, pp. 241-245, Feb. 1990.
[4] J. Cooper and S. G. Akl, "Efficient selection on a binary tree,"Inform. Processing Lett., vol. 23, no. 3, pp. 123-126, Mar. 1986.
[5] E. Dekel and S. Sahni, "Binary trees and parallel scheduling algorithms,"IEEE Trans. Comput., vol. C-32, no. 3, pp. 307-315, Mar. 1983.
[6] A. M. Despain and D. A. Patterson, "X-tree: A tree structured multiprocessor computer architecture," inProc. Fifth Int. Symp. Comput. Architecture, Apr. 1978, pp. 144-151.Comput. Architecture, pp. 21-28, Dec. 1973.
[7] P. Dowd, "High performance interprocessor communication through optical wavelength division multiple access channels," inProc. 18th Int. Symp. Comput. Architecture, May 1991, pp. 96-105.
[8] Z. Guo and R. G. Melhem, "Embedding pyramids in array processors with pipelined buses," inProc. Int. Conf. Application Specific Array Processors, 1990, pp. 665-676.
[9] Z. Guo, R. Melhem, R. Hall, D. Chiarulli, and S. Levitan, "Array processors with pipelined optical busses,"J. Parallel Distributed Comput., vol. 12, no. 3, pp. 269-282, 1991.
[10] Z. Guo, "Sorting on array processors with pipelined buses," inProc. Int. Conf. Parallel Processing, vol. III, pp. 289-292, 1992.
[11] Z. Guo and R. G. Melhem, "Embedding binaryX-trees and pyramids in processor arrays with spanning buses," Tech. Rep. TR-EE-9208a, Dept. of Elec. Eng., Louisiana Tech Univ., 1992.
[12] J. M. Jolion and A. Rosenfeld, "AnO(logn) pyramid Hough transform,"Patt. Recognition Lett., vol. 9, pp. 343-349, May 1989.
[13] M. Karnaugh, "A map method for synthesis of combinational logic circuits,"Trans. AIEE, Commun. and Electron., vol. 72, no. 1, pp. 593-599, Nov. 1953.
[14] F. T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, and Hypercubes. Palo Alto, CA: Morgan Kaufmann, 1992.
[15] R. Melhem, D. Chiarulli, and S. Levitan, "Space multiplexing of waveguides in optically interconnected multiprocessor systems,"Comput. J., vol. 32, no. 4, pp. 362-369, 1989.
[16] V. K. Prasanna Kumar and C. S. Raghavendra, "Array processor with multiple broadcasting,"J. Parallel Distributed Comput., vol. 4, pp. 173-190, 1987.
[17] V. K. Prasanna-Kumar and D. Reisis, "Image computations on meshes with multiple broadcast,"IEEE Trans. Patt. Anal. Mach. Intell., vol. 11, pp. 1194-1202, Nov. 1989.
[18] C. Qiao and R. G. Melhem, "Reconfiguration with time division multiplexed MIN's for multiprocessor communications,"IEEE Trans. Parallel Distrib. Syst., vol. 5, pp. 337-352, Apr. 1994.
[19] Q. F. Stout, "Mesh connected computers with broadcasting,"IEEE Trans. Comput., vol. C-32, no. 9, pp. 826-830, Sept. 1983.
[20] C. D. Thompson and H. T. Kung, "Sorting on a mesh connected processor array,"Commun. ACM, pp. 263-271, 1972.
[21] T. S. Wailes and D. G. Meyer, "Multiple channel architecture: A new optical interconnection strategy for massively parallel computers,"J. Lightwave Technol., vol. 9, pp. 1702-1716, Dec. 1991.

Index Terms:
Index Termsnetwork routing; multiprocessor interconnection networks; parallel architectures; binaryX-trees; pyramids; processor arrays; spanning buses; network embeddings; 2-D arrayarchitectures; binary trees; embedding; routing step
Citation:
Z. Guo, R.G. Melhem, "Embedding Binary X-Trees and Pyramids in Processor Arrays with Spanning Buses," IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 6, pp. 664-672, June 1994, doi:10.1109/71.285613
Usage of this product signifies your acceptance of the Terms of Use.