Abstract
We have developed and implemented a checkpointing and restart algorithm for parallel programs running on commercial uniprocessors and shared-memory multipro cessors. The algorithm runs concurrently with the target program, interrupts the target program for small, fixed amounts of time and is transparent to the checkpointed program and its compiler. The algorithm achieves its efficiency through a novel use of address translation hardware that allows the most time-consuming operations of the checkpoint to be overlapped with the running of the program being checkpointed.
Cite
CITATION STYLE
Li, K., Naughton, J. F., & Plank, J. S. (1990). Real-time, concurrent checkpoint for parallel programs. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP (Vol. Part F130005, pp. 79–88). Association for Computing Machinery. https://doi.org/10.1145/99163.99173
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.