Applied Probability-Computer Science: The Interface Volume 1

Chapter 1 Networks of Quasi-Reversible Nodes

Chapter 2 The c — Server Queue with Constant Service Times and a Versatile Markovian Arrival Process

Chapter 3 Simulation Output Analysis for General State Space Markov Chains

Chapter 4 Models and Problems of Dynamic Memory Allocation

Chapter 5 Probabilistic Analysis of Algorithms

Chapter 6 Point Process Method in Queueing Theory

Chapter 7 Error Minimization in Decomposable Stochastic Models

Chapter 8 Computational Methods for Product Form Queueing Networks

Chapter 9 Closed Multichain Product Form Queueing Networks with Large Population Sizes

Chapter 10 The Significance of the Decomposition and the Arrival Theorems for the Evaluation of Closed Queueing Networks

Chapter 11 On Computing the Stationary Probability Vector of a Network of Two Coxian Servers

Chapter 12 Fitting of Software Error and Reliability Models to Field Failure Data

Chapter 13 Performance Evaluation of Voice/Data Queueing Systems

Chapter 14 On a Spectral Approach to Simulation Run Length Control

Chapter 15 Generation of some First-Order Autoregressive Markovian Sequences of Positive Random Variables with Given Marginal Distributions

Chapter 16 Testing for Initialization Bias in the Mean of a Simulation Output Series

Chapter 17 Response Time Analysis for Pipelining Jobs in a Tree Network of Processors

Chapter 18 Mean Delays of Individual Streams into a Queue: The ΣGI i /M/1 Queue

Chapter 19 Analysis and Design of Processor Schedules for Real Time Applications

Chapter 20 Modeling Real DASD Configurations

Chapter 21 Bottleneck Determination in Networks of Queues

Chapter 22 On the Average Difference between the Solutions to Linear and Integer Knapsack Problems