DISTRIBUTED SYSTEMS

Subject Code: CS732PE

Regulations : R16 - JNTUH
Class: IV Year B.Tech CSE I Semester

Department of Computer Science and Engineering

BHARAT INSTITUTE OF ENGINEERING AND
TECHNOLOGY Ibrahimpatnam - 501 510, Hyderabad
 DISTRIBUTED SYSTEMS (CS732PE)
COURSE PLANNER
I. COURSE OVERVIEW:
In this the course we are going to presented the distributed systems, high performance networks,
clusters and computational grids environments. In the end, participants will have a good idea of
the basis of these subjects in both theoretical and practical aspects.To help students understand
the fundamental issues of designing and engineering distributed systems with reference to
partial failure, heterogeneity, scalability, concurrency and asynchrony.
II. PREREQUISITE(S):
1. Operating systems
2. Computer networks
3. Data base management systems
III. COURSE OBJECTIVES:
1 To understand what and why a distributed system

2 To understand theoretical concepts, namely, virtual time, agreement and consensus

protocols.
3 To understand IPC, Group Communication & RPC Concepts.

4 To understand the DFS and DSM Concepts.

5 To understand the concepts of transaction in distributed environment and associated
concepts, namely, concurrency control, deadlocks and error recovery.
6 To Ability to undertake problem identification, formulation and solution
IV.COURSE OUTCOMES:
S.No Description Bloom’s Taxonomy Level
1 Ability to analyze core concepts of distributed Analyze (level 4)
systems comprehend and design a new
distributed system with the desired features.
2 Ability to choose Able to start literature Knowledge, Application (level 1, level
survey leading to further research in any sub 3)
area.
3 Able to develop new distributed applications.
Understanding, Synthesis(Level 2,
level 5)
V. HOW PROGRAM OUTCOMES ARE ASSESSED:
Program Level Proficiency
Outcomes (PO) assessed by
PO1 Engineering knowledge: Apply the knowledge of
mathematics, science, engineering fundamentals, and an 3 Assignments
engineering specialization to the solution of complex
engineering problems related to Computer Science and
Engineering.
PO2 Problem analysis: Identify, formulate, review research
literature, and analyze complex engineering problems 3 Assignments
related to Computer Science and Engineering and
reaching substantiated conclusions using first principles
of mathematics, natural sciences, and engineering
sciences.
PO3 Design/development of solutions: Design solutions for
complex engineering problems related to Computer
Science and Engineering and design system components 2 Assignments
or processes that meet the specified needs with
appropriate consideration for the public health and safety,
and the cultural, societal, and environmental
considerations.
PO4 Conduct investigations of complex problems: Use
research-based knowledge and research methods 2 Assignments
including design of experiments, analysis and
interpretation of data, and synthesis of the information
to provide valid conclusions.
PO5 Modern tool usage: Create, select, and apply appropriate
techniques, resources, and modern engineering and IT -- --
tools including prediction and modeling to complex
engineering activities with an understanding of the
limitations.
PO6 The engineer and society: Apply reasoning informed by
the contextual knowledge to assess societal, health, safety, 1 Assignments
legal and cultural issues and the consequent
responsibilities relevant to the Computer Science and
Engineering professional engineering practice.
PO7 Environment and sustainability: Understand the impact
of the Computer Science and Engineering professional - --
engineering solutions in societal and environmental
contexts, and demonstrate the knowledge of, and need for
sustainable development.
PO8 Ethics: Apply ethical principles and commit to - --
professional ethics and responsibilities and norms of the
engineering practice.
PO9 Individual and team work: Function effectively as an --
individual, and as a member or leader in diverse teams, -
and in ultidisciplinary settings.
PO10 Communication: Communicate effectively on complex --
engineering activities with the engineering community
and with society at large, such as, being able to -
comprehend and write effective reports and design
documentation, make effective presentations, and give
and receive clear instructions.
 PO11 Project management and finance: Demonstrate
