Two-Dimensional Iterative Arrays: Characterizations and Applications

We analyse some properties of two-dimensional iterative and cellular arrays. For example, we show that arrays operating in T(n) time can be sped up to operate in time n+(T(n)−n)k. Thus, a running time of the form n+R(n), where R(n) is sublinear (e.g., log n, log∗n, etc.), can still be sped up to n+R(n)k. This type of speed-up is stronger than any previously known speed-up for any type of device. Even for Turing machines, the speed-up is only from T(n) to n+T(n)k. Another interesting result is that simultaneous space-reduction and speed-up is possible, i.e., the number of processors of the array can be reduced while simultaneously speeding up its computation. Unlike previous approaches, we carry out our analyses using sequential machine characterizations of the iterative and cellular arrays. Consequently, we are able to prove our results on the much simpler sequential machine models.

[1]  Dan I. Moldovan,et al.  Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays , 1986, IEEE Transactions on Computers.

[2]  Peter R. Cappello,et al.  Unifying VLSI Array Designs with Geometric Transformations , 1983, International Conference on Parallel Processing.

[3]  R G Melhem Verification of a Class of Deadlock-Free, Self-Timed, Computational Arrays. , 1984 .

[4]  Hiroshi Umeo,et al.  Deterministic One-Way Simulation of Two-Way Real-Time Cellular Automata and Its Related Problems , 1982, Inf. Process. Lett..

[5]  S. Rao Kosaraju Speed of Recognition of Context-Free Languages by Array Automata , 1975, SIAM J. Comput..

[6]  Charles R. Dyer,et al.  One-Way Bounded Cellular Automata , 1980, Inf. Control..

[7]  Oscar H. Ibarra,et al.  Parallel Parsing on a One-Way Array of Finite-State Machines , 1987, IEEE Transactions on Computers.

[8]  Benjamin W. Wah,et al.  The Design of Optimal Systolic Arrays , 1985, IEEE Transactions on Computers.

[9]  P. Quinton Automatic synthesis of systolic arrays from uniform recurrent equations , 1984, ISCA 1984.

[10]  Stephen N. Cole Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines , 1969, IEEE Trans. Computers.

[11]  S. Rao Kosaraju On Some Open Problems in the Theory of Cellular Automata , 1974, IEEE Transactions on Computers.

[12]  Danny Cohen,et al.  A mathematical approach to modelling the flow of data and control in computational networks , 1981 .

[13]  Al Davis,et al.  A Wavefront Notation Tool for VLSI Array Design , 1981 .

[14]  N. H. Chein EBE: a language for specifying the expected behavior of programs during debugging , 1977 .

[15]  Oscar H. Ibarra,et al.  Some results concerning linear iterative (systolic) arrays , 1985, J. Parallel Distributed Comput..

[16]  D.I. Moldovan,et al.  On the design of algorithms for VLSI systolic arrays , 1983, Proceedings of the IEEE.

[17]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[18]  Alvy Ray Smith,et al.  Real-Time Language Recognition by One-Dimensional Cellular Automata , 1972, J. Comput. Syst. Sci..

[19]  Nicholas Pippenger,et al.  On simultaneous resource bounds , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[20]  Alvy Ray Smith,et al.  Cellular Automata Complexity Trade-Offs , 1971, Inf. Control..

[21]  Oscar H. Ibarra,et al.  Designing Systolic Algorithms Using Sequential Machines , 1984, FOCS.

[22]  Cauligi S. Raghavendra,et al.  Gracefully Degradable Processor Arrays , 1985, IEEE Transactions on Computers.

[23]  H. T. Kung Why systolic architectures? , 1982, Computer.

[24]  Charles E. Leiserson,et al.  Area-Efficient VLSI Computation , 1983 .

[25]  H. T. Kung Let's Design Algorithms for VLSI Systems , 1979 .

[26]  Karel Culik,et al.  Topological Transformations as a Tool in the Design of Systolic Networks , 1985, Theor. Comput. Sci..