Introduction to Computer Organization and Data Structures
Introduction to Computer Organization and Data Structures
Proceedings of a symposium on Compiler optimization
Proposal on efficient address allocation algorithm for horizontal microprograms
MICRO 11 Proceedings of the 11th annual workshop on Microprogramming
A bit slice architecture for microprogrammable machines
MICRO 9 Proceedings of the 9th annual workshop on Microprogramming
Automatic address assignment of horizontal microprograms
ACM SIGMICRO Newsletter
| Hi-index | 0.00 |
The problem of addressing a large address space with a limited number of address bits is an old one [Bell and Newell, 1971]. The problem occurs in mini-computers which, with their short instruction word lengths of 12 to 16 bits, allocate only 8 to 12 bits of each instruction for specifying operand addresses. Hence each instruction can directly access only 28 to 212 words of memory. In order to access the remainder of a large (say 216 word) memory, mechanisms such as bank switching, page registers, base registers, zero/current page addressing, and indirection have been used. Each of these mechanisms allows a subset of the entire address space to be accessed easily while requiring some additional overhead to access the remainder.