knowledge and understanding of the engineering and - --
management principles and apply these to one’s own
work, as a member and leader in a team, to manage
projects and in multidisciplinary environments.
PO12 Life-long learning: Recognize the need for, and have the Research
preparation and ability to engage in independent and life- 2
long learning in the broadest context of technological
change.
1: Slight (Low) 2: Moderate 3: Substantial - : None
(Medium) (High)
VI. HOW PROGRAM SPECIFIC OUTCOMES ARE ASSESSED:
Program Specific Outcomes (PSO) Level Proficiency
assessed by
PSO1 Foundation of mathematical concepts: To use Lectures,
mathematical methodologies to crack problem using suitable 3 Assignments
mathematical analysis, data structure and suitable algorithm.
PSO2 Foundation of Computer System: The ability to interpret the Lectures,
fundamental concepts and methodology of computer systems. 2 Assignments
Students can understand the functionality of hardware and
software aspects of computer systems.
PSO3 Foundations of Software development: The ability to grasp
the software development lifecycle and methodologies of
software systems. Possess competent skills and knowledge of -- --
software design process. Familiarity and practical proficiency
with a broad area of programming concepts and provide new
ideas and innovations towards research.
VII. SYLLABUS:
UNIT- I:Characterization of Distributed Systems: Introduction, Examples of Distributed
Systems, Resource Sharing and the Web, Challenges. System Models: Introduction,
Architectural Models, Fundamental Models.
UNIT- II:Time and Global States: Introduction, Clocks Events and Process States,
Synchronizing Physical Clocks, Logical Time and Logical Clocks, Global States, Distributed
Debugging. Coordination and Agreement: Introduction, Distributed Mutual Exclusion,
Elections, Multicast Communication, Consensus and Related Problems.
UNIT- III:Inter Process Communication: Introduction, The API for the Internet Protocols,
External Data Representation and Marshalling, Client-Server Communication, Group
Communication, Case Study: IPC in UNIX. Distributed Objects and Remote Invocation:
Introduction, Communication between Distributed Objects, Remote Procedure Call, Events and
Notifications, Case Study: JAVA RMI.
UNIT- IV:Distributed File Systems: Introduction, File Service Architecture, Case Study 1:
SunNetwork File System, Case Study 2: The Andrew File System.
Name Services: Introduction, Name Services and the Domain Name System, Directory Services,
Case Study of the Global Name Services. Distributed Shared Memory: Introduction, Design
and Implementation Issues, Sequential Consistency and IVY case study, Release Consistency,
Munin Case Study, Other Consistency Models.
UNIT- V:Transactions and Concurrency Control: Introduction, Transactions, Nested
Transactions, Locks, Optimistic Concurrency Control, Timestamp Ordering, Comparison of
Methods for Concurrency Control. Distributed Transactions: Introduction, Flat and Nested
Distributed Transactions, Atomic Commit Protocols, Concurrency Control in Distributed
Transactions, Distributed Deadlocks, Transaction Recovery.
TEXT BOOK:
1. Distributed Systems, Concepts and Design, George Coulouris, J Dollimore and Tim
Kindberg, Pearson Education, 4th Edition, 2009.
REFERENCE BOOKS:
1.Distributed Systems, Principles and Paradigms, Andrew S. Tanenbaum, Maarten Van
Steen, 2nd Edition, PHI.
2.Distributed Systems, An Algorithm Approach, Sukumar Ghosh, Chapman & Hall/CRC, Taylor
& Fransis Group, 2007.
NPTEL Web Course:
https://onlinecourses.nptel.ac.in/noc17_cs42/course
NPTEL Video Course:
https://nptel.ac.in/courses/106106168/
IES SYLLABUS:
Not Applicable
VIII. LESSON PLAN:
Sl No

Week

Topic Course outcomes Teaching Reference

Methodologies
UNIT-I
1 Introduction Chalk and Talk
Examples of Distributed Understand the Chalk and Talk
2
Systems, fundamentals of
1 Examples of Distributed distributed systems Chalk and Talk
3
Systems,
Resource Sharing and the Chalk and Talk
4
Web Compare the
Resource Sharing and the performance of the Chalk and Talk
5
Web various types of
. Challenges of distributed distributed systems Chalk and Talk
6
systems TB1
2 System Models Describe the Chalk and Talk
7 Architectural Models, Significance of system
models
System Models Chalk and Talk
8
Architectural Models,
Apply the Concept of
9 Fundamental models Chalk and Talk
system models
10 Fundamental models Chalk and Talk
11 3 Fundamental models Chalk and Talk
Assess the student
12 BRIDGE CLASS -1
skills.
 UNIT-II
