On the Construction of (d, k) Graphs
- 1 June 1965
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electronic Computers
- Vol. EC-14 (3) , 488
- https://doi.org/10.1109/pgec.1965.264176
Abstract
The computer organization described here is an extension of a concept of Leondes and Rubinoff [1]. The original machine consisted of a drum store and a single processor capable of sequencing its access from one track (array column) to another at the end of each drum revolution. In this way the system could process one iteration of a Laplace equation in n-drum revolutions, where n is the number of columns of the array.Keywords
This publication has 1 reference indexed in Scilit:
- Topological constraints on interconnection-limited logicPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1964