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

Tia M. Watts

dblp:96/6000 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1992
—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
Parallel and multicore computing · 100%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization
parallelizing compiler
0.011992
Techniques for Integrating Parallelizing Transformations and Compiler-Based Scheduling Methods · SC 1992
Parallel and multicore computing
parallel program transformation
0.011992
Techniques for Integrating Parallelizing Transformations and Compiler-Based Scheduling Methods · SC 1992
Compilers and program optimization
instruction scheduling
0.011992
Techniques for Integrating Parallelizing Transformations and Compiler-Based Scheduling Methods · SC 1992

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

iterative scheduling · 0.0demand-driven transformation · 0.0automatic transformation selection · 0.0
YearPublicationVenuePosition
1992 Techniques for Integrating Parallelizing Transformations and Compiler-Based Scheduling Methods
abstract
Although the tasks of applying transformations and scheduling instructions are typically implemented in separate phases of a parallelizing compiler, interactions between these phases occur. The authors discuss these interdependencies and demonstrate that the separate phase approach can result in the application of a sequence of transformations that is not effective. The techniques presented for integrating these tasks utilize an iterative approach to applying program transformations and scheduling instructions for execution on a multiprocessor. These integrated techniques employ a demand driven approach to applying transformations; by iterating between the scheduling and transforming tasks, transformations are applied to the program only if and where they are needed. The authors also introduce an automatic transformation application and selection algorithm that provides further control over the application of transformations.>
Tia M. Watts, Mary Lou Soffa, Rajiv Gupta 0001
SC1