Skip to main content
Springer Nature Link
Log in

Parallel algorithms for analyzing activity networks

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

Parallel algorithms for analyzing activity networks are proposed which include feasibility test, topological ordering of the events, and computing the earliest and latest start times for all activities and hence identification of the critical activities of the activity network. The first two algorithms haveO(logn) time complexity and the remaining one achievesO(logd log logn) time bound, whered is the diameter of the digraph representing the activity network withn nodes. All these algorithms work on a CRCW PRAM and requireO(n 3) processors.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. J. Atallah and S. R. Kosaraju,Graph problems on a mesh-connected processor array, J. ACM, 31; (1984), pp. 649–667.

    Google Scholar 

  2. A. Borodin and J. E. Hopcroft,Routing, merging and sorting on parallel models of computation, Proc. 14th ACM Symp. on Theory of Comput., (1982), pp. 338–344.

  3. P. Chaudhuri,Distributed algorithm for analysing activity networks, Int. J. Electronics, 60; (1986), pp. 603–607.

    Google Scholar 

  4. E. Dekel, D. Nassimi and S. Sahni,Parallel matrix and graph algorithms, SIAM J. Comput., 10; (1981), 657–675.

    Google Scholar 

  5. N. Deo,Graph Theory with Applications to Engineering and Computer Science, Prentice Hall, Inc., Englewood Cliffs, NY, (1974).

    Google Scholar 

  6. R. K. Ghosh and G. P. Bhattacharjee,A parallel search algorithm for directed acyclic graphs, BIT 24; (1984), pp. 134–150.

    Google Scholar 

  7. B. E. Gillett,Introduction of Operations Research — a Computer Oriented Algorithmic Approach, McGraw-Hill, Inc. NY, (1976).

    Google Scholar 

  8. P. Mateti and N. Deo,Parallel algorithms for the single source shortest path problem, Computing, 29; (1982), pp. 31–49.

    Google Scholar 

  9. Y. Shiloach and U. Vishkin,Finding the maximum, merging and sorting in a parallel computation model, J. Algorithms, 2; (1981), pp. 88–102.

    Google Scholar 

  10. R. E. Tarjan and U. Vishkin,An efficient parallel biconnectivity algorithm, TR-69, Dept. of Comp. Sci., Courant Institute, NYU, (1983).

  11. D. Y. Yeh and D. T. Lee,Graph algorithms on a tree structured parallel computer, BIT 24; (1984), pp. 333–340.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Pranay Chaudhuri & Ratan K. Ghosh

  2. Department of Computer Science and Engineering, Indian Institute of Technology, 208016, Kanpur, India

    Pranay Chaudhuri & Ratan K. Ghosh

Authors
  1. Pranay Chaudhuri
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Ratan K. Ghosh
    View author publications

    You can also search for this author inPubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chaudhuri, P., Ghosh, R.K. Parallel algorithms for analyzing activity networks. BIT 26, 418–429 (1986). https://doi.org/10.1007/BF01935049

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01935049

CR Categories

Keywords