A performance model of block structured parallel programs
Proceedings of the international workshop on Parallel algorithms & architectures
Performance and Reliability Analysis Using Directed Acyclic Graphs
IEEE Transactions on Software Engineering
On stability and performance of parallel processing systems
Journal of the ACM (JACM)
Stability condition of a service system with precedence constraints between tasks
Performance Evaluation
An approximation of the processing time for a random graph model of parallel computation
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
On the Execution of Programs by Many Processors
Performance '83 Proceedings of the 9th International Symposium on Computer Performance Modelling, Measurement and Evaluation
Stochastic performance models of parallel task systems (extended abstract)
SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Analyzing the expected execution times of parallel programs
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Parallelising large irregular programs: an experience with Naira
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Software engineering: Systems and tools
Stochastic Bounds for Parallel Program Execution Times with Processor Constraints
IEEE Transactions on Computers
Performance evaluation of non-Markovian stochastic event graphs
PNPM '95 Proceedings of the Sixth International Workshop on Petri Nets and Performance Models
Parallel program performance prediction using deterministic task graph analysis
ACM Transactions on Computer Systems (TOCS)
Low-Cost Static Performance Prediction of Parallel Stochastic Task Compositions
IEEE Transactions on Parallel and Distributed Systems
Journal of Parallel and Distributed Computing - Special issue on parallel bioinspired algorithms
Performance modeling and analysis of correlated parallel computations
Parallel Computing
Closed form absorption time bounds
EPEW'07 Proceedings of the 4th European performance engineering conference on Formal methods and stochastic models for performance evaluation
A precedence PEPA model for performance and reliability analysis
EPEW'06 Proceedings of the Third European conference on Formal Methods and Stochastic Models for Performance Evaluation
| Hi-index | 0.01 |
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 with synchronization constraints. These constraints are described by an acyclic directed graph called a task graph. The execution times of tasks are considered to be independently identically distributed (i.i.d.) random variables. The performance measure of interest is the overall execution of the considered parallel program (task graph). Stochastic bound methods are applied to obtain lower and upper bounds on this measure. Another upper bound is obtained for parallel programs having 'new better than used in expectation' (NBUE) random variables as task execution times. NBUE random variables are replaced with exponential random variables of the same mean to derive this upper bound.