Chat with us on WhatsAppCall Learnizo

KTU 2024 Scheme · Semester 4 · Program Elective I — Computer Science and Engineering (Cyber Security)

Introduction to Parallel & Distributed Programming (PECCT411) Syllabus

Official KTU 2024 Scheme syllabus for Introduction to Parallel & Distributed Programming, Semester 4, Program Elective I — Computer Science and Engineering (Cyber Security) (Computer Science and Engineering (Cyber Security)).

This page compiles APJ Abdul Kalam Technological University's officially published 2024 Scheme syllabus for Computer Science and Engineering (Cyber Security), Semester 4, sourced directly from KTU's official website (ktu.edu.in). Learnizo is an independent online tuition platform and is not affiliated with, endorsed by, or officially connected to APJKTU. The university may revise syllabus content after this page was last updated — always cross-check with the official KTU source for the current, authoritative version.

Course Code

PECCT411

Credits

3

Teaching Hours

3:0:0:0 (L:T:P:R)

CIE Marks

40

ESE Marks

60

Exam Duration

2 Hrs. 30 Min.

Prerequisites

None

Semester

Semester 4

Course Objective

Identify the models and frameworks best suited to various workloads. Constructing parallel and distributed applications, including testing, debugging and performance evaluation

Module-wise Syllabus

Module 1

9 contact hours

Distributed System: Definition, Relation to computer system components, Motivation, Primitives for distributed communication, Design issues, Challenges and applications. Leader election algorithm- Bully algorithm, Ring algorithm. Termination detection- Spanning tree-based algorithm.

Module 2

9 contact hours

Distributed mutual exclusion algorithms- System model, Requirements of mutual exclusion algorithm. Lamport's algorithm, Ricart- Agrawala algorithm, Quorum based mutual exclusion algorithms- Maekawa's algorithm. Token based algorithm- Suzuki-Kasami's broadcast algorithm.

Module 3

11 contact hours

Parallel Computing: Principles of Parallel Algorithm Design Decomposition Techniques, Characteristics of Tasks and interactions, Mapping techniques for load balancing. Basic Communication operations: One to All Broadcast and All to One Reduction, All to All Broadcast and Reduction, All Reduce And Prefix Sum operations, Scatter and Gather, All to All Personalized communication, Circular Shift, Improving the speed of some communication operation.

Module 4

7 contact hours

Principles of Message Passing Programming, The building blocks: Send and Receive Operations, MPI: The Message Passing Interface, Overlapping Communication with Computation, Collective Communication and Computation Operations, Groups and Communicators.

Course Outcomes

  • CO1Illustrate election algorithm and termination detection algorithm.
  • CO2Compare token based, non-token based and quorum based mutual exclusion algorithms
  • CO3Appreciate the communication models for parallel algorithm development
  • CO4Develop parallel algorithms using message passing paradigms.
  • CO5Demonstrate the fundamentals skills of heterogenous computing with shared memory architecture.

Assessment Pattern (CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation (CIE)

Attendance5
Assignment / Microproject15
Internal Examination 1 (Written)10
Internal Examination 2 (Written)10

End Semester Examination (ESE)

Total 60 marks, 2 Hrs. 30 Min.. See the official KTU syllabus document for the exact Part A / Part B question pattern for this course.

Textbooks & Reference Books

Textbooks

  • Introduction to Parallel Computing — AnanthGrama, Anshul Gupta, George Karypis, Vipin Kumar (Second edition,200 3, —)
  • Distributed Computing Principles, Algorithms, and Systems — Ajay D. Kshemkalyani University of Illinois at Chicago, Chicago and Mukesh Singhal University of Kentucky, Lexington (Cambridge University Press, First Edition,200 8)
  • Distributed system — Maarten van Steen Andrew S Tanebaum (Pearson Education,Inc., Third edition,2017)

Reference Books

  • The Art of Multiprocessor Programming — Maurice Herlihy and NirShavit (Morgan Kaufmann Publishers, 2008)
  • Principles of Parallel Programming — C. Lin, L. Snyder, Addison-Wesley (2009, —)
  • Distributed Systems: Concepts and Design — George Coulouris, Jean Dollimore, Tim Kindberg and Gordon Blair (Addison Wesley, Fifth edition)
  • An Introduction to Distributed Algorithms — Valmir C. Barbosa (MIT Press, 2003)

Frequently Asked Questions

How many credits is KTU Introduction to Parallel & Distributed Programming (PECCT411)?

3 credits, with 3:0:0:0 (L:T:P:R) teaching hours per week, under the KTU 2024 Scheme.

How many modules are in the PECCT411 syllabus?

4 modules, 36 total contact hours.

What is the CIE and ESE mark split for this course?

CIE (Continuous Internal Evaluation): 40 marks. ESE (End Semester Examination): 60 marks, 2 Hrs. 30 Min.. Total: 100 marks.

What are the recommended textbooks for PECCT411?

Introduction to Parallel Computing (AnanthGrama, Anshul Gupta, George Karypis, Vipin Kumar); Distributed Computing Principles, Algorithms, and Systems (Ajay D. Kshemkalyani University of Illinois at Chicago, Chicago and Mukesh Singhal University of Kentucky, Lexington); Distributed system (Maarten van Steen Andrew S Tanebaum).

Is this syllabus specific to one branch, or common to others too?

This Semester 4 course is listed under Program Elective I — Computer Science and Engineering (Cyber Security) at KTU under the 2024 Scheme — check the course header above for which branches it's common to.

Need help with KTU Introduction to Parallel & Distributed Programming?

Learnizo offers live, 1-on-1 online tuition for KTU CS Cyber Security subjects — matched to your exact module and semester.