The tradeoff between speedup and efficiency that is inherent to a software system is
investigated. The extent to which this tradeoff is determined by the average parallelism of the …

Discrete event dynamical systems are used to model a number of engineering applications
ranging from communication networks, distributed computing systems to manufacturing …

Stochastic bounds are obtained on execution times of parallel programs when the number of
processors is unlimited. A parallel program is considered to consist of interdependent tasks …

The task graph of a parallel computation is modeled by a random, acyclic, directed graph (K,
p) where K is the number of nodes and p is the probability that an arc exists between two …

Introduces queuing network models for the performance analysis of SPMD (single-program,
multiple-data) applications executed on general-purpose parallel architectures such as …

We define and evaluate two policies (NA-policy, A-policy) for parallel execution of program
tree structures. Via a probabilistic model we analytically determine, for each policy, the …

Discrete-event systems are used to model a number of engineering applications ranging
from performance analysis of large scale communication networks, computer-aided-design …

We consider a queuing system in which arriving tasks are interrelated by an acyclic
precedence graph representing the order in which executions must take place. The number …

Structures of parallel programs are usually represented by task graphs in the scheduling
literature. Such graphs are sometimes obtained at compile time. In many other cases …

The speed-up obtained by the use of multiprocessor systems is of major importance for
numerical applications involving the solution of large dense systems of linear equations. We …