Study of parallelism in regular iterative algorithms
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
An efficient procedure for the generation of closed subsets
Communications of the ACM
A system for network picture processing with interactive computer graphics
ACM '69 Proceedings of the 1969 24th national conference
| Hi-index | 0.03 |
An iterative array is defined as an infinite set of identical blocks, interconnected in a regular manner. Each block has inputs and outputs, with internal connections from certain inputs to certain outputs. This paper is concerned with the problem of determining, for a given structure internal to each block, the existence of a given path. The path is specified by the relative positions in the array of its endpoints, and the algorithm presented decides whether such a path is possible in the given array. A special case of the general procedure, which tests for a closed path, has been successfully programmed.