Introduction to Time and Chalk and Talk
13
global states
Explain the basics of Chalk and Talk
14
Time and global states time sharing and
4
Synchronizing Physical synchronizing physical Chalk and Talk
15
Clocks clocks
Logical Time and Logical Chalk and Talk
16
Clocks
Understand the Chalk and Talk
Global States, Distributed
17 various global states
Debugging
and debugging
Discuss the various Chalk and Talk
Coordination and Agreement:
18 5 agreement and TB1
Introduction Elections,
elections
Define the concept of Chalk and Talk
19 Distributed mutual Exclusion
Mutual exclusion
20 Mutual communication Chalk and Talk
Consensus and Related Chalk and Talk
21 Problems.
Compute the
consensus problems
22 Mutual communication Chalk and Talk
6
Consensus and Related Chalk and Talk
23
Problems.
Assess the student
24 BRIDGE CLASS -2
skills.
UNIT-III
Introduction, The API for the Describe API for Chalk and Talk
25
Internet Protocols internet protocol
26 7 The API for the Internet Chalk and Talk
27 Protocols Chalk and Talk
Apply
28 External Data Representation Chalk and Talk
Data representation
and Marshalling, marshalling techniques Chalk and Talk
29 Communication between
Distributed Objects,
30 8 Mock Test-1
1st MID EXAMS TB1
31 Client-Server Chalk and Talk
32 Communication, Group Chalk and Talk
Communication, IPC in Chalk and Talk
33 Apply the Concept of
UNIX.
client server
34 Distributed Objects and Chalk and Talk
communication
9 Remote Chalk and Talk
Invocation:Introduction,Remo
35
teProcedure Call, Events and
Notifications, Case Study:
 JAVA RMI.
Assess the student
36 BRIDGE CLASS-3
skills.
UNIT-IV
Distributed File Systems: Chalk and Talk
Introduction, File Service Understand the
37
Architecture, Case Study 1: distributed file system
Sun
Name Services: Chalk and Talk
Introduction, Name Services
and the Domain Name
38
System, Directory Services,
10 Case Study of the Global
Name Services
Name Services: Introduction, Chalk and Talk
Name Services and the
Domain Name System,
39
Directory Services, Case
Study of the Global Name
Services TB1
Demonstrate the
40 Name Services: Introduction, Chalk and Talk
name services and
Name Services and the Chalk and Talk
distributed shared
Domain Name System,
memory
41 Directory Services, Case
Study of the Global Name
Services
42 Distributed Shared Chalk and Talk
Memory: Introduction, Chalk and Talk
11
43 Design and Implementation
Issues
Sequential Consistency and Chalk and Talk
IVY case study, Release
44 Consistency, Minim Case
Study, Other Consistency
Models
UNIT-V
Transactions and Chalk and Talk
Concurrency Control:
State transaction
45 Introduction, Transactions,
concurrency control
Comparison of Methods for
Concurrency Control.
12 TB1
Comparison of Methods for Chalk and Talk
46
Concurrency Control Solve optimistic
Locks, Optimistic concurrency control Chalk and Talk
47
Concurrency Control system
48 Timestamp Ordering Chalk and Talk
 Distributed Transactions: Chalk and Talk
Introduction, , Concurrency Discuss distributed
49
Control in Distributed transaction
Transactions,
Flat and Nested Distributed Chalk and Talk
13 Discuss flat nested
50 Transactions, Atomic Commit
distributed transaction
Protocols
Distributed Deadlocks, Distinguish dead lock Chalk and Talk
51
Transaction Recovery. detection and recovery
52 BRIDGE CLASS-4 Assess
53
REVISION Revise
54
55 14 Discuss the questions
PREVIOUS PAPER
from previous year
56 DISCUSSION
question papers
IX. MAPPING COURSE OUTCOMES LEADING TO THE ACHIEVEMENT OF
PROGRAM OUTCOMES AND PROGRAM SPECIFIC OUTCOMES:
COs Program Outcomes Program Specific
/ Pos Outcomes

PSO
PSO
PO12

PSO3
PO11
PO10
PO8
PO5
PO1

PO2

PO3

PO4

PO6

PO7

PO9

2
1
CO1 3 2 3 3 - - - - - - - - 2 2 -
CO2 3 3 2 3 - - - - - - - - 2 3 -
CO3 3 3 2 2 - - - - - - - - 2 3 -

