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

Ruben Yomtov

dblp:178/5711 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1992
—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
Storage systems · 44% Memory systems · 44% Performance modeling and evaluation · 13%

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

TopicWeightPapersLastEvidence papers
Memory systems › cache management › storage caching
disk cache
0.011992
Performance evaluation of disk subsystems · ISCA 1992
Storage systems › storage architecture
disk systems
0.011992
Performance evaluation of disk subsystems · ISCA 1992
Performance modeling and evaluation › storage performance evaluation
i/o performance modeling
0.011992
Performance evaluation of disk subsystems · ISCA 1992

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

analytical modeling · 0.0
YearPublicationVenuePosition
1992 Performance evaluation of disk subsystems
abstract
Mainframe Central Processor Unit (CPU) speed/performance has increased by more than two orders of magnitude since the 1970's. However, the I/O subsystem performance has only quadrupled in the same period of time. There is a need for a computer architecture with an effective storage hierarchy to complement improvements made in the CPU performance. This paper presents a technique to calculate the I/O performance of disk subsystems with and without disk cache buffers. Through a series of calculation it is shown that the best way to improve I/O performance is to increase the number of data paths and use disk memory caching.
Ruben Yomtov
ISCA1