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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
