Proceedings of 16th International Conference on Distributed Computing Systems (1996)
May 27, 1996 to May 30, 1996
E.T. Roush , OPUS Syst. Div., Unisys Corp., San Jose, CA, USA
R.H. Campbell , OPUS Syst. Div., Unisys Corp., San Jose, CA, USA
Dynamic process migration supports load sharing and processor fault tolerance. We present the new freeze free algorithm for process migration, which uses six techniques to: reduce process migration latency by an order of magnitude to 19.9 ms, effectively eliminate message freeze times, and to support processor fault tolerance. The freeze free algorithm resumes execution after the transfer of four items: the combined process control and execution state, the current code page, the current heap page, and the current code page. The algorithm effectively eliminates message freeze time by separating the process state from the communication state, and thus allows message processing to proceed in parallel with process migration. The algorithm eliminates old host residual dependencies by flushing old host resident, modified data; while the process executes in parallel on the new host. The paper analyzes the costs in both the process migration latency period and the cross-network demand paging operations, and identifies further cost reductions. This paper demonstrates that small overhead is needed for good load sharing system speedup by measuring the impact of increasing overhead an speedup.
resource allocation; fault tolerant computing; distributed processing; fast dynamic process migration; load sharing; processor fault tolerance; freeze free algorithm; process control; current code page; current heap page; message freeze time; communication state; host residual dependencies; load sharing system speedup
R. Campbell and E. Roush, "Fast dynamic process migration," Proceedings of 16th International Conference on Distributed Computing Systems(ICDCS), Hong Kong, 1996, pp. 637.