X. QUESTION BANK: (JNTUH)

UNIT – I
S. Blooms Taxonomy
Question
No Level
PART – A (SHORT ANSWER QUESTIONS)
1 Define distributed system? Knowledge
2 Define the properties of the distributed system? Apply
3 Define effective resource sharing? Knowledge
4 List the examples of the distributed systems? Apply
5 State the challenges of the distributed systems? Understand
PART – B (LONGANSWER QUESTIONS)
1 Explain about architectural models Understand
2 Demonstrate the design requirements for distributed architectures. Apply
3 Explain how events are ordering in real-time with neat sketch Understand
4 Discuss how distributed systems are more scalable than the Understand
 centralized systems. [
5 Explain recovery of nested transactions Apply
UNIT – II
Blooms Taxonomy
S. N Question
Level
PART – A (SHORT ANSWER QUESTIONS)
1 Define vector clocks? Knowledge
2 Define global states? Understand
3 Explain distributed deadlock detection? Understand
4 Explain distributed termination detection? Knowledge
5 Define consistent cut? Knowledge
PART – B (LONGANSWER QUESTIONS)
1 Explain clocks, events and process states? Understand
2 Explain how synchronizing physical clocks? Understand
3 Discuss the lamport logical clocks and logical time? Understand
4 Describe distribute debugging? Understand
5 Explain global states in detail? Understand
UNIT – III
Blooms Taxonomy
S. No Question
Level
PART – A (SHORT ANSWER QUESTIONS)

1 Define the uses of UDP? Knowledge

2 Explain TCP Stream communication? Understand

3 List the issues related to the stream communication? Knowledge

4 Define data marshalling? Knowledge

5 Define data representation? Knowledge

PART – B (LONGANSWER QUESTIONS)

1 Explain the API for the internet protocols in IPC? Apply

2 Explain UDP datagram communication in detail? Apply

3 Explain TCP stream communication in detail? Apply

4 Explain in detail about external data and marshalling? Understand

5 Explain client-server communication in detail? Understand

UNIT – IV
Blooms Taxonomy
S. No Question
Level
PART – A (SHORT ANSWER QUESTIONS)
1 Explain the API for the internet protocols in IPC? Apply

2 Explain UDP datagram communication in detail? Apply

3 Explain TCP stream communication in detail? Apply

4 Explain in detail about external data and marshalling? Understand

5 Explain client-server communication in detail? Understand

PART – B (LONGANSWER QUESTIONS)

1 Explain file service architecture in detail? Apply

2 Explain sun network file system? Apply

3 Describe in detail about Andrew file system? Understand

4 Write about the recent advances in the distributed file systems? Apply
Explain the characteristics and distributed file system Apply
5
requirements?
Describe basic distributed file system and storage systems and Understand
6 their
properties?
UNIT – V
Blooms Taxonomy
S.No Question
Level
PART – A (SHORT ANSWER QUESTIONS)
1 Define transaction recovery? Knowledge

2 Compare the flat and nested distributed transactions? Understand

3 Define the properties of transactions? Knowledge

4 Define the types of locks? Knowledge

5 Define 2PL? Knowledge

PART – B (LONGANSWER QUESTIONS)

State and explain simple synchronization and failure model for Remember
1
transactions?
2 Explain transactions and their properties in detail? Apply

3 Write a brief note on nested transactions? Apply

4 Write a brief note on locks and its types? Apply

 5 Explain about deadlocks in detail? Apply

OBJECTIVE QUESTIONS: JNTUH

UNIT-I
1. In distributed system each processor has its own
a) local memory b) clock c) both local memory and clock d) none of the mentioned
2. If one site fails in distributed system
a) the remaining sites can continue operating b) all the sites will stop working
c) directly connected sites will stop working d) none of the mentioned
3. Network operating system runs on
a) server b) every system in the network c) both A & B d) none of the mentioned
4. Which technique is based on compile-time program transformation for accessing remote
data in a distributed-memory parallel system.
a) cache coherence scheme b) computation migration
c) remote procedure call d) message passing
5. Logical extension of computation migration is
a) process migration b) system migration c) thread migration d) data migration
6. Processes on the remote systems are identified by
a) host ID b) host name and identifier c) identifier d) process ID
7. Which routing technique is used in distributed system?
a) fixed routing b) virtual routing c) dynamic routing d) all of the mentioned
8. In distributed systems, link and site failure is detected by
a) polling b) handshaking c) token passing d) none of the mentioned
9. The capability of a system to adapt the increased service load is called
a) scalability b) tolerance c) capacity d) none of the mentioned
10. Internet provides _______ for remote login.
a) telnet b) http c) ftp d) RPC

