참고문헌
- M. Hamdi, C. Qiao, Y. Pan, and J. Tong, 'Communication-efficient sorting algorithms on reconfigurable array of processors with slotted optical buses,' J. Parallel Distribut. Comput. 57, pp. 166-187, 1999 https://doi.org/10.1006/jpdc.1998.1525
- S. Pavel and S. G. Akl, 'On the power of arrays with reconfigurable optical buses,' Proc. Int'l Conf. Parallel and Distributed Processing Techniques and Applications, vol. III, 1443-1454, 1996
- S. Pavel and S. G. Akl, 'Integer sorting and routing in arrays with reconfigurable optical buses,' Proc. Int'l Conf. on Parallel Processing, vol. II, pp. 90-94, 1996 https://doi.org/10.1109/ICPP.1996.537386
- Z. Guo, 'Sorting on array processors with pipelined buses,' Proc. Int'l Conf. on Parallel Processing, vol. III, pp. 289-292, 1992
- S. Rajsekaran and S. Sahni, 'Sorting, selection and routing on the array with reconfigurable optical buses,' Technical Report, Department of Computer and Information Science, University of Florida, 1996
- R. Miller, V. K. Prasanna-Kumar, D. Reisis, and Q. F. Stout, 'Parallel computations on reconfigurable meshes,' IEEE Trans. Comput., vol. 42, no. 6, pp. 678-692, Jun. 1994 https://doi.org/10.1109/12.277290
- H. M. Alnuweiri, 'Parallel constant-time connectivity algorithms on a reconfigurable network of processors,' IEEE Trans. Parallel Distribut. Systems, vol. 6, no. 1, pp. 105-110, Jan. 1995 https://doi.org/10.1109/71.363405
- E. Dekel and S. Sahni, 'Parallel generation of postfix and tree forms,' ACM Trans. Programming Languages and Systems 5, pp. 300-317, 1983 https://doi.org/10.1145/2166.357211
- I. Bar-On and U. Vishkin, 'Optimal parallel generation of a computation tree form,' ACM Trans. Programming Languages and Systems 7, pp. 384-357, 1985 https://doi.org/10.1145/3318.3478
- W. W. Tsang, T. W. Lam, and F. Y. L. Chin, 'An optimal EREW parallel algorithm for parenthesis matching,' Proc. Int'l Conf. on Parallel Processing, vol. III, pp. 185-192, 1989
-
G. H. Chen, S. Olariu, J. L. Schwing, B. F. Wang, and J. Zhang, 'Constant-time tree algorithms on reconfigurable meshes on size
$n{\times}n$ ,' J. Parallel Distribut. Comput. 26, pp. 137-150, 1995 https://doi.org/10.1006/jpdc.1995.1055 - S. G. Akl, The design and analysis of parallel algorithms, Prentice-Hall, Englewood Cliffs, NJ, 1989
- L. Bergogne and C. Cerin, 'A new parallel algorithm for the parentheses matching problem,' Proc. AIZU Int'l Symposium on Parallel Algorithms/Architecture Synthesis, pp. 364-369, 1997 https://doi.org/10.1109/AISPAS.1997.581700
- K. Diks and W. Rytter, 'On optimal parallel computations for sequence of brackets, ' Theoretical Computer Science, vol 87, pp. 251-262, Sep. 1991 https://doi.org/10.1016/0304-3975(91)90326-W
- I. Stojmenovic, 'Constant time BSR solutions to parenthesis matching, tree decoding and tree reconstruction from its traversals,' IEEE Trans. Parallel Distribut. Systems, vol. 7, no. 2, pp. 216-224 , Feb. 1996 https://doi.org/10.1109/71.485530
- D. E. Knuth, The art of computer programming: Fundamental algorithms, Addison-Wesley, Reading, MA, 1973