1963 · 11 citations · 5 references
ComputingComputer EngineeringComputer ScienceComputer ArchitectureMemoryStorage SystemsMemory HierarchyMemory Hierarchy DesignMemory ManagementStorage ManagementAddress Space MappingAddressingMemory MappingRandom Access Memory (Ram)Random-access Memory
The addressing procedure for nonsequentially stored data in large capacity random access memories is the automatic allocation of storage position to each member of a data set. Each member, termed here as a record, is identified by a unique description or key which is part of the record. Key addressing then is the execution of a mapping function which mathematically relates the key of a record to its location in storage. To store or to retrieve a record, its key is presented to the addressing facility which then generates an address to which the memory will then access.
5
Error Detecting and Error Correcting Codes
R. W. Hamming · Bell System Technical Journal · 1950 · 5.1K citations · Full text
Addressing for Random-Access Storage
W. W. Peterson · IBM Journal of Research and Development · 1957 · 257 citations
V. J. Varineau, Harriet Griffin · American Mathematical Monthly · 1955 · 79 citations