Skip to main content
Conference Proceedings

The hyperplane method for an array computer

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1975) 24 LNCS 113-131
DOI: 10.1007/3-540-07135-0_114
4Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Techniques are described for implementing the hyperplane method for an array computer with a limited form of memory-processor interconnection, such as the Illiac IV. A new pipelined hyperplane method is introduced. It is useful for compiling a convergent iterative computation, if the computation is programmed with a non-deterministic end of loop test.

Cite

CITATION STYLE

APA

Lamport, L. (1975). The hyperplane method for an array computer. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 24 LNCS, pp. 113–131). Springer Verlag. https://doi.org/10.1007/3-540-07135-0_114

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free