Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Evaluation of Parallel Programs Completion Time using Bilogic PERT Networks

Abstract : Bilogic PERT networks can be used to model the execution of parallel and/or sequential programs. If the various tasks composing the program are given random durations, the problem of computing the program completion time is NP-hard. We describe a low polynomial complexity algorithm that provides bounds and approximations of the completion time using properties of integral orderings among random variables. The algorithm is tested on some examples of large graphs and proves to be satisfactory.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-01126238
Contributor : Laboratoire Cedric <>
Submitted on : Friday, March 6, 2015 - 11:47:03 AM
Last modification on : Friday, December 13, 2019 - 12:44:06 PM

Identifiers

  • HAL Id : hal-01126238, version 1

Collections

Citation

Pierre Cubaud. Evaluation of Parallel Programs Completion Time using Bilogic PERT Networks. 1991. ⟨hal-01126238⟩

Share

Metrics

Record views

41