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. Categories and Subject Descriptors C.2.4 [Computer-Communication Networks]: Distributed Systems – Distributed applications. General Terms Algorithms, Performance, Experimentation. Keywords Adaptation points, checkpointing, process migration, thread migration.