Communications of the ACM
Multidimensional binary search trees used for associative searching
Communications of the ACM
Programming language semantics and closed applicative languages
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Copying operands versus copying results: A solution to the problem of large operands in FFP'S
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Divide and conquer algorithms for closest point problems in multidimensional space.
Divide and conquer algorithms for closest point problems in multidimensional space.
Programming in reduction languages.
Programming in reduction languages.
Analysis of ffp programs for parallel associative searching
Analysis of ffp programs for parallel associative searching
Compiling APL for parallel execution on an FFP machine
APL '85 Proceedings of the international conference on APL: APL and the future
Data sharing in an FFP machine
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Copying operands versus copying results: A solution to the problem of large operands in FFP'S
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Compiling prolog programs for parallel execution on a cellular machine
ACM '84 Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge
| Hi-index | 0.00 |
The performance of the cellular computer proposed by Megó has been investigated by programming a number of associative search algorithms and analyzing the time and space required for their execution. The present work describes the results of three different analysis techniques applied to algorithms for nearest neighbor and closest pair problems for files of n points in k-dimensional space. Brute force methods are described for solving the nearest neighbor problem. If the initial program expression is suitably placed in memory, analysis of the most parallel brute force algorithm yields complexity results of O(k) time and O(kn) space. These bounds are shown to be asymptotically optimal with respect to the problem and the machine. Brute force, semi-parallel, and divide-and-conquer solutions are described for solving the closest pair problem. Analyses of the best semi-parallel algorithms yield complexity results of O(kn) time and space, which are shown to be asymptotically optimal.