Coimbatore Institute of Technology

Coimbatore-14
Department of Information Technology
Lesson Plan / Course Information

Course Code Course Name Contact Hours

L T P C
15IT05 DISTRIBUTED SYSTEMS 3 0 0 3

Name of the Faculty : [Link]

Time Slot : Monday 1st hour ,Tuesday 2nd hour, Thursday 3rd hr
Faculty Cabin : IT Block IT -120

1. Course pre-requisites : NIL

2. Course learning objectives : To gain knowledge about the distributed system models and the
underlying techniques in handling various challenges in designing a distributed system.
3. Expected Level of Output : Conceptual And Design Level
4.
5. Department : Information Technology

6. Nature of the Course : Group 3 : 75% Descriptive & 25%Analytical

Continuous Internal Assessment (CIA) : 25 Marks

Semester End Examination (SEE) : 75 Marks

7. Course Input :

Instructi Level of
Text Book
Module

Chapter

onal Bloom’s
Hours Taxonomy
Description CO mapping

INTRODUCTION
Characterization of Distributed
Systems - Examples - Resource A 1 2 U
Sharing
15CI11 Computer Networks
I
Challenges Web - System Models A 2 3 U CO1
Architectural and Fundamental
Models A 2 3 U

Assignment – Case Study 1

PROCESSES AND DISTRIBUTED OBJECTS
Interprocess Communication - The
API for the Internet Protocols -
A 4 3 U
External Data Representation and
II Marshalling
C02
Client Server Communication -
A 4 1 U
Group Communication
Distributed Objects and Remote
A 5 3 AP
Invocation - Communication Between

1
 Coimbatore Institute of Technology
Coimbatore-14
Department of Information Technology
Lesson Plan / Course Information

Distributed Objects - Remote

Procedure Call
Assignment- Programs using
A 2 AP
RMI/RPC
OPERATING SYSTEM SUPPORT AND NAMING SERVICES

The OS Layer - Protection - Processes

and Threads - Communication and A 7 2 U
Invocation - OS Architecture
III Distributed File Systems: File Service CO3
A 7 2 U
Architecture

Name Services: Name Services and

the domain Name System-Directory A 7 3 U
Services

Assignment – File Services and

1 AP
Naming Services in Industry

SYNCHRONISATION AND MUTUAL EXCLUSION

Time and Global States : Clocks,
Events and Process States - A 14 3 U
Synchronizing Physical Clocks -
Logical Time And Logical Clocks -
A 14 3 U
IV Global States
Coordination and Agreement : CO4
Distributed Mutual Exclusion - A 15 1 U
Elections
Multicast Communication -Consensus
A 15 1 U
and related problems

15CI11 Computer Networks

Assignment on Synchronization
1 AP
Algorithms
CONSISTENCY & REPLICATION
Data-centric consistency models:
Continuous consistency- Consistent B 7 3 U
ordering of operations
Client-centric consistency models: B
Eventual consistency - Monotonic
7 3 U
V Reads - Monotonic Writes - Read CO5
your writes - Writes Follow Reads
Replica Management: Replica-Server B
Placement - Content Replication and 7 U
Placement -Content Distribution.
Consistency protocols: Continuous B
7 U
Consistency - Primary-Based

2
 Coimbatore Institute of Technology
Coimbatore-14
Department of Information Technology
Lesson Plan / Course Information

Protocols - Replicated-Write
Protocols - Cache-Coherence
Protocols.
Assignment related to consistency
2 AP

Total hours: 45 hours

Bloom’s Legends:
R-Remembering U-Understanding AP-Applying
A-Analyzing C-Creating E – Evaluating

TEXT BOOKS:

A George Coulouris, Jean Dollimore and Tim Kindberg, Distributed Systems Concepts
and Design, Pearson Education, Fifth Edition, 2012.
B Andrew S Tanenbaum, Maartenvan Steen, Distibuted Systems -Principles and
Paradigms, Pearson Education, Second Edition, 2015. (consistency & replication only)

REFERENCE BOOKS:

C Ajay. D Kshem Kalyani, Mukesh Singhal, Distributed computing principles,

Algorithms and Systems, Cambridge University Press, First edition, 2011.
D Mukesh Singhal, Niranjan G. Shivaratri, Advanced concepts in Operating Systems, Tata
McGraw Hill, 2011
E M.L. Liu, Disributed computing Principles and Applications, Pearson Eduction, 2004.

8. Expected outcome of the course:

Upon completion of the course, students shall have ability to

15CI11 Computer Networks

CO1 Discuss the challenges and issues in applying various distributed system models
in real time applications. [U]

CO2 Demonstrate interprocess communication using Remote Method Invocation and

Remote Procedure Call [AP]

CO3 Describe the architecture and security provided by OS layer to support [U]
CO4 distributed
Identify theSystems
design issues related to naming services, synchronization and use
[AP]
Synchronization algorithms in various distributed system scenarios
CO5 Classify various consistency models and describe the approaches to achieve
fault tolerance in distributed environment. [U]

3
 Coimbatore Institute of Technology
Coimbatore-14
Department of Information Technology
Lesson Plan / Course Information

9. Mapping course outcome with Bloom’s Taxonomy LOT and HOT:

R U AP A C E
CO1 √ √ √
CO2 √ √ √
CO3 √ √ √
CO4 √

10. Mapping course outcome with programme outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 √ √

CO2 √ √ √ √ √

CO3 √ √ √ √ √

CO4 √

11. Course assessment methods:

Mid – Semester I & II 15marks

Assignment /Tutorial/Seminar 5 marks
Mini Project 5 marks
End semester examination 75 marks
Total 100 marks

Faculty In-charge HoD/IT 15CI11 Computer Networks