UNIT-II
1.Transparency that enables multiple instances of resources to be used, is called
a)Replication transparency b)Scaling transparency c)Concurrency
transparency d)Performance transparency
2. A paradigm of multiple autonomous computers, having a private memory, communicating
through a computer network, is known as
a)Distributed computing b)Cloud computing c)Centralized computing d)Parallel computing
3. Type of architecture that is considered responsible for success of
a)Two-tier architecture b)Three-tier architecture c)n-tier architecture d)Peer-to-Peer
architecture
4. A global system of interconnected computer networks is known
as a)Ethernet b)Intranet c)Internet d)Ultra-net
5.RPC connectors and message queues are mechanisms for
a)Message retrieving b)Message passing c)Message delivering d)Message Sync-ing
6. Parallel computing is also known as
a)Parallel computation b)Parallel processing
c)Parallel distribution d)Parallel development
7.Connections that grows exponentially into a new dynamic network of networks, is known as
a)Dynamic b)Static c)Transparent d)Opaque
8.One of first uses of grid computing was breaking of a
a)Critical computed code b)Tabulated code c)Cryptographic code d)Decryptographic code
9. Centralized computing covers many data centers and
a)Minicomputers b)Mainframe computers c)Supercomputers
d)Microcomputers 10.To provide high-throughput service is measures taken by
a)Efficiency b)Adaptation c)Dependability d)Flexibility
UNIT-III
1.In distributed system each processor has its own
a) local memory b) clock c) both A & B d) none of the mentioned
2. If one site fails in distributed system
a) the remaining sites can continue operating
b) all the sites will stop working
c) directly connected sites will stop working
d) none of the mentioned
3.Network operating system runs on
a) server b) every system in the network c) both A & B d) none of the mentioned
4. Which technique is based on compile-time program transformation for accessing remote data
in a distributed-memory parallel system.

a) Cache coherence scheme b) computation migration

c) remote procedure call d) message passing
5. Logical extension of computation migration is
a) process migration b) system migration c) thread migration d) data migration
6. Processes on the remote systems are identified by
a) host ID b) host name and identifier c) identifier d) process ID
7. Which routing technique is used in distributed system?
a) Fixed routing b) virtual routing c) dynamic routing d) all of the mentioned
8. In distributed systems, link and site failure is detected by
a) polling b) handshaking c) token passing d) none of the mentioned
9. The capability of a system to adapt the increased service load is called
a) scalability b) tolerance c) capacity d) none of the mentioned
10. Internet provides _______ for remote login.
a) Telnet b) http c) ftp d) RPC
UNIT-IV
1.Centralized computing covers many data centers and
a)Minicomputers b)Mainframe computers c)Supercomputers d)Microcomputers
2.Computer technology has gone through development generations of a) 3 b) 4 c)
5 d) 6
3. In an execution model, utilization rate of resources is known to be
its a)Efficiency b)Dependability c)Flexibility d)Adaptation
4. Reliability and self-management from chip to system and application levels are measures of
a) Dependability b)Flexibility c)Adaptation d)Efficiency
5. Uni processor computing is known as
a) Centralized computing b)Parallel computing c)Distributed computing d)Grid computing
6. A computing model of a distributed architecture of large numbers of computers connected
to solve a complex problem is called
a) Linear computing b)Grid computing c)Layout computing d)Compound computing
7. Utility computing focuses on a
a)Business model b)Scalable model c)Cloud model d)Data model
8. A CPS merges technologies
of a) 2C b)3C c) 4C d)5C
9. An architecture in which no special machines manage network resources is known
as a)Space based b)Tightly coupled c)Loosely coupled d)Peer-to-Peer
10. n many applications, HPC and HTC systems desire
a) Transparency b)Dependency c)Secretive d)Adaptivity
UNIT –V
1 In wait for graph (WFG), a directed edge from node P1 to node P2 indicates that:
a) P1 is blocked and is waiting for P2 to release some resource
b) P2 is blocked and is waiting for P1 to release some resource
c) P1 is blocked and is waiting for P2 to leave the system
d) P2 is blocked and is waiting for P1 to leave the system
2 In the wait for graph, if there exists a directed cycle or knot:

