Stochastic automata network of modeling parallel systems

Author

Plateau, Brigitte ; Atif, Karim

Author_Institution

IMAG-Groupe Calcul Parallele, Grenoble, France

Volume

17

Issue

10

fYear

1991

fDate

10/1/1991 12:00:00 AM

Firstpage

1093

Lastpage

1108

Abstract

A methodology for modeling a system composed of parallel activities with synchronization points is proposed. Specifically, an approach based on a modular state-transition representation of a parallel system called the stochastic automata network (SAN) is developed. The state-space explosion is handled by a decomposition technique. The dynamic behavior of the algorithm is analyzed under Markovian assumptions. The transition matrix of the chain is automatically derived using tensor algebra operators, under a format which involves a very limited storage cost

Keywords

parallel algorithms; parallel architectures; performance evaluation; stochastic automata; Markovian assumptions; SAN; decomposition technique; modular state-transition representation; parallel activities; parallel system; state-space explosion; stochastic automata network; storage cost; synchronization points; tensor algebra operators; transition matrix; Algebra; Algorithm design and analysis; Automata; Costs; Explosions; Matrix decomposition; Stochastic systems; Storage area networks; Storage automation; Tensile stress;

fLanguage

English

Journal_Title

Software Engineering, IEEE Transactions on

Publisher

ieee

ISSN

0098-5589

Type

jour

DOI

10.1109/32.99196

Filename

99196