Evaluation of Parallel Programs Completion Time using Bilogic PERT Networks - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 1991

Evaluation of Parallel Programs Completion Time using Bilogic PERT Networks

Résumé

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.
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : hal-01126238 , version 1

Citer

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

Collections

CNAM CEDRIC-CNAM
31 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More