The Computation of Window Operations on a Parallel Organized Computer—A Case Study

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. Copyright © 1973 by The Institute of Electrical and Electronics Engineers, Inc.