Network Implementations of the DTEP Algorithm

Abstract : The dynamic tree expression problem (DTEP) was defined in (Ma87). In this paper, efficient implementations of the DTEP algorithm are developed for the hypercube, butterfly, perfect shuffle and multi-dimensional mesh of trees families of networks.

[1]  Ernst W. Mayr,et al.  The Dynamic Tree Expression Problem , 1988 .

[2]  Sartaj Sahni,et al.  Parallel Matrix and Graph Algorithms , 1981, SIAM J. Comput..

[3]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[4]  Leslie M. Goldschlager,et al.  A Space Efficient Algorithm for the Monotone Planar Circuit Value Problem , 1980, Information Processing Letters.

[5]  Jeffrey D. Ullman,et al.  Parallel complexity of logical query programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[6]  Sartaj Sahni,et al.  Binary Trees and Parallel Scheduling Algorithms , 1981, IEEE Transactions on Computers.

[7]  Michael J. Flynn,et al.  Very high-speed computing systems , 1966 .

[8]  Gary L. Miller,et al.  Parallel tree contraction and its application , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[9]  Jeffrey D Ullma.  Computational Aspects of VLSI , 1984 .

[10]  Walter L. Ruzzo,et al.  Tree-size bounded alternation(Extended Abstract) , 1979, J. Comput. Syst. Sci..