📖
Replication Is More Efficient Than You Think
Anne Benoit, Thomas Herault, Valentin Le Fèvre, Yves Robert

Replication Is More Efficient Than You Think

Science & Mathematics Published 2019 Verification Pending

Overview & Synopsis

This paper revisits replication coupled with checkpointing for fail-stop errors. Replication enables the application to survive many fail-stop errors, thereby allowing for longer checkpointing periods. Previously published works use replication with the no-restart strategy, which never restart failed processors until the application crashes. We introduce the restart strategy where failed processors are restarted after each checkpoint. which may introduce additional overhead during checkpoints but prevents the application configuration from degrading throughout successive checkpointing periods. We show how to compute the optimal checkpointing period for this strategy, which is much larger than the one with no-restart, thereby decreasing I/O pressure. We show through simulations that using the restart strategy significantly decreases the overhead induced by replication, in terms of both total execution time and energy consumption.

Advertisement
SPONSOR CONTENT
Indexed from repository: HAL Open Science (hal.science)
Loading document from verified source...
Keyboard Shortcuts: ← / → for pages • + / - for zoom • 0 to fit width Powered by Mozilla PDF.js v3.11

Document Information

Document Title Replication Is More Efficient Than You Think
Author / Organization Anne Benoit, Thomas Herault, Valentin Le Fèvre, Yves Robert
Subject & Discipline Multidisciplinary Academic Open Research
Categories Science & Mathematics
Publication Year 2019
License / Rights Open Access / Creative Commons
Resource Verification Listed PDF (Verification Pending)
Original Host Website HAL Open Science (hal.science)
File Format application/pdf (Portable Document Format)
Language EN
Catalog ID DOC-7574
Original Source Link Visit Source Page on hal.science »