论文信息 - On Multidimensional Arrays of Processors

On Multidimensional Arrays of Processors

An investigation is conducted of the relationship between a rectangular mesh and a square one. Asymptotically optimal algorithms are given for simulating one type by the other. The simulation results are useful since they permit designing algorithms on one network (e.g. the square mesh) in spite of the fact that the actual machine on which these algorithms will run is different (e.g. a rectangular mesh). >

Mikhail J. Atallah

[1] Sartaj Sahni,et al. Data broadcasting in SIMD computers , 1981, IEEE Transactions on Computers.

[2] Mikhail J. Atallah,et al. Graph Problems on a Mesh-Connected Processor Array , 1984, JACM.

[3] Arnold L. Rosenberg,et al. On Embedding Rectangular Grids in Square Grids , 1982, IEEE Transactions on Computers.

[4] H. T. Kung,et al. Sorting on a mesh-connected parallel computer , 1976, STOC '76.

[5] Mikhail J. Atallah,et al. Optimal simulations between mesh-connected arrays of processors , 1986, STOC '86.

[6] S. Rao Kosaraju,et al. Fast parallel processing array algorithms for some graph problems(Preliminary Version) , 1979, STOC.

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

[8] Sartaj Sahni,et al. Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer , 1980, SIAM J. Comput..

[9] Sartaj Sahni,et al. Optimal BPC Permutations on a Cube Connected SIMD Computer , 1982, IEEE Transactions on Computers.

[10] Mikhail J. Atallah,et al. Solving tree problems on a mesh-connected processor array , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).