Stochastic bounds for parallel program execution times with processor constraints

Authors:
Keqin Li
Affiliations:
-
Venue:
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Year:
1995

Citing 0
Cited 1

Probabilistic Analysis of Scheduling Precedence Constrained Parallel Tasks on Multicomputers with Contiguous Processor Allocation

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop some stochastic lower and upper bounds for parallel program execution times when there are limited processors. Such analysis can provide important information for job scheduling and resource allocation. For several typical classes of parallel programs, we derive very accurate closed form approximations for the bounds. Examples are also given to demonstrate the quality of the bounds.