Parallel algorithm for analysing activity networks on a tree-structured computer |
| |
| Authors: | PRANAY CHAUDHURI |
| |
| Affiliation: | Department of Computer Science , James Cook University of North Queensland , Townsville, Q4811, Australia |
| |
| Abstract: | A parallel algorithm for analysing activity networks is presented that works on a tree-structured parallel computer. The time complexity of the algorithm is 0(n 2/ p + n log p) with p (1 ≤ p ≤ n) processors for an activity network with n events (nodes). It is shown that the cost of this algorithm, which is the product of the parallel running time and the number of processors used, is less than that of each of the existing parallel algorithms for the same problem by at least a factor of n. |
| |
| Keywords: | |
|
|
