Efficient simulations of simple models of parallel computation by time-bounded ATM's and space-bounded TM's

  • Jik H. Chang
  • Oscar H. Ibarra
  • Michael A. Palis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 317)


We present efficient time-bounded ATM and space-bounded TM simulations of one-way conglomerates (OWC's), which are interconnected networks of finite-state machines that allow only one-way communication between adjacent nodes. In particular, we show that OWC's with depth D(n) and operating in time T(n) can be simulated by ATM's in time O(D(n) · log T(n)) (and hence by a TM with the same amount of space). This extends Ruzzo's result that boolean circuits of depth D(n) can be simulated by O(D(n))-time bounded ATM's, and refines Goldschlager's result that two-way conglomerates operating in T(n) time can be simulated by T(n)-space bounded TM's. By exploiting the regularity of interconnections in some OWC's, we obtain more efficient space-bounded TM simulations. For example, using the ATM result, a k-dimensional one-way mesh array of n k -nodes would require n2 space on a TM (such an array can run in c n time in the worst case). We show that the space can be reduced to n2−1/k.


Input Node Combinational Circuit Boolean Circuit Input Tape Full Binary Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [ATAL85]
    Atallah, M. and S. Kosaraju, A generalized dictionary machine for VLSI, IEEE Transactions on Computers C-34, 2 (1985), pp. 151–155.Google Scholar
  2. [CHAN81]
    Chandra, A, D. Kozen and L. Stockmeyer, Alternation, Journal of the Association for Computing Machinery, 28-1 (1981), pp. 114–133.Google Scholar
  3. [CHAN85]
    Chang, J., O. Ibarra, and M. Palis, Efficient simulations of simple models of parallel computation by space-bounded TMs and time-bounded alternating TMs, Computer Science Department, University of Minnesota, Tech. Rep. TR 85-47, November 1985.Google Scholar
  4. [CHAN86]
    Chang, J., O. Ibarra, and A. Vergis, On the power of one-way communication, Proc. IEEE 27th Ann. Symp. on Foundations of Computer Science, pp. 455–464, Toronto, Canada, 1986; also to appear in Journal of the Association for Computing Machinery.Google Scholar
  5. [CHAN87]
    Chang, J., M. Chung, O. Ibarra, and K. Rao, Systolic tree implementations of data structures, Proc. International Conference on Parallel Processing, pp. 669–671, St. Charles, Ill., 1986; also to appear in IEEE Transactions on Computers.Google Scholar
  6. [CHIA84]
    Chiang, Y. and K. Fu, Parallel parsing and VLSI implementations for syntactic pattern recognition, IEEE Transactions on Pattern Analysis and Machine Intelligence, 6, 3 (1984), pp. 302–313.Google Scholar
  7. [COLE69]
    Cole, S., Real-time computation by n-dimensional iterative arrays of finite-state machines, IEEE Transactions on Computers C-18, 4 (1969), pp. 346–365.Google Scholar
  8. [CULI84]
    Culik II, K. and S. Yu, Iterative tree automata, Theoretical Computer Science 32 (1984), pp. 227–247.Google Scholar
  9. [CULI86]
    Culik II, K., O. Ibarra, and S. Yu, Iterative tree arrays with logarithmic depth, International Journal of Computer Mathematics 20 (1986), pp. 187–204.Google Scholar
  10. [DYER81]
    Dyer, C. and A. Rosenfeld, Triangle cellular automata, Information and Control 48 (1981), pp. 54–69.Google Scholar
  11. [GOLD82]
    Goldschlager, L., A universal interconnection pattern for parallel computers, Journal of the Association for Computing Machinery, 29-4 (1982), pp. 1073–1086.Google Scholar
  12. [GUIB79]
    Guibas, L., H. Kung, and C. Thompson, Direct VLSI implementation of combinatorial algorithms, Proc. of Caltech Conference on VLSI, (1979), pp. 509–525.Google Scholar
  13. [HENN81]
    Hennie, F., III. Iterative Arrays of Logic Circuits, MIT Press, Cambridge, Mass., 1981.Google Scholar
  14. [HOPC79]
    Hopcroft, J., and J. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Mass., 1979.Google Scholar
  15. [IBAR85]
    Ibarra, O., S. Kim, and S. Moran, Sequential machine characterizations of trellis and cellular automata and applications, SIAM Journal on Computing 14 (1985), pp. 426–447.Google Scholar
  16. [IBAR86]
    Ibarra, O., S. Kim, and M. Palis, Designing systolic algorithms using sequential machines, IEEE Transactions on Computers, C-35:6 (June 1986), pp. 531–542.Google Scholar
  17. [IBAR87]
    Ibarra, O. and T. Jiang, On iterative and cellular tree arrays, Technical Report, University of Minnesota, 1987, submitted to Journal of Computer and Systems Sciences.Google Scholar
  18. [KOSA74]
    Kosaraju, S., On some open problems in the theory of cellular automata, IEEE Transactions on Computers C-23 (1974), pp. 561–565.Google Scholar
  19. [KOSA75]
    Kosaraju, S., Speed of recognition of context-free languages by array automata, SIAM Journal on Computing, 4-3 (1975), pp. 331–340.Google Scholar
  20. [RUZZ80]
    Ruzzo, W., Tree-size bounded alternation, Journal of Computer and Systems Sciences 21 (1980), pp. 218–235.Google Scholar
  21. [RUZZ81]
    Ruzzo, W., On uniform circuit complexity, Journal of Computer and Systems Sciences 22 (1981), pp. 365–383.Google Scholar
  22. [SEIF77]
    Seiferas, J., Iterative arrays with direct central control, Acta Informatica 8 (1977), pp. 177–192.Google Scholar
  23. [SOMA85]
    Somani, A. and Agarwal, V., An efficient unsorted VLSI dictionary machine, IEEE Transactions on Computers C-34, 9 (1985), pp. 841–852.Google Scholar
  24. [STOC84]
    Stockmeyer, L. and U. Vishkin, Simulation of parallel random-access machines by circuits, SIAM Journal on Computing, 13-2 (1984), pp. 409–422.Google Scholar
  25. [TRAH86]
    Trahan, J. L., Simulations among multidimensional iterative arrays, iterative tree automata, and alternating Turing machines, University of Ilinois, Coordinated Science Laboratory, Technical Report UILU-ENG-86-2202 ACT-66, January 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Jik H. Chang
    • 1
  • Oscar H. Ibarra
    • 2
  • Michael A. Palis
    • 3
  1. 1.Department of Computer ScienceSogang UniversitySeoulSouth Korea
  2. 2.Department of Computer ScienceUniversity of MinnesotaMinneapolis
  3. 3.Department of Computer and Information ScienceUniversity of PennsylvaniaPhiladephia

Personalised recommendations