1979
DOI: 10.1007/978-1-349-16103-4
|View full text |Cite
|
Sign up to set email alerts
|

The MU5 Computer System

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

1988
1988
1999
1999

Publication Types

Select...
5
3

Relationship

2
6

Authors

Journals

citations
Cited by 41 publications
(9 citation statements)
references
References 0 publications
0
9
0
Order By: Relevance
“…Early machines, such as the CDC 6600 [Thornton 1970] and MU5 [Morris and Ibbett 1979], incorporated complex control mechanisms in an attempt to maximize the pipeline throughput. Studies of MU5 revealed that average instruction times were between 0.2 and 0.4/~s, compared with a pipeline beat time of 50ns.…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…Early machines, such as the CDC 6600 [Thornton 1970] and MU5 [Morris and Ibbett 1979], incorporated complex control mechanisms in an attempt to maximize the pipeline throughput. Studies of MU5 revealed that average instruction times were between 0.2 and 0.4/~s, compared with a pipeline beat time of 50ns.…”
Section: Discussionmentioning
confidence: 99%
“…The Branch Target Cache (BTC) is an alternative to the BTB and has attracted some attention recently; it has been studied in depth [Hill 1987] and implemented in at least one machine, the AMD 29000 microprocessor [AMD 1987]. A BTC differs from a BTB in that it stores instructions at the jump-to address rather than the address itself; such a system was considered for MU5 [Morris and Ibbett 1979] but was rejected on cost/performance grounds.…”
Section: '9mentioning
confidence: 99%
See 1 more Smart Citation
“…The organization of the Branch Target Cache (BTC) is shown in Figure 5; it is similar to the 'Jump Trace Buffer' used on the MU5 mainframe computer [11] developed at the University of Manchester between 1969 and 1974 (which also operated with asynchronous control).…”
Section: The Branch Target Cachementioning
confidence: 99%
“…Whereas previous instruction pipelines, such as the primary operand pipeline in MU5 [Morris and Ibbett 1979], had pipeline stages that evaluated a function f such that f: Instruction w. Partial Result, the HEP pipeline stages evaluate a function g such that g:Instruction • Process Tag ~ Partial Result • Process Tag.…”
Section: Kaminsky Anddavidson's Workmentioning
confidence: 99%