Open AccessBook
Computer systems performance modeling
Charles H. Sauer,K. Mani Chandy +1 more
- 01 Mar 1981
319
About: The article was published on 01 Mar 1981. and is currently open access.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Random number generators: good ones are hard to find
S. K. Park,Keith W. Miller +1 more
TL;DR: In this paper, practical and theoretical issues concerning the design, implementation, and use of a good, minimal standard random number generator that will port to virtually all systems are presented concerning the use of such a generator.
The Queueing Network Analyzer
TL;DR: This paper describes the Queueing Network Analyzer (QNA), a software package developed at Bell Laboratories to calculate approximate congestion measures for a network of queues and uses two parameters to characterize the arrival processes and service times.
1K
A Generalized Timed Petri Net Model for Performance Analysis
Mark A. Holliday,Mary K. Vernon +1 more
TL;DR: In this paper, a Generalized Timed Petri net (GTPN) model is proposed for evaluating the performance of computer systems. Butler et al. proposed a generalization of the TPN model proposed by Zuberek [1] and extended by Razouk and Phelps [2].
A Unified Approach for Specifying Measures of Performance, Dependability and Performability
William H. Sanders,John F. Meyer +1 more
- 01 Jan 1991
TL;DR: A unified approach to the specification of measures of performance, dependability, and performability is presented by using a model class well suited for representation of all three aspects of system behavior, and defining a variable class which allows for the Specification of a wide range of measuresof system behavior.
199
Insensitivity of blocking probabilities in a circuit-switching network
TL;DR: This work extends Erlang work to general networks and shows that if for each pair of nodes there is a unique route, then the blocking probabilities are in product form and are insensitive to the call holding-time distribution, which means that they depend on the call duration only through its mean.
186