On 30/12/16 17:49, Paul Koning wrote:
The Dutch computer ARMAC had a nice optimization, a track buffer. Under software control a given track would be copied to that buffer (in some sort of RAM -- core?) and then references to those addresses would be satisfied from the buffer. You could think of that as a very early cache. That was the machine on which Dijkstra first implemented the spanning tree algorithm (as a demo program for an exhibition).
Spanning tree? Really? Surely you mean Shortest Path First? Antonio -- Antonio Carlini arcarl...@iee.org
