Performance Evaluation of a Blackboard Using Stochastic Petri Nets

1 October 1995

journal article
other
Published by SAGE Publications in SIMULATION

Vol. 65 (4) , 269-278
https://doi.org/10.1177/003754979506500404

Abstract

In this paper, a general blackboard based system is studied using Stochastic Petri Nets (SPN). We show how the dynamic behavior of the blackboard can be modeled, and analyze the marking graph of the resulting stochastic Petri net. The net is simulated with respect to the number of available processors, the event interarrival time and the average unification time, and performance results are presented.

Keywords

This publication has 10 references indexed in Scilit:

On the semantics of μ Log
Future Generation Computer Systems, 1994
Properties and performance bounds for closed free choice synchronized monoclass queueing networks
IEEE Transactions on Automatic Control, 1991
Distributed shared memory: a survey of issues and algorithms
Computer, 1991
Real-time systems performance in the presence of failures
Computer, 1991
The concurrent language, Shared Prolog
ACM Transactions on Programming Languages and Systems, 1991
Stochastic high-level Petri nets and applications
IEEE Transactions on Computers, 1988
On Petri nets with deterministic and exponentially distributed firing times
Published by Springer Nature ,1987
Generative communication in Linda
ACM Transactions on Programming Languages and Systems, 1985
A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems
ACM Transactions on Computer Systems, 1984
Performance Analysis Using Stochastic Petri Nets
IEEE Transactions on Computers, 1982