Proceedings of the 7th Annual Symposium on Computer Architecture - ISCA '80 1980
DOI: 10.1145/800053.801921
|View full text |Cite
|
Sign up to set email alerts
|

MU6-G. a new design to achieve mainframe performance from a mini-sized computer

Abstract: MU6-G is a high performance machine useful for general or scientific applications. Its order code and architecture are designed to be sympathetic to the needs of the operating system and to both the compilation and execution of programs written in high level languages and to support a word size suitable for high precision scientific computations. Advanced technology, coupled with simplicity of design, is used to achieve a high and more readily predictable performance. Innovative features include the unique org… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

1981
1981
1992
1992

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 10 publications
(2 citation statements)
references
References 5 publications
0
2
0
Order By: Relevance
“…It is precisely for this reason that the Reduced Instruction Set Computers such as the Berkley RISC [Sequin 1983], Stanford MIPS [Hennessy 1984], and the IBM 801 [Radin 1983] have opted for fairly short and simple pipelines. Similar reasoning underlies the design of MU6-G [Edwards, Knowles, and Woods 1980], a successor to MU5. Nonetheless, performance degradations caused by control transfers have failed to disappear completely even in these machines.…”
Section: Discontinuities In the Flow Of Instructionsmentioning
confidence: 75%
“…It is precisely for this reason that the Reduced Instruction Set Computers such as the Berkley RISC [Sequin 1983], Stanford MIPS [Hennessy 1984], and the IBM 801 [Radin 1983] have opted for fairly short and simple pipelines. Similar reasoning underlies the design of MU6-G [Edwards, Knowles, and Woods 1980], a successor to MU5. Nonetheless, performance degradations caused by control transfers have failed to disappear completely even in these machines.…”
Section: Discontinuities In the Flow Of Instructionsmentioning
confidence: 75%
“…The ATU effectively simulates a very large associative memory and is implemented in dedicated fast memory as a hash table with imbedded overflow [1]. Similar schemes are described in [8,13]. The hash table is large enough to hold an entry for every page frame of main memory.…”
Section: Figure 3: a Monads Virtual Addressmentioning
confidence: 99%