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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Sharad Mathur

dblp:23/1038 · DBLP profile ↗
← Back
1ranked-venue papers
0as 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 · 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
Parallel and multicore computing · 87% High-performance computing · 13%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › data distribution
data mapping		 0.011991
Efficient Implementation of High Level Parallel Programs · ASPLOS 1991
Parallel and multicore computing › parallel computing
parallel implementation		 0.011991
Efficient Implementation of High Level Parallel Programs · ASPLOS 1991
High-performance computing
distributed memory systems		 0.011991
Efficient Implementation of High Level Parallel Programs · ASPLOS 1991

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

declarative data mapping · 0.0
YearPublicationVenuePosition
1991 Efficient Implementation of High Level Parallel Programs
abstract
The efficiency of a parallel program is related to the implementation of its data structures on the distributed (or shared) memory of a specific architecture.This paper describes a declarative approach that may be used to modify the mapping of the program data on a specific architecture.The ideas are developed in the context of a new language called UC and its implementation on the Connection Machine.The paper aim contains measurements on sample programs to illustrate the effectiveness of data mappings in improving the execution efficiency of example programs.
Rajive L. Bagrodia, Sharad Mathur
 ASPLOS2