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

Odysseas I. Pentakalos

dblp:07/4928 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 1998
—ORCID · none

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

Systems, architecture and hardware · 3 · 2 first-authorSoftware engineering, systems software and programming languages · 2 · 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
3 papers
Storage systems · 50% Performance modeling and evaluation · 46% High-performance computing · 4%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation
queueing models
0.021997
Analytical Performance Modeling of Hierarchical Mass Storage Systems · IEEE Trans. Computers 1997
An Analytic Model of Hierachical Mass Storage Systems with Network-Attached Storage Devices · SIGMETRICS 1996
Storage systems › storage architecture
mass storage system
0.011997
Analytical Performance Modeling of Hierarchical Mass Storage Systems · IEEE Trans. Computers 1997
Performance modeling and evaluation › queueing models
mean value analysis
0.011997
Analytical Performance Modeling of Hierarchical Mass Storage Systems · IEEE Trans. Computers 1997
Storage systems
storage hierarchy
0.011997
Analytical Performance Modeling of Hierarchical Mass Storage Systems · IEEE Trans. Computers 1997
Performance modeling and evaluation
capacity planning
0.011997
Analytical Performance Modeling of Hierarchical Mass Storage Systems · IEEE Trans. Computers 1997
High-performance computing
scientific computing
0.011997
Analytical Performance Modeling of Hierarchical Mass Storage Systems · IEEE Trans. Computers 1997
Storage systems
network-attached storage
0.011996
An Analytic Model of Hierachical Mass Storage Systems with Network-Attached Storage Devices · SIGMETRICS 1996

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

workload characterization · 0.0discrete-event simulation · 0.0simulation · 0.0queueing network model · 0.0
YearPublicationVenuePosition
1998 User API for Tape Drives
Odysseas I. Pentakalos, Aram Khalili
USENIX ATC1
1997 Pythia and Pythia/WK: Tools for the Performance Analysis of Mass Storage Systems
abstract
The constant growth on the demands imposed on hierarchical mass storage systems creates a need for frequent reconfiguration and upgrading to ensure that the response times and other performance metrics are within the desired service levels. This paper describes the design and operation of two tools, Pythia and Pythia/WK, that assist system managers and integrators in making cost-effective procurement decisions. Pythia automatically buids and solves an analytic model of a mass storage system based on a graphical description of the architecture of the system, and on a description of the workload imposed on the system. The use of a modeling wizard to perform this conversion from a graphical description of a mass storage system to an analytic model makes Pythia unique among analytic performance tools. Pythia/WK uses clustering algorithms to characterize the workload from the log files of the mass storage system. The resulting workload characterization is used as input to Pythia. © 1997 John Wiley & Sons, Ltd.
Odysseas I. Pentakalos, Daniel A. Menascé, Yelena Yesha
Softw. Pract. Exp.1
1997 Analytical Performance Modeling of Hierarchical Mass Storage Systems
abstract
Mass storage systems are finding greater use in scientific computing research environments for retrieving and archiving the large volumes of data generated and manipulated by scientific computations. This paper presents a queuing network model that can be used to carry out capacity planning studies of hierarchical mass storage systems. Measurements taken on a Unitree mass storage system and a detailed workload characterization provided the workload intensity and resource demand parameters for the various types of read and write requests. The performance model developed here is based on approximations to multiclass Mean Value Analysis of queuing networks. The approximations were validated through the use of discrete event simulation and the complete model was validated and calibrated through measurements. The resulting model was used to analyze three different scenarios: effect of workload intensity increase, use of file compression at the server and client, and use of file abstractions.
Odysseas I. Pentakalos, Daniel A. Menascé, Milton Halem, Yelena Yesha
IEEE Trans. Computers1
1996 An Analytic Model of Hierachical Mass Storage Systems with Network-Attached Storage Devices
abstract
Network attached storage devices improve I/O performance by separating control and data paths and eliminating host intervention during data transfer. Devices are attached to a high speed network for data transfer and to a slower network for control messages. Hierarchical mass storage systems use disks to cache the most recently used files and tapes (robotic and manually mounted) to store the bulk of the files in the file system. This paper shows how queuing network models can be used to assess the performance of hierarchical mass storage systems that use network attached storage devices. The analytic model validated through simulation was used to analyze many different scenarios.
Daniel A. Menascé, Odysseas I. Pentakalos, Yelena Yesha
SIGMETRICS2