The Community for Technology Leaders
Green Image
A conflict-free routing scheme is presented for a class of parallel and distributed computing systems. The core of the scheme is a quadtree communication structure. The quadtree structure suggests a general approach to mapping a class of parallel algorithms with intensive communication requirements for selecting data from many different sources and distributing data from a single source. By pro
parallel computing systems; conflict-free routing scheme; multistage interconnection networks; distributed computing systems; quadtree communication structure; mapping; parallel algorithms; tree levels; response time; distributed processing; multiprocessor interconnection networks; parallel algorithms.
T.-Y. Feng, W. Lin, T.-L. Sheu, C.-L. Wu, C.R. Das, "A Conflict-Free Routing Scheme on Multistage Interconnection Networks", IEEE Transactions on Computers, vol. 38, no. , pp. 1086-1097, August 1989, doi:10.1109/12.30864
84 ms
(Ver 3.3 (11022016))