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.

R. T. Joersz

dblp:07/3784 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1987
—ORCID · none

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

Systems, architecture and hardware · 1Software 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 · 100%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization
instruction scheduling
0.011987
WISQ: A Restartable Architecture Using Queues · ISCA 1987
Compilers and program optimization › instruction scheduling
trace scheduling
0.011987
WISQ: A Restartable Architecture Using Queues · ISCA 1987
Processor architecture and microarchitecture
instruction-level parallelism
0.011987
WISQ: A Restartable Architecture Using Queues · ISCA 1987
Processor architecture and microarchitecture
pipelining
0.011987
WISQ: A Restartable Architecture Using Queues · ISCA 1987
Processor architecture and microarchitecture
reorder buffer
0.011987
WISQ: A Restartable Architecture Using Queues · ISCA 1987
Processor architecture and microarchitecture
branch prediction
0.011987
WISQ: A Restartable Architecture Using Queues · ISCA 1987

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

compiler techniques · 0.0
YearPublicationVenuePosition
1987 WISQ: A Restartable Architecture Using Queues
abstract
In this paper, the WISQ architecture is described. This architecture is designed to achieve high performance by exploiting new compiler technology and using a highly segmented pipeline. By having a highly segmented pipeline, a very-high-speed clock can be used. Since a highly segmented pipeline will require relatively long pipelines, a way must be provided to minimize the effects of pipeline bubbles that are formed due to data and control dependencies. It is also important to provide a way of supporting precise interrupts. These goals are met, in part, by providing a reorder buffer to help restore the machine to a precise state. The architecture then makes the pipelining visible to the programmer/compiler by making the reorder buffer accessible and by explicitly providing that issued instructions cannot be affected by immediately preceding ones. Compiler techniques have been identified that can take advantage of the reorder buffer and permit a sustained execution rate approaching or exceeding one per clock. These techniques include using trace scheduling and providing a relatively easy way to “undo” instructions if the predicted branch path is not taken. We have also studied ways to further reduce the effects of branches by not having them executed in the execution unit. In particular, branches are detected and resolved in the instruction fetch unit. Using this approach, the execution unit is sent a stream of instructions (without branches) that are guaranteed to execute.
Andrew R. Pleszkun, James R. Goodman, Wei-Chung Hsu, R. T. Joersz, George E. Bier, Philip J. Woest, P. B. Schechter
ISCA4