CaltechAUTHORS
  A Caltech Library Service

Design automation and queueing networks: An interactive system for the evaluation of computer queueing models

Chandy, K. M. and Keller, T. W. and Browne, J. C. (1972) Design automation and queueing networks: An interactive system for the evaluation of computer queueing models. In: Proceedings of the 9th Design Automation Workshop. Association for Computing Machinery , New York, NY, pp. 357-367. http://resolver.caltech.edu/CaltechAUTHORS:20190114-150905455

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20190114-150905455

Abstract

Design automation techniques have been successfully used in wiring board layouts, circuit design analysis, and other areas. Simulation techniques have been used by system analysts to evaluate complex computer systems. In the early stages of a computer system design a designer will find an interactive package, which gives him real-time solutions for queueing models of complex computer systems, extremely useful. In the first few passes at a design, detailed simulation studies are too expensive and too slow. A conversational package which evaluates arbitrary configurations and gives approximate results is preferable to a slow, expensive, though accurate simulation. This paper is concerned with the real-time analysis of complex queueing network models which have been extensively used in computer systems analysis. In this paper we present the theory, algorithms and some programs for a system which departs radically from previous attempts at computer design aids for queueing network analysis in two ways: firstly the design automation system proposed here will give both algebraic and numerical answers to queries put forward by the analyst. For instance, the analyst may want to find out an algebraic expression for the throughput of a network as a function of several parameters. Or the analyst may want the output in the form of a graph of throughput as a function of a parameter. The system discussed in this paper will satisfy both types of requests. Secondly, the system allows the analyst to evaluate arbitrary networks constructed from a set of specified “building blocks.” The “building blocks” are quite general—they include queues with devices (servers), branches, joins, and so on. The analyst is allowed to use as many building blocks as he pleases, and he can interconnect these building blocks in any pattern he chooses. Thus the system is moderately flexible and allows the analyst greater freedom in choosing the models best suited for his system.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
https://doi.org/10.1145/800153.804968DOIArticle
Additional Information:© 1972 ACM. The work reported here was supported in part by NSF Grant GJ - 1084, "Design and Analysis of Multi-Programmed Computer Operating Systems."
Funders:
Funding AgencyGrant Number
NSFGJ-1084
Record Number:CaltechAUTHORS:20190114-150905455
Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:20190114-150905455
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:92260
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:22 Jan 2019 23:02
Last Modified:22 Jan 2019 23:02

Repository Staff Only: item control page