search

BenningtonCS / GFS

Implementation of Google File System
54 stars 18 forks source link

how does it implement the checkpointing? #166

Open jacobishao opened 6 years ago

jacobishao commented 6 years ago

in the paper,the checkpoint is in the form of Btree,how do you implement this? the checkpoint can be created without delaying incoming mutations.I don't known how to make it. can you give some explains? thank you

edaniszewski commented 6 years ago

If I recall correctly, this implementation doesn't have checkpointing. This was done as a class project a while back and is now essentially unsupported. When it was written, various constraints (e.g. time) prevented us from fully implementing GFS to the paper's spec.

Hope this helps

jacobishao commented 6 years ago

thank you very much!

2018-03-05 6:07 GMT+08:00 Erick Daniszewski notifications@github.com:

If I recall correctly, this implementation doesn't have checkpointing. This was done as a class project a while back and is now essentially unsupported. When it was written, various constraints (e.g. time) prevented us from fully implementing GFS to the paper's spec.

Hope this helps

— You are receiving this because you authored the thread. Reply to this email directly, view it on GitHub https://github.com/BenningtonCS/GFS/issues/166#issuecomment-370268738, or mute the thread https://github.com/notifications/unsubscribe-auth/AHw11PwiE0k59j-tIzeAp3kQOD8lpJuqks5tbGWugaJpZM4SbXUC .