Applied Probability— Computer Science: The Interface

AvRalph L. Disney,Teunis J. Ott

Häftad, Engelska, 1982

Del i serien Progress in Computer Science and Applied Logic

530 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Produktinformation

Utgivningsdatum:1982-01-01
Format:Häftad
Språk:Engelska
Serie:Progress in Computer Science and Applied Logic
Antal sidor:500
Förlag:Birkhauser Boston Inc
ISBN:9780817630935

Utforska kategorier

Referensverk och tvärvetenskap inom Samhälle och politik

Innehållsförteckning

Major Speakers.- Networks of Quasi-Reversible Nodes.- Simulation Output Analysis for General State Space Markov Chains.- Models and Problems of Dynamic Memory Allocation.- Probabilistic Analysis of Algorithms.- Point Process Method in Queueing Theory.- Error Minimization in Decomposable Stochastic Models.- Computational Methods for Product Form Queueing Networks: Extended Abstract.- Networks of Queues, I.- Closed Multichain Product Form Queueing Networks with Large Population Sizes.- The Significance of the Decomposition and the Arrival Theorems for the Evaluation of Closed Queueing Networks.- On Computing the Stationary Probability Vector of a Network of Two Coxian Servers.- Performance and Reliability.- Fitting of Software Error and Reliability Models to Field Failure Data.- Performance Evaluation of Voice/Data Queueing Systems.- Probabilistic Aspects of Simulation.- On a Spectral Approach to Simulation Run Length Control.- Generation of Some First-Order Autoregressive Markovian Sequences of Positive Random Variables with Given Marginal Distributions.- Testing for Initialization Bias in the Mean of a Simulation Output Series: Extended Abstract.- Queueing Models in Performance Analysis, I.- Response Time Analysis for Pipelining Jobs in a Tree Network of Processors.- Mean Delays of Individual Streams into a Queue: The ?GII/M/1 Queue.- Probabilistic Models in Performance Analysis of Computer Systems and Communication Networks.- Analysis and Design of Processor Schedules for Real Time Applications.- Modeling Real DASD Configurations.- Bottleneck Determination in Networks of Queues.- Probabilistic Analysis of Algorithms.- On the Average Difference Between the Solutions to Linear and Integer Knapsack Problems.- Volume II Probabilistic Analysis of Databases.- A Log Log NSearch Algorithm for Nonuniform Distributions: Extended Abstract.- A Multivariate Statistical Model for Data Base Performance Evaluation.- The Use of Sample Paths in Performance Analysis.- Sample-Path Analysis of Queues.- Computational Methods for Single-Server and Multi-Server Queues With Markovian Input and General Service Times.- The Time for a Round-Trip in a Cycle of Exponential Queues: Extended Abstract.- Computational Aspects of Applied Probability.- Waiting Time Distribution Response to Traffic Surges Via the Laguerre Transform.- Some Computational Aspects of Queueing Network Models.- Algorithmic Analysis of a Dynamic Priority Queue.- Steady-State Algorithmic Analysis of M/M/C Two-Priority Queues with Heterogeneous Rates.- Performance Models of Components of Computer Systems.- Exploiting Seek Overlap.- Analysis of a Scan Service Policy in a Gated Loop System.- Linear Probing and Related Problems.- Comparisons of Service Disciplines in a Queueing System With Delay Dependent Customer Behaviour.- Probabilistic Scheduling.- On the Optimal Order of Stations in Tandem Queues.- Scheduling Stochastic Jobs on Parallel Machines to Minimize Makespan or Flowtime.- An Adaptive-Priority Queue.- Markov Chain Models in Performance Analysis.- The Length of Path for Finite Markov Chains and its Application to Modelling Program Behaviour and Interleaved Memory Systems.- Networks of Queues, II.- The Heavy Traffic Diffusion Approximation for Sojourn Times in Jackson Networks.- Stationary Probabilities for Networks of Queues.- A Class of Closed Markovian Queueing Networks: Integral Representations, Asymptotic Expansions, Generalizations: Extended Abstract.- Queueing Models in Performance Analysis, II.- File Placement Using Predictive Queuing Models.- Networks of Work-Conserving Normal Queues.- Product Form Solution for Queueing Networks with Poisson Arrivals and General Service Time Distributions With Finite Means: Extended Abstract.