CSC802: Distributed Computing Syllabus for CS 8th Sem 2019 Pattern Mumbai University

Distributed Computing detailed syllabus scheme for Computer Engineering (CS), 2019 regulation has been taken from the University of Mumbai official website and presented for the Bachelor of Engineering students. For Course Code, Course Title, Test 1, Test 2, Avg, End Sem Exam, Team Work, Practical, Oral, Total, and other information, do visit full semester subjects post given below.

For all other Mumbai University Computer Engineering 8th Sem Syllabus 2019 Pattern, do visit CS 8th Sem 2019 Pattern Scheme. The detailed syllabus scheme for distributed computing is as follows.

Distributed Computing Syllabus for Computer Engineering BE 8th Sem 2019 Pattern Mumbai University

Course Objectives:

For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier.
.

Course Outcomes:

On successful completion of course learner will be able to:

1. Demonstrate knowledge of the basic elements and concepts related to distributed system technologies;
2. Illustrate the middleware technologies that support distributed applications such as RPC, RMI and Object based middleware.
3. Analyze the various techniques used for clock synchronization and mutual exclusion
4. Demonstrate the concepts of Resource and Process management and synchronization algorithms
5. Demonstrate the concepts of Consistency and Replication Management
6. Apply the knowledge of Distributed File System to analyze various file systems like NFS, AFS and the experience in building large-scale distributed applications.

Prerequisites:

Java Programming, Operating Systems, Computer Networks

Module 1

Introduction to Distributed Systems 06

1. Characterization of Distributed Systems: Issues, Goals, and Types of distributed systems, Distributed System Models, Hardware concepts, Software Concept.
2. Middleware: Models of Middleware, Services offered by middleware, Client Server model.

Module 2

For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier.
.

Module 3

Synchronization 10

1. Clock Synchronization, Logical Clocks, Election Algorithms, Mutual Exclusion, Distributed Mutual Exclusion-Classification of mutual Exclusion Algorithm, Requirements of Mutual Exclusion Algorithms, Performance measure.
2. Non Token based Algorithms: Lamport Algorithm, Ricart-Agrawalas Algorithm, Maekawas Algorithm
3. Token Based Algorithms: Suzuki-Kasamis Broardcast Algorithms, Singhals Heurastic Algorithm, Raymonds Tree based Algorithm, Comparative Performance Analysis.

Module 4

Resource and Process Management 06

1. Desirable Features of global Scheduling algorithm, Task assignment approach, Load balancing approach, load sharing approach
2. Introduction to process management, process migration, Threads, Virtualization, Clients, Servers, Code Migration

Module 5

Consistency, Replication and Fault Tolerance 08

1. Introduction to replication and consistency, Data-Centric and ClientCentric Consistency Models, Replica Management
2. Fault Tolerance: Introduction, Process resilience, Reliable client-server and group communication, Recovery

Module 6

For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier.
.

Assessment

Internal Assessment: Assessment consists of two class tests of 20 marks each. The first class test is to be conducted when approx. 40% syllabus is completed and second class test when additional 40% syllabus is completed. Duration of each test shall be one hour. End Semester Theory Examination:

1. Question paper will comprise of 6 questions, each carrying 20 marks.
2. The students need to solve total 4 questions.
3. Question No.1 will be compulsory and based on entire syllabus.
4. Remaining question (Q.2 to Q.6) will be selected from all the modules.

Text Books:

1. Andrew S. Tanenbaum and Maarten Van Steen, Distributed Systems: Principles and Paradigms, 2nd edition, Pearson Education.
2. George Coulouris, Jean Dollimore, Tim Kindberg, , “Distributed Systems: Concepts and Design”, 4th Edition, Pearson Education, 2005.

Reference Books:

1. A. S. Tanenbaum and M. V. Steen, “Distributed Systems: Principles and Paradigms”, Second Edition, Prentice Hall, 2006.
2. M. L. Liu, Distributed Computing Principles and Applications, Pearson Addison Wesley, 2004.

For detail syllabus of all other subjects of Computer Engineering (CS) 8th Sem 2019 regulation, visit CS 8th Sem Subjects syllabus for 2019 regulation.