You are here

Home » Content

Applying Program Evaluation and Review Technique to Parallel Computing

Journal Name:

  • International Journal of Science and Engineering Investigations

Publication Year:

  • 2016

Key Words:

Author NameUniversity of Author
Abstract (2. Language): 
Using Amdahl’s Law it is possible to estimate the upper bound for parallel speedup. In deriving the Law it is assumed that the considered application can use limitless number of processors so that the processing time of the code parallel fraction can be reduced to 0. In real applications it is more useful to calculate the shortest parallel computing time and the required number of processors. This can be accomplished by using the ideas related to the methods of Program Evaluation and Review Technique and critical path in directed acyclic graphs representing parallel algorithms. We can calculate the number of processors needed to process parallel code in the shortest time. We call this number the critical number of processors.
Bookmark/Search this post with
FULL TEXT (PDF): 
PDF icon arastirmax-applying-program-evaluation-and-review-technique-parallel-computing.pdf
  • 12
64
67
  • English

REFERENCES

References: 

[1] B. Ralph Stauber, H. M. Douty, Willard Fazar, Richard H. Jordan, William Weinfeld and Allen D. Manvel. Federal Statistical Activities. The American Statistician 13(2): 9-12 (Apr., 1959), pp. 9-12
[2] Malcolm, D. G, J. H. Roseboom, C. E. Clark, W. Fazar Application of a Technique for Research and Development Program Evaluation
International Journal of Science and Engineering Investigations, Volume 5, Issue 59, December 2016 67
www.IJSEI.com Paper ID: 55916-07
ISSN: 2251-8843
OPERATIONS RESEARCH Vol. 7, No. 5, September–October 1959, pp. 646–669
[3] Klastorin, Ted (2003). Project Management: Tools and Trade-offs (3rd ed.). Wiley. ISBN 978-0-471-41384-4
[4] Project Management Institute (2013). A Guide to the Project Management Body of Knowledge (5th ed.). Project Management Institute. ISBN 978-1-935589-67-9.
[5] O. Pawlowski, M. Brewka,W. Majewski and J. Kowalik, “Pert Cpa, Cpm Task Networks and their analysis“ (in Polish), Wydawnictwo Morskie, 1967.
[6] R. P. Brent, ”The Parallel Evaluation of General Arithmetic Expressions”, Journal of the ACM, 1974.
[7] Arch D. Robinson, Michael McCool and James Reinders “Structured Parallel Programming: Patterns for Efficient Computation”, Elsevier Morgan Kaufmann, 2012.

Thank you for copying data from http://www.arastirmax.com