Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

K. R. Scidmore

dblp:61/6963 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1988
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2Software engineering, systems software and programming languages · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Processor architecture and microarchitecture · 88% Parallel and multicore computing · 6% Memory systems · 6%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Processor architecture and microarchitecture › latency hiding
decoupled architecture
0.011987
The ZS-1 Central Processor · ASPLOS 1987
Processor architecture and microarchitecture
instruction-level parallelism
0.011987
The ZS-1 Central Processor · ASPLOS 1987
Processor architecture and microarchitecture › pipelining
instruction pipeline
0.011987
The ZS-1 Central Processor · ASPLOS 1987
Processor architecture and microarchitecture
pipelining
0.011987
The ZS-1 Central Processor · ASPLOS 1987
Parallel and multicore computing › scheduling algorithms
hybrid static-dynamic scheduling
0.011987
The ZS-1 Central Processor · ASPLOS 1987
Processor architecture and microarchitecture
instruction scheduling
0.011987
The ZS-1 Central Processor · ASPLOS 1987
Memory systems › memory management
virtual memory
0.011987
The ZS-1 Central Processor · ASPLOS 1987

Methods — techniques the papers use, named apart from their topics

static instruction scheduling · 0.0dynamic scheduling · 0.0
YearPublicationVenuePosition
1988 The Astronautics ZS-1 processor
abstract
The Astronautics ZS-1 is a high speed minisupercomputer system designed for scientific and engineering applications. The ZS-1 central processor uses a decoupled architecture which splits instruction words into two streams, one for fixed-point/memory-address computation and the other for floating-point operations. The two instruction streams are then processed in parallel, with architectural queues providing communication between the streams. Pipelining is used extensively throughout the ZS-1. The combination of decoupling and pipelining provides overall, sustained performance of about one third a CRAY-XMP-1 on compiled double-precision Fortran. The authors give a description of the decoupled architecture and discuss other forms of parallelism used in the ZS-1. A discussion of static and dynamic instruction scheduling is also included.>
James E. Smith 0001, Greg Dermer, B. D. Vanderwarn, S. D. Klinger, C. M. Rozewski, D. L. Fowler, K. R. Scidmore, James Laudon
ICCD7
1987 The ZS-1 Central Processor
abstract
The Astronautics ZS-1 is a high speed, 64-bit computer system designed for scientific and engineering applications. The ZS-1 central processor uses a decoupled architecture, which splits instructions into two streams---one for fixed point/memory address computation and the other for floating point operations. The two instruction streams are then processed in parallel. Pipelining is also used extensively throughout the ZS-1.This paper describes the architecture and implementation of the ZS-1 central processor, beginning with some of the basic design objectives. Descriptions of the instruction set, pipeline structure, and virtual memory implementation demonstrate the methods used to satisfy the objectives. High performance is achieved through a combination of static (compile-time) instruction scheduling and dynamic (run-time) scheduling. Both types of scheduling are illustrated with examples.
James E. Smith 0001, Greg Dermer, B. D. Vanderwarn, S. D. Klinger, C. M. Rozewski, D. L. Fowler, K. R. Scidmore, James Laudon
ASPLOS7