On the Construction of (d, k) Graphs
Sheldon B. Akers · IEEE Transactions on Electronic Computers · 1965
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.