RAMCO INSTITUTE OF TECHNOLOGY
Department of Artificial Intelligence and Data Science
Academic Year: 2025 - 2026 (Odd Semester)
ASSIGNMENT SHEET -1
Degree, Semester& Branch: B.Tech,V & AI/DS
Course Code & Title: CS3551 & Distributed Computing
Name of the Faculty member: C.Usharani
Assignment No.: 1 Date: 20.08.2025
Unit-I (INTRODUCTION)
1. Illustrate the practical applicability of the load –balancing approach as a scheduling
scheme for the following types of distributed systems:
a) A LAN-based distributed system
b) A WAN-based distributed system
c) A distributed system based on the processor-pool model.
d) A distributed system based on the workstation-server model. [CO1,L3]
2. Compare and contrast message-passing systems with shared memory systems. Discuss
their respective advantages and disadvantages in distributed computing. [CO1,L3]
3. Identify and discuss three major design challenges in distributed systems. Propose
potential solutions for each challenge. [CO1,L3]
4. Analyze a real-world distributed system (e.g., Google File System, Amazon Web
Services). Discuss how it addresses the issues of communication, execution, and global
state. [CO1,L3]
5. Write a simple distributed program using message-passing primitives. Explain how your
program demonstrates distributed system principles. [CO1,L3]
6. Provide an example of a distributed system that uses synchronous communication.
Discuss its implementation and the challenges involved. [CO1,L3]
7. Provide an example of a distributed system that uses asynchronous communication.
Discuss its implementation and the challenges involved. [CO1,L3]
8. Describe a scenario where maintaining a global state in a distributed system is crucial.
How would you approach solving the issues associated with capturing and utilizing the
global state in this scenario? [CO1,L3]
9. Explain in detail about the distributed program and discuss about the model of distributed
executions. [CO1,L2]
Form No. AC 09b Rev.No. 00 Effective Date: 18.01.2016
10. Discuss in detail about Models of Communication network involved in distributed
systems. [CO1,L2]
Unit-II (LOGICAL TIME AND GLOBAL STATE)
1. Consider a distributed system where every node has its physical clock and all physical
clocks are perfectly synchronized. Develop an algorithm to record global state assuming
the communication network is reliable. [CO2,L3]
2. Illustrate the asynchronous executions and of crowns. [CO2,L3]
a. Crown of size 2
b. Another crown of size 2
c. Crown of size 3
3. Examine the two possible executions of the snapshot algorithm for money transfer.
[CO2,L3]
4. Consider Figure 1 that shows four processes (P1, P2, P3, P4)with events a, b, c, … and
messages communicating between them. Assume that initial logical clock values are all
initialized to 0.
(i) List the Lamport timestamps for each event shown in Figure 1. Assume that each
process maintains a logical clock as a single integer value as a Lamport clock. Provide
timestamps for each labeled event.
(ii) List the Vector Clock timestamps for each event shown in Figure 1. Provide
timestamps for each labeled event. [CO2,L3]
5. Show the following containment relationships between causally ordered and totally
ordered multicasts
Form No. AC 09b Rev.No. 00 Effective Date: 18.01.2016
1. Show that a causally ordered multicast need not be a total order multicast. 2. Show that
a total order multicast need not be a causal order multicast.
[CO2,L3]
6. Describe the Chandy-Lamport algorithm for taking a distributed snapshot in a distributed
system. Illustrate step-by-step how the algorithm works in a scenario with four processes
and their interactions, explaining how logical time is used to ensure consistency.
[CO2,L3]
7. Explain the concept of vector clocks in a distributed system. Provide an example scenario
involving four processes and various events. Show how vector clocks are updated and
used to determine causality and order of events. [CO2,L3]
8. Explain the concept of scalar clocks in a distributed system. Provide an example scenario
involving four processes and various events. Show how scalar clocks are updated and
used to determine causality and order of events. [CO2,L3]
9. Describe a scenario where asynchronous execution is combined with synchronous
communication. What are the challenges and benefits of this approach? [CO2,L3]
10. Design a simple distributed system scenario where both logical time (vector clocks) and
snapshot algorithms are used. Explain how these concepts are applied to ensure
consistency and synchronization in your scenario. [CO2,L3]
11. Discuss in detail about the Physical clock synchronization with NTP architecture.
[CO2,L2]
12. Calculate Round trip delay and Clock Time for the below two problems. [CO2,L3]
Form No. AC 09b Rev.No. 00 Effective Date: 18.01.2016
UNIT III-DISTRIBUTED MUTEX AND DEADLOCK
1. Show that in the ricart–agrawala algorithm the critical section is accessed in increasing
order of timestamp. Does the same hold in maekawa’s algorithm?
2. Explain Suzuki-Kasami’s broadcast algorithm for distributed mutual exclusion. How
does this algorithm improve upon traditional token-based approaches?
3. Show that in the Lamport algorithm the critical section is accessed in increasing order of
timestamp.
4. Explain the concept of Non Token based mutual exclusion algorithm in detail.
Form No. AC 09b Rev.No. 00 Effective Date: 18.01.2016
RAMCO INSTITUTE OF TECHNOLOGY
Department of Artificial Intelligence and Data Science
Degree, Semester& Branch: B. Tech, V & Artificial Intelligence and Data Science
Course Code & Title: CS3551 & Distributed Computing
Year & Sec: III & B
Name of the Faculty member: Mrs. C.Usharani
Assignment No.: 1
Details of Individual Assignment
Sl. Question Numbers
Reg. No. Name of the Student
No. Unit1 Unit 2 Unit 3
1. 953623243001 ABI ALIAS MAHALAKSHMI R 1 1 1
2. 953623243003 ABI RAJESHWARI P 2 2 2
3. 953623243004 AKASH V 3 3 3
4. 953623243005 AKSHAY A 4 4 4
5. 953623243009 ANUSHREE R 5 5 1
6. 953623243010 ANUSRII. E 6 6 2
7. 953623243011 ARULVENTHAN A 7 7 3
8. 953623243013 ARUN RAJA N 8 8 4
9. 953623243014 ASREEN HASANA K 9 9 1
10. 953623243015 ASWINI S 10 10 2
11. 953623243016 ASWITHA.S 1 11 3
12. 953623243017 ATHITHYA S 2 12 4
13. 953623243019 BHARATHI KANNAN G 3 1 1
14. 953623243021 BLESSONPAUL T 4 2 2
15. 953623243024 DHAKSHINA SRI P 5 3 3
16. 953623243025 DHANALAKSHMI.E 6 4 4
Form No. AC 09b Rev.No. 00 Effective Date: 18.01.2016
17. 953623243026 DHANANJAI SU 7 5 1
18. 953623243029 DIVYA DHARSHINI R 8 6 2
19. 953623243032 EBENEZER LINNETA J 9 7 3
20. 953623243033 ESAKIRAJA R 10 8 4
21. 953623243034 GOKULALAKSHMI G 1 9 1
22. 953623243035 GOPIKRISHNA.M 2 10 2
23. 953623243038 HARSHINI G 3 11 3
24. 953623243040 JAMEEL FATHIMA M 4 12 4
25. 953623243043 JEEVANANDHAM.M 5 1 1
26. 953623243048 KIRTHI.S 6 2 2
27. 953623243050 KRISHNAVENI.M 7 3 3
28. 953623243052 MAHALAKSHMI S 8 4 4
29. 953623243053 MAHA RAJA S 9 5 1
30. 953623243054 MAHESH BOOPATHI K 10 6 2
31. 953623243059 MEERADHARSHNI K 1 7 3
32. 953623243062 MUNEESWARI J 2 8 4
33. 953623243064 MUTHU MURUGESHWARI A 3 9 1
34. 953623243065 NAGALAKSHMI K 4 10 2
35. 953623243066 NARENDRAN A 5 11 3
36. 953623243067 NIRMALA S 6 12 4
37. 953623243071 NITHIYA SRI M 7 1 1
POORNA BHARNIKA
38. 953623243075 8 2 2
MUTHUKUMARAVEL
39. 953623243076 POORVIKA M 9 3 3
40. 953623243078 PRAKASH P 10 4 4
41. 953623243079 RAGAVI T 1 5 1
42. 953623243081 RAJESHWARI. V 2 6 2
Form No. AC 09b Rev.No. 00 Effective Date: 18.01.2016
43. 953623243083 SAMIKSHA M 3 7 3
44. 953623243085 SANTHIYA R 4 8 4
45. 953623243086 SELVABALAJI S 5 9 1
46. 953623243087 SELVA GANESH R 6 10 2
47. 953623243091 SIVANANTHAM S 7 11 3
48. 953623243092 SIVAPRASATH R 8 12 4
49. 953623243094 SREEJEYANTHI S 9 1 1
50. 953623243095 SRIRAMKUMAR.M 10 2 2
51. 953623243098 SUBBARAYALU M 1 3 3
52. 953623243100 SUBHA DHANUSHA.P 2 4 4
53. 953623243101 S UDHAYA SEKAR 3 5 1
54. 953623243104 SUNDAR KARTHICK.M 4 6 2
55. 953623243107 THIRULINGAM C 5 7 3
56. 953623243108 UMABHARATHI.A 6 8 4
57. 953623243110 UTHANDA VINAYAGAM A 7 9 1
58. 953623243114 VENNILA G 8 10 2
59. 953623243120 VISHWAKUMAR R 9 11 3
Form No. AC 09b Rev.No. 00 Effective Date: 18.01.2016
