Distributed Revision Questions 2019 Preview
1.Distinguish between the link-register model, and the message-passing model in which each channel has unit capacity. Then implement the link-register model using the message passing model.
2. A keyboard process K sends an arbitrarily large stream of key-codes to a process P, which is supposed to store them in the memory. In addition to receiving the inputs from K, P also executes an infinite computation G. The channel (K, P) has a finite capacity. Explain how K and P will communicate with each other in the following two cases:
(a) k uses blocking send, and P uses nonblocking receive
(b) k uses blocking send, and P uses blocking receive
Comment on the progress of the computation in each case.
Esther, K. (2021). Distributed Revision Resources (Exam Questions 2019). Afribary. Retrieved from https://afribary.com/works/distributed-revision-resources-2
Esther, Kwatera "Distributed Revision Resources (Exam Questions 2019)" Afribary. Afribary, 21 Jul. 2021, https://afribary.com/works/distributed-revision-resources-2. Accessed 22 Jan. 2022.
Esther, Kwatera . "Distributed Revision Resources (Exam Questions 2019)". Afribary, Afribary, 21 Jul. 2021. Web. 22 Jan. 2022. < https://afribary.com/works/distributed-revision-resources-2 >.
Esther, Kwatera . "Distributed Revision Resources (Exam Questions 2019)" Afribary (2021). Accessed January 22, 2022. https://afribary.com/works/distributed-revision-resources-2