MAPPING TREE-STRUCTURED COMPUTATIONS ONTO MESH-CONNECTED ARRAYS OF PROCESSORS

References

• H. Bokhari , On the mapping problems , IEEE Transactions on Computers C-30 ( Mar. 1981 ), 207 – 214 .
   Web of Science ®Google Scholar
• S. H. Bokhari , Partitioning problems in parallel, pipelined and distributed computing , IEEE Transactions on Computers C-37 ( 1 ) ( Jan. 1988 ), 48 – 57 .
   Web of Science ®Google Scholar
• H.-A. Choi and B. Narahari , Algorithms for mapping and partitioning chain structured parallel computations , Proc. of 1991 International Conference on Parallel Processing 1 , 625 – 628 .
   Google Scholar
• H. Gazit , G. L. Miller and S.-H. Teng , Optimal tree contraction in EREW model , S. R. Tewsburg , B. W. Dickinson and S. C. Sehwartz (eds.), Concurrent Computations , 139 – 156 , Plenum Publishing , 1988 .
   Google Scholar
• S. R. Kosaraju and A. L. Delcher , Optimal evaluation of tree-structured computations by ranking , J. Reif , ed., VLSI Algorithms and Architectures Proceedings of 1988 Aegean Workshop on Computing , 101 – 110 , Springer Verlag , 1988 , LNCS 319 .
   Google Scholar
• D. Ghosal , A. Mukherjee , R. Thurimella and Y. Yesha , Mapping task trees onto a linear array , IEEE International Conference on Parallel Processing ( 1991 ), I-629 – I-633 .
   Google Scholar
• R. Miller and Q. E. Stout , Parallel Algorithms for Regular Architectures , The MIT Press , Cambridge , MA , 1988 .
   Google Scholar
• D. Nassimi and S. Sahni , Data broadcasting in SIMD computers , IEEE Transactions on Computers C-30 ( 2 ) ( Feb. 1981 ), 101 – 107 .
   Web of Science ®Google Scholar
• J.-J. Tsay , Searching tree structures on a mesh of processors , Proc. of 3rd ACM-SIAM Annual Symposium on Discrete Algorithms , 1992 .
   Google Scholar