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

A. V. S. Sastry

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

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

Systems, architecture and hardware · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 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%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization
register allocation
0.011998
A New Algorithm for Scalar Register Promotion based on SSA Form · PLDI 1998
Compilers and program optimization › register allocation
register promotion
0.011998
A New Algorithm for Scalar Register Promotion based on SSA Form · PLDI 1998
Compilers and program optimization › intermediate representation
static single assignment form
0.011998
A New Algorithm for Scalar Register Promotion based on SSA Form · PLDI 1998

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

profile-guided optimization · 0.0interval analysis · 0.0
YearPublicationVenuePosition
1998 A New Algorithm for Scalar Register Promotion based on SSA Form
abstract
We present a new register promotion algorithm based on Static Single Assignment (SSA) form. Register promotion is aimed at promoting program names from memory locations to registers. Our algorithm is profile-driven and is based on the scope of intervals. In cases where a complete promotion is not possible because of the presence of function calls or pointer references, the proposed algorithm is capable of eliminating loads and stores on frequently executed paths by placing loads and stores on less frequently executed paths. We also describe an efficient method to incrementally update SSA form when new definitions are cloned from an existing name during register promotion. On SPECInt95 benchmarks, our algorithm removes about ~12% of memory operations which access scalar variables.
A. V. S. Sastry, Roy Dz-Ching Ju
PLDI1
1988 A Dataflow Architecture for OR-Parallel Execution of Logic Programs
A. V. S. Sastry, Lalit M. Patnaik
ICPP (1)1