Analysis of Checkpointing Schemes for Multiprocessor Systems. Avi Ziv Jehoshua Bruck Presentation By: Emre Chasan Moustafa. Outline. Introduction Checkpointing Execution Of A Task Performance Analysis Analysis Technique Analysis technique Building The State Machine
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Presentation By: Emre Chasan Moustafa
The execution of the previous figure causes thefollowing transitions (the number above the arrows arethe edges that are used for the transitions)
Comparison between analytical and simulation results of the average execution time for the DMR-B-1 scheme
where S is the average number of steps it takes to complete an interval.
Average execution time with optimal checkpoints
(The average work of a task is of length 1 with overhead time of t,,, = 0.002)