In distributed systems, election algorithms assumes that ____________
A) a unique priority number is associated with each active process in system
B) there is no priority number associated with any process
C) priority of the processes is not required
D) none of the mentioned
Correct Answer:
Verified
Q15: In distributed systems, a logical clock is
Q16: If timestamps of two events are same,
Q17: If a process is executing in its
Q18: A process can enter into its critical
Q19: For proper synchronization in distributed systems _
A)prevention
Q20: In the token passing approach of distributed
Q21: In distributed systems, what will the transaction
Q22: In case of failure, a new transaction
Q24: According to the ring algorithm, links between
Q25: What are the different ways distributed may
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents