Finding the appropriate location of adaptation points for computation migration/checkpointing is critical since the distance between two consecutive adaptation points determines the migration/checkpointing scheme's sensitivity and overheads. This paper proposes a heuristic adaptation point placement algorithm to improve the computation migration/checkpointing schemes' performance in terms of sensitivity and flexibility. This heuristic algorithm enables automatic and transparent insertion of checkpoints in user's source code.
['Yanqing Ji', 'Hai Jiang', 'Vipin Chaudhary']
Adaptation point analysis for computation migration/checkpointing