Article

Free access

Placement of microinstructions in a two-dimensional address space

Authors:

John F. Wakerly,

Clifford R. Hollander,

Daniel DaviesAuthors Info & Claims

MICRO 8: Proceedings of the 8th annual workshop on Microprogramming

Pages 46 - 51

https://doi.org/10.1145/800148.804861

Published: 21 September 1975 Publication History

PDF eReader

Abstract

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 2⁸ to 2¹² words of memory. In order to access the remainder of a large (say 2¹⁶ 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.

References

[1]

Allen, F. E., 1970, "Control flow analysis," Proc. Symp. Compiler Optim., ACM SIGPLAN (1970), pp. 1-19.

Digital Library

Google Scholar

[2]

Intel, 1974, "3001 microprogram control unit," data sheets, Intel Corp., Santa Clara, Calif.

Google Scholar

[3]

Intel, 1975, "Central processor design using the Intel series 3000 computing elements," Application Note AP-16, Intel Corp., Santa Clara, Calif.

Google Scholar

[4]

Rattner, J., J.-C. Cornet, and M. E. Hoff, 1974, "Bipolar LSI computing elements usher in new era of digital design," Electronics, vol. 47, no. 18, Sept. 5, 1974.

Google Scholar

[5]

Stone, H. S., 1972, Introduction to Computer Organization and Data Structures, New York: McGraw-Hill.

Digital Library

Google Scholar

Cited By

View all

Takahashi ETakahashi KBito TSasaki TKitano K(1983)Automatic address assignment of horizontal microprogramsACM SIGMICRO Newsletter10.1145/1096419.109644714:4(185-192)Online publication date: 1-Dec-1983
https://dl.acm.org/doi/10.1145/1096419.1096447
Tanaka TKawada TEmori TCrocker SJohnson GParker AAshlstrom J(1978)Proposal on efficient address allocation algorithm for horizontal microprogramsProceedings of the 11th annual workshop on Microprogramming10.5555/800132.804305Online publication date: 19-Nov-1978
https://dl.acm.org/doi/10.5555/800132.804305
Tanaka TKawada TEmori T(1978)Proposal on efficient address allocation algorithm for horizontal microprogramsACM SIGMICRO Newsletter10.1145/1014198.8043059:4(40)Online publication date: 19-Nov-1978
https://dl.acm.org/doi/10.1145/1014198.804305
Show More Cited By

Index Terms

Placement of microinstructions in a two-dimensional address space

Recommendations

Fine-granularity tile-level parallelism in non-volatile memory architecture with two-dimensional bank subdivision
DAC '16: Proceedings of the 53rd Annual Design Automation Conference

Emerging memory technologies such as phase-change memory (PCM) and resistive RAMs (RRAM) have been proposed as promising candidates for future DRAM replacements. Due to the nature of how these memories operate, unique properties (such as non-destructive ...
Address-aware fences
ICS '13: Proceedings of the 27th international ACM conference on International conference on supercomputing

Many modern multicore architectures support shared memory for ease of programming and relaxed memory models to deliver high performance. With relaxed memory models, memory accesses can be reordered dynamically and seen by other processors. Therefore, ...
Durable Address Translation in PCM-Based Flash Storage Systems

Phase change memory (PCM) is a promising DRAM alternative because of its non-volatility, high density, low standby power and close-to-DRAM performance. These features make PCM an attractive solution to optimize the management of NAND flash memory in ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

MICRO 8: Proceedings of the 8th annual workshop on Microprogramming

September 1975

102 pages

ISBN:9781450374514

DOI:10.1145/800148

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 September 1975

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 484 of 2,242 submissions, 22%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
256
Total Downloads

Downloads (Last 12 months)52
Downloads (Last 6 weeks)9

Reflects downloads up to 17 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Takahashi ETakahashi KBito TSasaki TKitano K(1983)Automatic address assignment of horizontal microprogramsACM SIGMICRO Newsletter10.1145/1096419.109644714:4(185-192)Online publication date: 1-Dec-1983
https://dl.acm.org/doi/10.1145/1096419.1096447
Tanaka TKawada TEmori TCrocker SJohnson GParker AAshlstrom J(1978)Proposal on efficient address allocation algorithm for horizontal microprogramsProceedings of the 11th annual workshop on Microprogramming10.5555/800132.804305Online publication date: 19-Nov-1978
https://dl.acm.org/doi/10.5555/800132.804305
Tanaka TKawada TEmori T(1978)Proposal on efficient address allocation algorithm for horizontal microprogramsACM SIGMICRO Newsletter10.1145/1014198.8043059:4(40)Online publication date: 19-Nov-1978
https://dl.acm.org/doi/10.1145/1014198.804305
Andrews M(1976)A bit slice architecture for microprogrammable machinesProceedings of the 9th annual workshop on Microprogramming10.1145/800145.804778(5-8)Online publication date: 27-Sep-1976
https://dl.acm.org/doi/10.1145/800145.804778

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Fine-granularity tile-level parallelism in non-volatile memory architecture with two-dimensional bank subdivision

Address-aware fences

Durable Address Translation in PCM-Based Flash Storage Systems