K.T.
Computer Science - The Interface
Published on 1. January 1982
Book
Hardback
532 pages
978-3-7643-3067-5 (ISBN)
Description
These two volumes are the Proceedings of the first special interest meeting instigated and organized by the joint Technical Section and College in Applied Probability of ORSA and THlS. This meeting, which took place January 5-7, 1981 at Florida Atlantic University in Boca Raton, Florida, had the same name as these Proceedings: Applied Probability-Computer Science, the Interface. The goal of that conference was to achieve a meeting of, and a cross fertilization between, two groups of researchers who, from different starting points, had come to work on similar problems, often developing similar methodologies and tools. One of these groups are the applied probabilists, many of whom consider their field an offspring of mathematics, and who find their motivation in many areas of application. The other is that group of computer scientists who, over the years, have found an increasing need in their work for the use of probabilistic models. The most visible area of common methodology between these two groups is networks of queues, Hhich by itself could have been the theme of an entire conference. FunctionQl areas which are, or are becoming, sources of exciting problems are computer performance analysis, data base analysis, analysis of communication protocols, data networks, and mixed voice-data telephone networks. The reader can add to this list by going through the papers in these Proceedings.
More details
Other editions
Additional editions
Ralph L. Disney | Teunis J. Ott
Applied Probability-Computer Science: The Interface Volume 1
Book
10/2011
Springer-Verlag New York Inc.
€53.49
Shipment within 15-20 days
Content
Major Speakers.- Networks of Quasi-Reversible Nodes.- The c - Server Queue with Constant Service Times and a Versatile Markovian Arrival Process.- 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 Richard Muntz, Chairman.- 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 Donald Gross, Chairman.- Fitting of Software Error and Reliability Models to Field Failure Data.- Performance Evaluation of Voice/Data Queueing Systems.- Probabilistic Aspects of Simulation Peter Lewis, Chairman.- 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 Daniel Heyman, Chairman.- 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 Donald Gaver, Chairman.- Analysis and Design of Processor Schedules for Real Time Applications.- Modeling Real Dasd Configurations.- Bottleneck Determination inNetworks of Queues.- Probabilistic Analysis of Algorithms Dave Liu, Chairman.- On the Average Difference Between the Solutions to Linear and Integer Knapsack Problems.