An adaptive parallel algorithm for analyzing activity networks

  • Authors:

  • Pranay Chaudhuri

  • Affiliations:

  • Department of Electronics and Electrical Communication Engineering, Indian Institute of Technology, Kharagpur 721302, India

  • Venue:
  • Operations Research Letters
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

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^1^+^h) time with n^1^-^h processors for an activity network with n events (nodes), where h (0=