Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Product Form and Local Balance in Queueing Networks
Journal of the ACM (JACM)
Memory management and response time
Communications of the ACM
Validation of a queueing model with classes of customers
SIGMETRICS '76 Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation
Studies in Markov models of computer systems
ACM '75 Proceedings of the 1975 annual conference
Computer system models with passive resources.
Computer system models with passive resources.
Local balance models of computer systems.
Local balance models of computer systems.
Analytic Queueing Network Models for Parallel Processing of Task Systems
IEEE Transactions on Computers
Modeling multiprocessor computer systems with unbalanced flows
SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
Prefetching in File Systems for MIMD Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Performance Analysis of Database Systems
Performance Evaluation: Origins and Directions
The effects of CPU: I/O overlap on computer system configurations
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
A queueing network approach to the module allocation problem in distributed systems
SIGMETRICS '81 Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Analytic Queueing Models for Programs with Internal Concurrency
IEEE Transactions on Computers
Queueing Network Models for Parallel Processing with Asynchronous Tasks
IEEE Transactions on Computers
ICSOC '07 Proceedings of the 5th international conference on Service-Oriented Computing
System contention analysis: an alternate approach to system tuning
IBM Systems Journal
| Hi-index | 48.23 |
Approximate queueing models for internal parallel processing by individual programs in a multiprogrammed system are developed in this paper. The solution technique is developed by network decomposition. The models are formulated in terms of CPU:I/O and I/O:I/O overlap and applied to the analysis of these problems. The percentage performance improvement from CPU:I/O overlap is found to be greatest for systems which are in approximate CPU:I/O utilization balance and for low degrees of multiprogramming. The percentage improvement from I/O:I/O overlap is found to be greatest for systems in which the I/O system is more utilized than the CPU.