Problem
1. Would the scheme of Bershad et al. to make local RPCs go faster also work in a system with only one thread per process? How about with Peregrine?
2. When two users examine the registry in simultaneously, they may accidentally pick the same idle workstation. How can the algorithm be subtly changed to prevent this race?
3. Imagine that a process is running remotely on a previously idle workstation, which, like all the workstations, is diskless. For each of the following UNIX system calls, tell whether it has to be forwarded back to the home machine:
(a) READ (get data from a file).
(b) IOCTL (change the mode of the controlling terminal).
(c) GEM) (return the process id).