1978
DOI: 10.1145/359327.359333
|View full text |Cite
|
Sign up to set email alerts
|

The development of the MU5 computer system

Abstract: Following a brief outline of the background of the MUS project, the aims and ideas for MU5 are discussed. A description is then given of the instruction set, which includes a number of features conducive to the production of efficient compiled code from high-level language source programs. The design of the processor is then traced from the initial ideas for an associatively addressed "name store" to the final multistage pipeline structure involving a prediction mechanism for instruction prefetching and a func… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

1978
1978
2001
2001

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 28 publications
(7 citation statements)
references
References 7 publications
0
7
0
Order By: Relevance
“…[15,18,25]), in a cache organization similar in spirit to that used on the MU5 (where on-processor addresses were virtual, with translation to real addresses via "current page registers" in a Store Access Control Unit [19]). We may view each L2 tag <tid, L2, L1> as the address of a virtual texture block that must be mapped to a physical texture block within L2 cache memory.…”
Section: L2 Cache Organizationmentioning
confidence: 99%
“…[15,18,25]), in a cache organization similar in spirit to that used on the MU5 (where on-processor addresses were virtual, with translation to real addresses via "current page registers" in a Store Access Control Unit [19]). We may view each L2 tag <tid, L2, L1> as the address of a virtual texture block that must be mapped to a physical texture block within L2 cache memory.…”
Section: L2 Cache Organizationmentioning
confidence: 99%
“…of operands in store are generated from one of 13 base address registers (BA [3][4][5][6][7][8][9][10][11][12][13][14][15]) together with an offset, scaled according to the operand size. The offset consists of bits from the instruction, optionally added to one of three modifier registers (BM[I-3]).…”
Section: Addressesmentioning
confidence: 99%
“…The above discussion is at the level typically provided in machine descriptions (Organick 1973, Ibbett and Capon 1978, Buckle 1978 and only scratches the surface of the whole descriptor concept.…”
Section: Problems With Existing Designsmentioning
confidence: 99%