By Topic

The complexity of performance analysis in parallel algorithms and systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Iazeolla, G. ; Rome II Univ., Italy

The computational complexity of analyzing the performance of parallel algorithms and concurrent systems is addressed. The type and origin of this complexity are discussed, and the way to deal with it is investigated. Based on a symbolic notation of the large Markovian state-space, an approach is proposed which takes advantage of computer algebra and symbol-manipulation languages to collapse the state space, restructure it, and introduce efficient methods for a global balance equation solution, based on either closed-form or on low-cost Gaussian elimination techniques. The approach is compared to conventional methods for solving large Markovian systems, such as the decomposition and aggregation method and the stochastic Petri net method

Published in:

CompEuro '91. Advanced Computer Technology, Reliable Systems and Applications. 5th Annual European Computer Conference. Proceedings.

Date of Conference:

13-16 May 1991