Abstract
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 13.9ms, effectively eliminate message freeze times, and 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 stack 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 on speedup.
Original language | English (US) |
---|---|
Pages | 637-645 |
Number of pages | 9 |
State | Published - 1996 |
Externally published | Yes |
Event | Proceedings of the 1996 16th International Conference on Distributed Computing Systems - Hong Kong, Hong Kong Duration: May 27 1996 → May 30 1996 |
Other
Other | Proceedings of the 1996 16th International Conference on Distributed Computing Systems |
---|---|
City | Hong Kong, Hong Kong |
Period | 5/27/96 → 5/30/96 |
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Networks and Communications