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

Reese B. Jones

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

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

Systems, architecture and hardware · 1 · 1 first-author

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.

Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Processor architecture and microarchitecture · 100%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization
loop optimization
0.011991
Software Pipelining: An Evaluation of Enhanced Pipelining · MICRO 1991
Compilers and program optimization › instruction scheduling
software pipelining
0.011991
Software Pipelining: An Evaluation of Enhanced Pipelining · MICRO 1991
Processor architecture and microarchitecture
instruction-level parallelism
0.011991
Software Pipelining: An Evaluation of Enhanced Pipelining · MICRO 1991
Processor architecture and microarchitecture
instruction scheduling
0.011991
Software Pipelining: An Evaluation of Enhanced Pipelining · MICRO 1991

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

simulation · 0.0
YearPublicationVenuePosition
1991 Software Pipelining: An Evaluation of Enhanced Pipelining
abstract
Software Pipelining is a fine-grain loop optimization technique for architectures that support synchronous parallel execution.We compare Lam's software pipelining algorithm with Ebcio~lu and Nakatani's technique.This research seems to indicate the Enhanced Pipeline Scheduling algorithm is a good general purpose software pipelining algorithm, due to the fact that it performs only slightly worse than Lam's algorithm on single basic block loops and should perform better than Lam's algorithm on multiple basic block loops.However, if pipelining single basic block loops is the goal, it appears that it would be better to use Lam's algorithm.We s3so propose a technique for changing the resource constrained scheduling priority of operations to prevent operations from future iterations from being significantly delayed due to resource confllcts.
Reese B. Jones, Vicki H. Allan
MICRO1