Add to ORKGRapport de recherche de l'EHEI. Université René Descartes.National audienceBilogic 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
We consider parallel random access machines (PRAM's) with p processors and distributed systems of ra...
We show the polynomial solvability of the PERT-COST project scheduling problem in the case of: (i) t...
We show that some classical P-complete problems can be solved efficiently in average NC. The probabi...
Abstract The classical PERT approach uses the path with the largest expected duration as the critica...
Since its invention in 1958, Program Evaluation and Review Technique (PERT) has been widely used dur...
Abstract—The way the processes in a parallel program are scheduled on the processors of a multiproce...
SIGLEAvailable from British Library Document Supply Centre- DSC:DX77024 / BLDSC - British Library Do...
The first part of this dissertation is concerned with the study of the detailed structure of network...
In this thesis we study the behavior of parallel applications represented by a precedence graph. The...
The analytical evaluation of the completion time distribution of a general directed acyclic graph (D...
The cluster systems used today usually prohibit that a running process on one node is reallocated ...
Abstract. Random networks are widely used for modeling and analyz-ing complex processes. Many mathem...
We obtain stochastic bounds on execution times of parallel computations assuming ideal conditions fo...
this paper. The project starts at the initial node and ends at the terminal node. A path is a set of...
. In this paper we mainly focus on the study of the parallelization of PCGLS, a basic iterative meth...
We consider parallel random access machines (PRAM's) with p processors and distributed systems of ra...
We show the polynomial solvability of the PERT-COST project scheduling problem in the case of: (i) t...
We show that some classical P-complete problems can be solved efficiently in average NC. The probabi...
Abstract The classical PERT approach uses the path with the largest expected duration as the critica...
Since its invention in 1958, Program Evaluation and Review Technique (PERT) has been widely used dur...
Abstract—The way the processes in a parallel program are scheduled on the processors of a multiproce...
SIGLEAvailable from British Library Document Supply Centre- DSC:DX77024 / BLDSC - British Library Do...
The first part of this dissertation is concerned with the study of the detailed structure of network...
In this thesis we study the behavior of parallel applications represented by a precedence graph. The...
The analytical evaluation of the completion time distribution of a general directed acyclic graph (D...
The cluster systems used today usually prohibit that a running process on one node is reallocated ...
Abstract. Random networks are widely used for modeling and analyz-ing complex processes. Many mathem...
We obtain stochastic bounds on execution times of parallel computations assuming ideal conditions fo...
this paper. The project starts at the initial node and ends at the terminal node. A path is a set of...
. In this paper we mainly focus on the study of the parallelization of PCGLS, a basic iterative meth...
We consider parallel random access machines (PRAM's) with p processors and distributed systems of ra...
We show the polynomial solvability of the PERT-COST project scheduling problem in the case of: (i) t...
We show that some classical P-complete problems can be solved efficiently in average NC. The probabi...