Dynamic Memory Interconnections for Rapid Access
Sinclair, J. Bartlett
parallel processing; dynamic memory; random access; sequential access
Certain aspects of bulk storage technology development have required the study of dynamic memory interconnections. Various schemes to interconnect physical storage locations have been proposed in the literature. Taking into consideration the fact that dynamic memories are characterised by a small number of i/o ports, these schemes attempt to minimise random access time or reduce sequential access time. In this paper a scheme is proposed which combines concepts of interleaving and properties of the perfect shuffle interconnection network to permit random access of items in a large bulk store in less than logarithmic time and subsequent sequential access in unit time. Asymptotic behaviour of this scheme is also examined.
MetadataShow full item record
- ECE Publications