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

Authors:
Shi-Kuo Chang
Affiliations:
Instituite of Mathematics, Academia Sinica
Venue:
IEEE Transactions on Computers
Year:
1973

Citing 7
Cited 1

An Adaptation of the Fast Fourier Transform for Parallel Processing

Journal of the ACM (JACM)
Organization of Large Scale Fourier Processors

Journal of the ACM (JACM)
On the parallel computation of local operations

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
The ILLIAC IV Computer

IEEE Transactions on Computers
Iterative circuit computers

IRE-AIEE-ACM '60 (Western) Papers presented at the May 3-5, 1960, western joint IRE-AIEE-ACM computer conference
An associative parallel processor with application to picture processing

AFIPS '65 (Fall, part I) Proceedings of the November 30--December 1, 1965, fall joint computer conference, part I
Computer organization for array processing

AFIPS '65 (Fall, part I) Proceedings of the November 30--December 1, 1965, fall joint computer conference, part I

Parallel Balancing of Binary Search Trees

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

Abstract

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.