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

Ven Seshadri

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

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

Systems, architecture and hardware · 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.

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 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Compilers and program optimization › parallel program optimization
communication optimization
0.011995
An HPF Compiler for the IBM SP2 · SC 1995
Compilers and program optimization
parallelizing compiler
0.011995
An HPF Compiler for the IBM SP2 · SC 1995
Parallel and multicore computing › parallel programming models
automatic parallelization
0.011995
An HPF Compiler for the IBM SP2 · SC 1995
Parallel and multicore computing
parallel programming models
0.011995
An HPF Compiler for the IBM SP2 · SC 1995

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

data availability analysis · 0.0collective communication · 0.0coarse-grain wavefronting · 0.0
YearPublicationVenuePosition
1995 An HPF Compiler for the IBM SP2
abstract
We describe pHPF, an research prototype HPF compiler for the IBM SP series parallel machines. The compiler accepts as input Fortran 90 and Fortran 77 programs, augmented with HPF directives; sequential loops are automatically parallelized. The compiler supports symbolic analysis of expressions. This allows parameters such as the number of processors to be unknown at compile-time without significantly affecting performance. Communication schedules and computation guards are generated in a parameterized form at compile-time. Several novel optimizations and improved versions of well-known optimizations have been implemented in pHPF to exploit parallelism and reduce communication costs. These optimizations include elimination of redundant communication using data-availability analysis; using collective communication; new techniques for mapping scalar variables; coarse-grain wavefronting; and communication reduction in multi-dimensional shift communications. We present experimenta...
Manish Gupta 0002, Samuel P. Midkiff, Edith Schonberg, Ven Seshadri, David Shields, Ko-Yang Wang, Wai-Mee Ching, Ton Anh Ngo
SC4