Issue No.01 - January (1973 vol.22)
null Shi-Kuo Chang , Instituite of Mathematics, Academia Sinica
The computation of window operations and arbitrary local operations on a parallel organized computer is studied. It is shown that for the window operations, the computation time can be minimized, subject to the restriction of memory accessibility. It is also shown that the computation time increases as the degree of disorderliness of a local operation increases.
Computer organization, local operation, parallel computation, parallel organized computer, picture processing.
null Shi-Kuo Chang, "The Computation of Window Operations on a Parallel Organized Computer?A Case Study", IEEE Transactions on Computers, vol.22, no. 1, pp. 34-40, January 1973, doi:10.1109/T-C.1973.223598