The freeze free algorithm for process migration Export

@techreport{citeulike:339284, abstract = {tical pages without page faults. The program counter identifies the current code page, and the stack pointer identifies the current stack page. A heuristic identifies the current heap page by examining the instruction stream. The system truncates the top stack page to the portion currently in use. Third, the Freeze Free design separates process control and communication state, which allows process migration and message receipt to proceed in parallel. The new design effectively eliminates the...}, author = {Roush, Ellard T.}, citeulike-article-id = {339284}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.7436}, keywords = {process-migration}, number = {UIUCDCS-R-95-1924}, posted-at = {2005-10-03 04:27:04}, priority = {4}, title = {The freeze free algorithm for process migration}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.7436}, year = {1995} }

TY - RPRT ID - citeulike:339284 L3 - citeulike-article-id:339284 N2 - tical pages without page faults. The program counter identifies the current code page, and the stack pointer identifies the current stack page. A heuristic identifies the current heap page by examining the instruction stream. The system truncates the top stack page to the portion currently in use. Third, the Freeze Free design separates process control and communication state, which allows process migration and message receipt to proceed in parallel. The new design effectively eliminates the... IS - UIUCDCS-R-95-1924 TI - The freeze free algorithm for process migration KW - process-migration AU - Roush, Ellard PY - 1995/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.7436 ER -