c)then the system is in a safe state d) either b or c

3 Consider the following statements:
A deadlock detection algorithm must satisfy the following two conditions: Condition
1: Progress (No false deadlocks): The algorithm should not report deadlocks which do not exist.
Condition
2: Safety (No undetected deadlocks): The algorithm must detect all existing deadlocks in finite
time.

a) Both conditions are true b)Both conditions are false c)Only

condition 1 is true d)Only condition 1 is true
4 . Consider the following statements related to consistency models:
(i) Strict consistency (SC): Only Write operations issued by the same processor and to the
same memory location must be seen by others in that order.
(ii) (ii) PRAM memory: Only Write operations issued by the same processor are seen by
others in the order they were issued, but Writes from different processors may be seen
by other processors in different orders.
(iii) (iii) Slow Memory: Any Read to a location (variable) is required to return the value written
by the most recent Write to that location (variable) as per a global time reference.
a) All are True b)All are False c)Only (i) and (iii) are true d)Only (ii) is true
5. Choose the correct consistency model that defines the following condition
I. All Writes are propagated to other processes, and all Writes done elsewhere are brought
locally, at a sync instruction.
II. Accesses to sync variables are sequentially consistent
III. Access to sync variable is not permitted unless all Writes elsewhere have completed IV.
No data access is allowed until all previous synchronization variable accesses have been
performed
a)Weak consistency b)Causal consistency c)Processor consistency d)Program consistency
6.The space complexity is the ____________registers and time complexity is ________time
for n-process bakery algorithm of shared memory mutual exclusion
a) Upper bound of n, O(n2 ) b)Upper bound of n, O(n)
c)Lower bound of n, O(n) d)Lower bound of n, O(n2 )
7. What are characteristics of processor in distributed system ?
a)They vary in size and function b)They are same in size and function c) They are
manufactured with single purpose d) They are real-time devices
8. Distributed OS works on the ________ principle.
a)file system image b) Single system image c) multi system image d)networking image
9. Super computers typically employ _______.
a) high security b) better resource sharing c) better system utilization d) low system overhead
10. Which amongst the following is not an advantage of Distributed systems?
a)reliability b)incremental growth c)resource sharing d) none of the above

1. https://www.youtube.com/watch?v=jDkBtI0VJwI
2. https://www.geeksforgeeks.org/operating-systems-set-5/
XI. WEBSITES:
1.https://www.scribd.com/document/383257274/Distributed-System-MCQ-2018
2. https://compscibits.com/mcq-questions/Operating-System/Distributed-Systems
XII. EXPERT DETAILS:
1.Haryadi Gunawi Cloud-scale distributed systemsdependabilityCloud-scale
storage systemsdependabilityDistributed concurrency bugsLatent scalability bugs.
2. K. Mani Chandy Distributed systemsConcurrent systemsEvent processing systems Sense
and respond systems
XIII. JOURNALS:
1 A Medium-Scale Distributed System for Computer Science Research: Infrastructure for the
Long Term.
2. Study and Characterization of a Camera-based Distributed System for Large-Volume
Dimensional Metrology Applications.
3. Large-Volume Dimensional Metrology (LVDM) deals with dimensional inspection of large
objects
XIV. LIST OF TOPICS FOR STUDENT SEMINARS:
1.Parallel Scientific Applications and Concurrent Computing (Eero Vainikko, Oleg Batrashev,
Benson Muite)
2.P2P Computing: F2F Platform, F2F Applications (Artjom Lind)
3.Applied Computer Vision (Artjom Lind)
4.Parallel Machine learning algorithms (Artjom Lind, Oleg Batrashev)
5.Exploratory search (Dimitri Danilov)
6.Geographic information systems (GIS) Related topics (Amnir Hadachi)
XV. CASE STUDIES / SMALL PROJECTS:
1.A Distributed System in a Room
2 Site Replication for Disaster Protection
3.Geographically Distributed Nodes, Centralized Control.
4. Geographically Distributed Autonomous Nodes
5.