This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: process? a. Stack b. Heap c. Shared memory segments 3.4 Again considering the RPC mechanism, consider the “ exactly once ” se-mantic. Does the algorithm for implementing this semantic execute cor-rectly evenif the “ ACK ” message back to the client is lost due to a network problem? Describe the sequence of messages and whether "exactly once" is still preserved. 3.5 Assume that a distributed system is susceptible to server failure. What mechanisms would be required to guarantee the “ exactly once ” seman-tics for execution of RPCs? 5...
View Full Document
This note was uploaded on 11/03/2009 for the course IT OS taught by Professor Dr.stephan during the Winter '09 term at Abu Dhabi University.
- Winter '09
- Operating Systems