Evaluation of Parallel Programs Completion Time using Bilogic PERT Networks - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 1991

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.
No file

Dates and versions

hal-01126238 , version 1 (06-03-2015)

Identifiers

  • HAL Id : hal-01126238 , version 1

Cite

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

Collections

CNAM CEDRIC-CNAM
27 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More