An adaptive parallel algorithm for analyzing activity networks

A parallel algorithm for analyzing activity networks is presented. The model of computation is a shared memory single-instruction-stream, multiple-data-stream computer that does not allow read or write conflicts. The algorithm is adaptive in the sense that it takes O(n¹’+^h) time with n¹’-^h processors for an activity network with n events (nodes), where h (0•h•1) depends on the number of available processors.