Titlebook: Computer Performance Evaluation: Modelling Techniques and Tools; Modelling Techniques Günter Haring,Gabriele Kotsis Conference proceedings

博爱家

善于骗人

https://doi.org/10.1007/1-84628-286-1is of concurrent programs. The analysis is based on a formal model of the application. The class of models chosen is that of stochastic Petri nets (in particular we adopt Generalized Stochastic Petri Nets — GSPN [1]): starting from a concurrent program written in DISC (DIStributed C), an extension o

过多

Problem situation and research approach,This paper presents the performance works done before the Olympic Games of Barcelona‘92 in order to correctly size the computer system. Also it presents some measurements taken during the Games and the comparison between the estimation and the reality.

OTTER

Performance experiences of the Barcelona Olympic games computer system,This paper presents the performance works done before the Olympic Games of Barcelona‘92 in order to correctly size the computer system. Also it presents some measurements taken during the Games and the comparison between the estimation and the reality.

Pert敏捷

巡回

An Overview of Chinese Literary History,gate the impact of the CPU time requirements typical of the simulation of cell-based communication systems. The paper describes the main characteristics of the software tool and illustrates an application example.

Transfusion

Aurorae and the Zodiacal Light,sive part of the solution of GSPN models. Their implementation is fully integrated with a well-known tool for GSPN analysis (GreatSPN) and allows the solution of nets with up to several 10. states. The efficiency of the approach varies with the structure of the model under analysis.

CAMEO

消灭

Experiences on SIMD massively parallel GSPN analysis,sive part of the solution of GSPN models. Their implementation is fully integrated with a well-known tool for GSPN analysis (GreatSPN) and allows the solution of nets with up to several 10. states. The efficiency of the approach varies with the structure of the model under analysis.

monopoly

Waiting time distributions for processor sharing queues with state-dependent arrival and service ra the numerical approximation of waiting and response time distributions for processor sharing queues. Numerical examples are provided for open and closed M/M/N processor sharing queues. In particular the effect of the number of parallel processors on the response time distribution under the condition of fixed total service capacity is discussed.