Scribd Logo
Upload

Welcome to Scribd!

  • 13 views

    Parallel Computing

    Uploaded by

    savitaarthegodspeed

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Parallel Computing

    Uploaded by

    savitaarthegodspeed
    13 views3 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    13 views3 pages

    Parallel Computing

    Uploaded by

    savitaarthegodspeed

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 3

    CO3 CD1, CD2, CD3,CD6,CD7

    CO4 CD1, CD3,CD6,CD7


    CO5 CD1,CD2,CD3,CD4,CD5,CD7

    SPECIALIZATION IV: HIGH PERFORMANCE COMPUTING

    COURSE INFORMATION SHEET

    Course code: CS421


    Course title: PARALLEL COMPUTING
    Page 422 of 439
    Pre-requisite(s): CS203 Computer Organization and Architecture, CS206Design and Analysis of
    Algorithm
    Co-requisite(s):
    Credits: L:3 T:0 P:0
    Class schedule per week: 3
    Class: B. Tech
    Semester / Level: IV
    Branch: CSE/IT

    Course Objectives
    This course enables the students to:

    1. Learn different types of parallelisms achieved over different computer models


    2. Write parallel algorithms (and programs) for computer problems
    3. Map parallel algorithms from architecture to architecture
    4. Identify the issues in concurrency control

    Course Outcomes
    After the completion of this course, students will be able to:

    1. Explain the need of concurrent execution of problems


    2. Solve the issues related to concurrency control
    3. Interpret the parallel algorithm from organization to organization
    4. Make familiar with a range of parallel algorithms on different architectures.
    5. Apply the concept parallelism in solving the problems of different domains

    SYLLABUS:
    Module I
    Introduction: Parallel Processing Environment- Pipelining and Data Parallelism, Flynn’s
    Taxonomy, Speedup, Scaled Speedup, Analyzing parallel algorithms, P-RAM Algorithms. (8L)

    Module II
    Processor Array, MIMD: Multiprocessors (shared) and Multi-computers (distributed),
    Networks(Processor organizations):Static and dynamic Interconnection Networks, Message
    Transferring procedures. (8L)

    Module III
    Mapping and Scheduling, Dynamic Load Balancing on Multi-computers, Static Scheduling on
    UMA Multiprocessors, Parallel Programming model using process and thread, Deadlock and
    Synchronization issues. (8L)

    Module IV

    Page 423 of 439


    Elementary Parallel Algorithm: Matrix Multiplication: Sequential Matrix Multiplication,
    Algorithms for Processor Array, Algorithms for Multiprocessors, Algorithms for Multi-
    computers. (8L)
    Module V
    Solving set of linear equations: Gaussian Elimination, The Jacobi Algorithm, Sorting algorithms:
    Enumeration Sort, ODD-EVEN Transposition sort, BITONIC Merge, Quicksort Based
    Algorithms. (8L)

    TEXT BOOK:
    Quin M. J., “Parallel Computing: Theory and Practice”, McGraw Hill, New York, 1994.

    REFERENCE BOOKS:
    1. Akl Selim G., “The Design and Analysis of Parallel Algorithms”, Prentice Hall
    International.
    2. Sasikumar M., Shikhare D. and Prakash P. Ravi, “Introduction to Parallel Processing”, PHI,
    2006.
    Gaps in the syllabus (to meet Industry/Profession requirements):N/A
    POs met through Gaps in the Syllabus:N/A
    Topics beyond syllabus/Advanced topics/Design:N/A
    POs met through Topics beyond syllabus/Advanced topics/Design:N/A

    Course Outcome (CO) Attainment Assessment Tools and Evaluation Procedure:


    Direct Assessment
    Assessment Tools % Contribution during CO Assessment

    Continuous Internal Assessment 50

    Semester End Examination 50

    Continuous Internal Assessment % Distribution

    Mid semester examination 25

    Two quizzes 20 (2×10)

    Teacher’s Assessment 5

    Assessment Components CO1 CO2 CO3 CO4 CO5

    Continuous Internal Assessment √ √ √ √ √

    Semester End Examination √ √ √ √ √

    Indirect Assessment
    1. Student Feedback on Faculty
    2. Student Feedback on Course

    Course Delivery Methods


    CD1 Lecture by use of boards/LCD projectors/OHP projectors

    Page 424 of 439

    You might also like