GLOBAL
INSTITUTE OF ENGINEERING AND TECHNOLOGY
# 257/1, Bangalore - Chennai Highway, Melvisharam, Vellore District.
COURSE INFORMATION SHEET
Course/Branch : B.E –CSE & IT Total no. of hours given in syllabus:
Subject Code : CS3551 Lecture : 45
Subject Title : Distributed Computing Tutorials : 0
Year/Semester : IIi/v Practical : 0
Faculty Name : Mr.J.SAMANTHISVARAN TOTAL : 45
SYLLABUS:
UNIT DETAILS HOURS
Introduction: Definition-Relation to Computer System Components – Motivation
– Message -Passing Systems versus Shared Memory Systems – Primitives for
Distributed Communication – Synchronous versus Asynchronous Executions –
I Design Issues and Challenges; A Model of Distributed Computations: A
09
Distributed Program – A Model of Distributed Executions – Models of
Communication Networks – Global State of a Distributed System.
Logical Time: Physical Clock Synchronization: NTP – A Framework for a
System of Logical Clocks – Scalar Time – Vector Time; Message Ordering and
Group Communication: Message Ordering Paradigms – Asynchronous
II Execution with Synchronous Communication – Synchronous Program Order on 09
Asynchronous System – Group Communication – Causal Order – Total Order;
Global State and Snapshot Recording Algorithms: Introduction – System Model
and Definitions – Snapshot Algorithms for FIFO Channels.
Distributed Mutual exclusion Algorithms: Introduction – Preliminaries –
Lamport’s algorithm – Ricart- Agrawala’s Algorithm –– Token-Based
III Algorithms – Suzuki-Kasami’s Broadcast Algorithm; Deadlock Detection in 09
Distributed Systems: Introduction – System Model – Preliminaries – Models of
Deadlocks – Chandy-Misra-Haas Algorithm for the AND model and OR Model.
Consensus and Agreement Algorithms: Problem Definition – Overview of
Results – Agreement in a Failure-Free System(Synchronous and Asynchronous)
– Agreement in Synchronous Systems with Failures; Checkpointing and
IV Rollback Recovery: Introduction – Background and Definitions – Issues in
09
Failure Recovery – Checkpoint-based Recovery – Coordinated Checkpointing
Algorithm - - Algorithm for Asynchronous Checkpointing and Recovery
V Definition of Cloud Computing – Characteristics of Cloud – Cloud Deployment 09
1
Models – Cloud Service Models – Driving Factors and Challenges of Cloud –
Virtualization – Load Balancing – Scalability and Elasticity – Replication –
Monitoring – Cloud Services and Platforms: Compute Services – Storage
Services – Application Services
TOTAL HOURS 45
TEXT BOOKS:
T BOOK TITLE/AUTHORS/PUBLICATION
Kshemkalyani Ajay D, Mukesh Singhal, “Distributed Computing: Principles, Algorithms and
1
Systems”, Cambridge Press, 2011. (Unit I)
2 Mukesh Singhal, Niranjan G Shivaratri, “Advanced Concepts in Operating systems”, Mc- Graw
Hill Publishers, 1994. (Units II and III)
3 Jake VanderPlas, “Python Data Science Handbook”, O’Reilly, 2016. (Units IV and V)
REFERENCE BOOKS:
R BOOK TITLE/AUTHORS/PUBLICATION
1 Allen B. Downey, “Think Stats: Exploratory Data Analysis in Python”, Green Tea
Press,2014
Pradeep L Sinha, “Distributed Operating Systems: Concepts and Design”, Prentice Hall of India,
2 2007.
Tanenbaum A S, Van Steen M, “Distributed Systems: Principles and Paradigms”, Pearson
3 Education, 2007.
Liu M L, “Distributed Computing: Principles and Applications”, Pearson Education, 2004.
4
Nancy A Lynch, “Distributed Algorithms”, Morgan Kaufman Publishers, 2003.
5
Arshdeep Bagga, Vijay Madisetti, “ Cloud Computing: A Hands-On Approach”, Universities
6 Press, 2014.
COURSE PRE-REQUISITES:
C.CODE COURSE NAME DESCRIPTION SEM
CS3351 DISTRIBUTED COMPUTING You'll explore the evolution of the 5
fields of data science and predictive
analytics. You'll learn up-to-date
2
techniques for data retrieval,
preparation, analysis and
visualization.
COURSE OBJECTIVES:
1. To introduce the computation and communication models of distributed systems.
2. To illustrate the issues of synchronization and collection of information in distributed systems.
3. To describe distributed mutual exclusion and distributed deadlock detection techniques.
4. To elucidate agreement protocols and fault tolerance mechanisms in distributed systems.
5. To explain the cloud computing models and the underlying concepts.
COURSE OUTCOMES:
CO203.1 - To introduce the computation and communication models of distributed systems.
CO203.2 - To illustrate the issues of synchronization and collection of information in distributed
systems.
CO203.3 - To describe distributed mutual exclusion and distributed deadlock detection techniques.
CO203.4 - To elucidate agreement protocols and fault tolerance mechanisms in distributed systems.
CO203.5 - To explain the cloud computing models and the underlying concepts.
CORELATION BETWEEN COURSE OUTCOMES AND PROGRAMME OUTCOMES
CO.
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
NO.
CO1 2 2 1 2 2 - - - 1 1 1 2
CO2 2 1 - 1 1 - - - 2 1 1 2
CO3 2 2 1 2 2 1 1 - 1 2 1 3
CO4 3 2 2 1 2 - - - 1 1 2 2
CO5 2 2 1 2 2 1 1 - 1 1 1 2
JUSTIFICATION FOR CORELATION
3
CO. NO RELATED
JUSTIFICATION
POs
PO1
CO1 Definition Relation to Computer System Components
PO3
PO1
CO2 A Model of Distributed Executions
PO5
PO1
CO3 Asynchronous Execution with Synchronous Communication
PO3
PO2
CO4 Design Issues and Challenges
PO3
PO2
CO5 Global State of a Distributed System
PO3
CORELATION BETWEEN COURSE OUTCOMES AND PROGRAMME SPECIFIC
OUTCOMES
CO. NO. PS01 PSO2 PSO3
CO1 2 2 2
CO2 2 3 1
CO3 2 2 3
CO4 3 3 2
CO5 2 2 2
CO6 2 2 2
JUSTIFICATION FOR CORELATION
CO. NO RELATED PSOs JUSTIFICATION
PSO1
CO1 Logical Time: Physical Clock Synchronization
PSO2
PSO1
CO2 Message Ordering and Group Communication
PSO2
PSO1
CO3 Distributed Mutual exclusion Algorithms
PSO3
4
CO4 PSO1 Asynchronous Execution with Synchronous Communication
PSO1
CO5 Deadlock Detection in Distributed Systems
PSO3
GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS:
SN DESCRIPTION PROPOSED
O ACTIONS
1 Physical Clock Synchronization Introduction provided.
An interactive session was
2 Group Communication done to familiarize concept
of information.
3 Real time Application using Distributed Computing Introduction provided.
TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:
Sl.No Topic Reason for introduction
Guide to mastering one of the
1 Global State of a Distributed System
most powerful tools
Algorithm for Asynchronous Checkpointing and Allowing it to learn more complex
2 features
Recovery
WEB SOURCE REFERENCES:
1 https://www.geeksforgeeks.org/
2 https://www.poriyaan.in/
,k3 https://www.scribd.com/
4 https://stucor.in/
5 https://www.javatpoint.com/
DELIVERY/INSTRUCTIONAL METHODOLOGIES:
CHALK & TALK STUD. WEB RESOURCES TUTORIAL
ASSIGNMENT
5
LCD/SMART STUD. SEMINARS https://www.poriyaan.in/
BOARDS
DELIVERY METHODS USED FOR EACH COURSE OUT COME
CO.
DELIVERY METHODS
NO.
CO1 CHALK & TALK, STUDENT
CO2 CHALK & TALK, STUDENT. ASSIGNMENT, TUTORIAL
CO3 CHALK & TALK , STUDENT.ASSIGNMENT, WEB RESOURCES
CO4 CHALK & TALK, WEB RESOURCES, TUTORIAL
CO5 CHALK & TALK, ASSIGNMENT , WEB RESOURCES
ASSESSMENT METHODOLOGIES-DIRECT
ASSIGNMENTS STUD. SEMINARS TESTS/MODEL UNIV.
EXAMS EXAMINATION
ASSESSMENT METHODOLOGIES-INDIRECT
STUDENT FEEDBACK ON FACULTY (ONCE)
ASSESSMENT METHODOLOGIES USED FOR EACH COURSE OUT COME
CO. NO. ASSESSMENT METHODOLOGIES- ASSESSMENT
DIRECT METHODOLOGIES-INDIRECT
ASSIGNMENTS, UNIV. EXAMINATION, STUD. SEMINARS, STUDENT FEEDBACK ON FACULTY
CO1 TESTS/MODEL EXAMS
UNIV. EXAMINATION, TESTS/MODEL EXAMS, STUDENT FEEDBACK ON FACULTY
CO2
UNIV. EXAMINATION, TESTS/MODEL EXAMS, STUDENT FEEDBACK ON FACULTY
CO3 ASSIGNMENTS
6
UNIV. EXAMINATION, TESTS/MODEL EXAMS STUDENT FEEDBACK ON FACULTY
CO4
ASSIGNMENTS, UNIV. EXAMINATION, TESTS/MODEL STUDENT FEEDBACK ON FACULTY
CO5 EXAMS
Prepared by Approved by
(Course Coordinator) (Programme Coordinator)
Mr.J.Samanthisvaran Dr.D.Udaya Suriya Rajkumar
Name and Signature Name and Signature
