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.

Satish L. Rege

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

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

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation › queueing models › closed queueing networks
cyclic-queue model
0.011976
Cost, Performance and Size Tradeoffs for Different Levels in a Memory Hierarchy · ISCA 1976
Memory systems
memory hierarchy
0.011976
Cost, Performance and Size Tradeoffs for Different Levels in a Memory Hierarchy · ISCA 1976
Performance modeling and evaluation
queueing models
0.011976
Cost, Performance and Size Tradeoffs for Different Levels in a Memory Hierarchy · ISCA 1976

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

cyclic queueing model · 0.0
YearPublicationVenuePosition
1976 Cost, Performance and Size Tradeoffs for Different Levels in a Memory Hierarchy
abstract
This paper evaluates the effect of cost and performance tradeoffs on memory system hierarchies achieved by varying the total amount of memory at any two adjacent levels. The hierarchy is analyzed in a multiprogramming mode by using a two server cyclic queuing model. As an example, a two level hierarchy of Bipolar, MOS and a three level hierarchy of Bipolar, MOS, and CCD for the primary memory are compared. A figure of merit that is a function of the number of instructions executed by a given processor is used to evaluate the different memory hierarchies. It is shown that up to 3:1 advantage in performance can be achieved by using a three level rather than the two level hierarchy at the same total cost. The effect on the performance of the memory hierarchy due to the change in the degree of multiprogramming, the speed and cost of CCD technology used, the speed of the CPU used and the amount of CCD and MOS memory used are then evaluated. The performance of two and three level hierarchies is also analyzed as a function of the primary memory requirements versus the CCD speed.
Satish L. Rege
ISCA1