8th Sem, CSE

Parallel Algorithms Cse 8th Sem Syllabus for BE 2017 Regulation Anna Univ (Professional Elective V)

Parallel Algorithms Cse 8th Sem Syllabus for BE 2017 Regulation Anna Univ (Professional Elective V) detail syllabus for Computer Science & Engineering (Cse), 2017 regulation is collected from the Anna Univ official website and presented for students of Anna University. The details of the course are: course code (CS8001), Category (PE), Contact Periods/week (3), Teaching hours/week (3), Practical Hours/week (0). The total course credits are given in combined syllabus.

For all other cse 8th sem syllabus for be 2017 regulation anna univ you can visit Cse 8th Sem syllabus for BE 2017 regulation Anna Univ Subjects. For all other Professional Elective V subjects do refer to Professional Elective V. The detail syllabus for parallel algorithms is as follows.

Course Objective:

  • To understand different parallel architectures and models of computation.
  • To introduce the various classes of parallel algorithms.
  • To study parallel algorithms for basic problems.

Unit I

For complete syllabus and results, class timetable and more pls download iStudy. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.

Unit II

Pram Algorithms
Parallel Algorithms for Reduction – Prefix Sum – List Ranking -Preorder Tree Traversal -Searching -Sorting – Merging Two Sorted Lists – Matrix Multiplication – Graph Coloring -Graph Searching.

Unit III

Simd Algorithms – I
2D Mesh SIMD Model – Parallel Algorithms for Reduction – Prefix Computation – Selection -Odd-Even Merge Sorting – Matrix Multiplication

Unit IV

For complete syllabus and results, class timetable and more pls download iStudy. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.

Unit V

Mimd Algorithms
UMA Multiprocessor Model -Parallel Summing on Multiprocessor- Matrix Multiplication on Multiprocessors and Multicomputer – Parallel Quick Sort – Mapping Data to Processors.

Course Outcome:

Upon completion of this course, the students should be able to

  • Develop parallel algorithms for standard problems and applications.
  • Analyse efficiency of different parallel algorithms.

Text Books:

  1. Michael J. Quinn, “Parallel Computing : Theory and Practice”, Tata McGraw Hill Edition, Second edition, 2017.
  2. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, “Fundamentals of Computer Algorithms”, University press, Second edition , 2011.
  3. V Rajaraman, C Siva Ram Murthy, ” Parallel computers- Architecture and Programming “, PHI learning, 2016.

References:

  1. Ananth Grame, George Karpis, Vipin Kumar and Anshul Gupta, “Introduction to Parallel Computing”, 2nd Edition, Addison Wesley, 2003.
  2. M Sasikumar, Dinesh Shikhare and P Ravi Prakash , ” Introduction to Parallel Processing”, PHI learning , 2013.
  3. S.G.Akl, “The Design and Analysis of Parallel Algorithms”, PHI, 1989.

For detail syllabus of all other subjects of BE Cse, 2017 regulation do visit Cse 8th Sem syllabus for 2017 Regulation.

Dont forget to download iStudy for latest syllabus and results, class timetable and more.

Leave a Reply

Your email address will not be published. Required fields are marked *

*

This site uses Akismet to reduce spam. Learn how your comment data is processed.