The method of surrogate delays: Simultaneous resource possession in analytic models of computer systems

Authors:
Patricia A. Jacobson;Edward D. Lazowska
Affiliations:
Department of Computer Science, University of Washington, Seattle, Wa;Department of Computer Science, University of Washington, Seattle, Wa
Venue:
SIGMETRICS '81 Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Year:
1981

Citing 5
Cited 6

A General Model for the Performance of Disk Systems

Journal of the ACM (JACM)
Approximate Methods for Analyzing Queueing Network Models of Computing Systems

ACM Computing Surveys (CSUR)
Linearizer: a heuristic algorithm for queueing network models of computing systems

Communications of the ACM
A model of shared DASD and multipathing

Communications of the ACM
Simultaneous resource possession in queueing models of computers

ACM SIGMETRICS Performance Evaluation Review

Analyzing queueing networks with simultaneous resource possession

Communications of the ACM
Queueing analysis of a canonical model of real-time multiprocessors

SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Analytic modelling of disk I/O subsystems: A tutorial

SIGMETRICS '81 Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Fast approximate solution of multiprogramming models

SIGMETRICS '82 Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems
HAM: the heuristic aggregation method for solving general closed queueing network models of computer systems

SIGMETRICS '82 Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Models of DASD Subsystems with Multiple Access Paths: A Throughput-Driven Approach

IEEE Transactions on Computers

Quantified Score

Hi-index	0.02

Visualization

Abstract

This paper presents a new approach to modelling the simultaneous or overlapped possession of resources in queueing networks. The key concept is that of iteration between two models, each of which includes an explicit representation of one of the simultaneously held resources and a delay server (an infinite server, with service time but no queueing) acting as a surrogate for queueing delay due to congestion at the other simultaneously held resource. Because of this, we refer to our approximation technique as the “method of surrogate delays”.