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

Ibrahim H. Önyüksel

dblp:06/4237 · DBLP profile ↗
← Back
4ranked-venue papers
2as 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-authorDatabases, data management, data science and information retrieval · 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
3 papers
Performance modeling and evaluation · 41% Storage systems · 17% Parallel and multicore computing · 17%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation
queueing models
0.031998
Database Reorganization in Parallel Disk Arrays with I/O Service Stealing · IEEE Trans. Knowl. Data Eng. 1998
Markovian Queueing Network Models for Performance Analysis of a Single-Bus Multiprocessor System · IEEE Trans. Computers 1990
A Closed-Form Solution for the Performance Analysis of Multiple-Bus Multiprocessor Systems · IEEE Trans. Computers 1984
Storage systems › data placement
data reorganization
0.011998
Database Reorganization in Parallel Disk Arrays with I/O Service Stealing · IEEE Trans. Knowl. Data Eng. 1998
Parallel and multicore computing
load balancing
0.011998
Database Reorganization in Parallel Disk Arrays with I/O Service Stealing · IEEE Trans. Knowl. Data Eng. 1998
Processor architecture and microarchitecture › multiprocessor architecture
bus-based multiprocessor
0.021990
Markovian Queueing Network Models for Performance Analysis of a Single-Bus Multiprocessor System · IEEE Trans. Computers 1990
A Closed-Form Solution for the Performance Analysis of Multiple-Bus Multiprocessor Systems · IEEE Trans. Computers 1984
Performance modeling and evaluation › queueing models › queueing network model
markovian queueing network
0.021990
Markovian Queueing Network Models for Performance Analysis of a Single-Bus Multiprocessor System · IEEE Trans. Computers 1990
A Closed-Form Solution for the Performance Analysis of Multiple-Bus Multiprocessor Systems · IEEE Trans. Computers 1984
Performance modeling and evaluation › parallel system performance
multiprocessor performance evaluation
0.021990
Markovian Queueing Network Models for Performance Analysis of a Single-Bus Multiprocessor System · IEEE Trans. Computers 1990
A Closed-Form Solution for the Performance Analysis of Multiple-Bus Multiprocessor Systems · IEEE Trans. Computers 1984
Processor architecture and microarchitecture › multiprocessor architecture
multiprocessor design
0.011990
Markovian Queueing Network Models for Performance Analysis of a Single-Bus Multiprocessor System · IEEE Trans. Computers 1990
Interconnection networks and networks-on-chip › bus-based interconnection
shared bus
0.011990
Markovian Queueing Network Models for Performance Analysis of a Single-Bus Multiprocessor System · IEEE Trans. Computers 1990
Interconnection networks and networks-on-chip › interconnection networks
bus contention
0.011984
A Closed-Form Solution for the Performance Analysis of Multiple-Bus Multiprocessor Systems · IEEE Trans. Computers 1984
Interconnection networks and networks-on-chip › bus-based interconnection
multiple bus network
0.011984
A Closed-Form Solution for the Performance Analysis of Multiple-Bus Multiprocessor Systems · IEEE Trans. Computers 1984

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

disk cooling · 0.0approximate queueing model · 0.0queueing network modeling · 0.0hypoexponential distribution · 0.0hyperexponential distribution · 0.0markov chain analysis · 0.0closed-form solution · 0.0
YearPublicationVenuePosition
1998 Database Reorganization in Parallel Disk Arrays with I/O Service Stealing
abstract
We present a model for data reorganization in parallel disk systems that is geared toward load balancing in an environment with periodic access patterns. Data reorganization is performed by disk cooling, i.e., migrating files or extents from the hottest disks to the coldest ones. We develop an approximate queueing model for determining the effective arrival rates of cooling requests and discuss its use in assessing the costs versus benefits of cooling actions.
Peter Zabback, Ibrahim H. Önyüksel, Peter Scheuermann, Gerhard Weikum
IEEE Trans. Knowl. Data Eng.2
1990 Markovian Queueing Network Models for Performance Analysis of a Single-Bus Multiprocessor System
abstract
An exact solution for the performance analysis of a typical single-bus multiprocessor system is presented. The multiprocessor system is modeled by a Markovian queueing network. An r-stage hypoexponential distribution or an r-stage hyperexponential distribution is used to represent the nonexponential service times. Consequently, the equilibrium probabilities of two-dimensional Markov chains are expressed by simple recurrence relations. Processing efficiency is used as the primary measure of performance. To investigate the effects of different service time distributions on system performance, comparative results are obtained for a large set of input parameters. The numerical results illustrate that processing efficiency attains its maximum value for a constant (deterministic) service time; if service time of common memory is hypoexponentially distributed, then approximating the service time by an exponential distribution produces less than 6% error on the system performance.>
Ibrahim H. Önyüksel, Keki B. Irani
IEEE Trans. Computers1
1984 A Closed-Form Solution for the Performance Analysis of Multiple-Bus Multiprocessor Systems
abstract
A closed-form solution for the performance analysis of multiple-bus multiprocessor systems is presented. A Markovian queueing network model has been developed to investigate the effects of memory and bus contentions on the system performance. The symmetrical structure of the Markov chains of the queueing model makes it possible to demonstrate that the local balance is satisfied. Consequently, the probabilities of the states of Markov chains can be expressed by simple formulas. Processing efficiency is used as a performance measure. However, this method is easily extendable to other performance measures. To investigate the effects of the system design parameters on the multiprocessor system performance, comparative results have been obtained for a large family of multiprocessor configurations from unibus to bus-sufficient systems.
Keki B. Irani, Ibrahim H. Önyüksel
IEEE Trans. Computers2
1983 A Markovian Queueing Network Model for Performance Evaluation of Bus-Deficient Multiprocessor Systems
Ibrahim H. Önyüksel, Keki B. Irani
ICPP1