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

Yashodara Costa

dblp:18/666 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1993
—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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 77% Performance modeling and evaluation · 23%

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

TopicWeightPapersLastEvidence papers
Memory systems › memory architecture
parallel memory organization
0.011993
Analytical Estimation of Vector Access Performance in Parallel Memory Architectures · IEEE Trans. Computers 1993
Performance modeling and evaluation
analytical modeling
0.011993
Analytical Estimation of Vector Access Performance in Parallel Memory Architectures · IEEE Trans. Computers 1993

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

variability measure · 0.0XOR storage scheme · 0.0
YearPublicationVenuePosition
1993 Analytical Estimation of Vector Access Performance in Parallel Memory Architectures
abstract
A limiting factor in high-performance vector computers is the rate at which data can be moved to and from memory during vector loads and stores. To increase the bandwidth of vector memory operations, several investigators have proposed the use of noninterleaved storage mappings, also known as storage schemes. A method of analyzing the performance of vector references for the class of storage schemes referred to as XOR schemes is described. The proposed measure of relative performance, the variability of an access, is defined and its computation is outlined. The use of variability as a performance indicator is demonstrated and compared with performance measurements made using simulation. One of the key aspects of the variability measure is its capability to lend insight to the transient behavior of vector accesses.>
David T. Harper III, Yashodara Costa
IEEE Trans. Computers2