Quantitative Methods in Parallel Systems

✍ Scribed by N. Götz, H. Hermanns, U. Herzog, V. Mertsiotakis, M. Rettelbach (auth.), François Baccelli, Alain Jean-Marie, Isi Mitrani (eds.)

• Publisher: Springer-Verlag Berlin Heidelberg
• Year: 1995
• Tongue: English
• Leaves: 313
• Series: Esprit Basic Research Series
• Edition: 1
• Category: Library

✦ Synopsis

It is widely recognized that the complexity of parallel and distributed systems is such that proper tools must be employed during their design stage in order to achieve the quantitative goals for which they are intended. This volume collects recent research results obtained within the Basic Research Action Qmips, which bears on the quantitative analysis of parallel and distributed architectures. Part 1 is devoted to research on the usage of general formalisms stemming from theoretical computer science in quantitative performance modeling of parallel systems. It contains research papers on process algebras, on Petri nets, and on queueing networks. The contributions in Part 2 are concerned with solution techniques. This part is expected to allow the reader to identify among the general formalisms of Part I, those that are amenable to an efficient mathematical treatment in the perspective of quantitative information. The common theme of Part 3 is the application of the analytical results of Part 2 to the performance evaluation and optimization of parallel and distributed systems. Part 1. Stochastic Process Algebras are used by N. Gotz, H. Hermanns, U. Herzog, V. Mertsiotakis and M. Rettelbach as a novel approach for the struc­ tured design and analysis of both the functional behaviour and performability (i.e performance and dependability) characteristics of parallel and distributed systems. This is achieved by integrating stochastic modeling and analysis into the powerful and well investigated formal description techniques of process algebras.

✦ Table of Contents

Front Matter....Pages I-XX
Front Matter....Pages 1-1
Stochastic Process Algebras....Pages 3-17
Stochastic Process Algebra for Discrete Event Simulation....Pages 18-37
GSPN and SPA Compared in Practice....Pages 38-51
Functional and Performance Analysis of Cooperating Sequential Processes....Pages 52-65
Front Matter....Pages 67-67
Analysis of Parallel Processing Systems via the (max,+) Algebra....Pages 69-98
Tipp and the Spectral Expansion Method....Pages 99-113
G-Networks: A Survey of Results, a Solver and an Application....Pages 114-128
Polling Models with Threshold Switching....Pages 129-140
Two-Dimensional Nearest-Neighbour Queueing Models, a Review and an Example....Pages 141-152
M/G/1 Queues with FCFS Negative Arrivals....Pages 153-160
Operational Analysis of Timed Petri Nets and Application to the Computation of Performance Bounds....Pages 161-174
Approximate Throughput Computation of Stochastic Marked Graphs....Pages 175-188
Front Matter....Pages 189-189
Allocation of Customer Types to Servers: Clustering is Optimal....Pages 191-205
Majorization and Stochastic Comparison Techniques for Scheduling of Parallel Systems....Pages 206-219
Dependability of Distributed Programs: Algorithms and Performance....Pages 220-236
A Fixed-Point Model of a Distributed Memory Consistency Protocol....Pages 237-247
Routing Among Different Nodes Where Servers Break Down Without Losing Jobs....Pages 248-261
Modeling Symmetric Computer Architectures by SWNs....Pages 262-275
Arrival Theorems for Product-Form Stochastic Petri Nets....Pages 276-289
Back Matter....Pages 291-299

✦ Subjects

Computing Methodologies