In today's high performance computing practice, fail-stop failures are often tolerated by checkpointing. While checkpointing is a very general technique and can often be applied to a wide range of applications, it often introduces a considerable overhead especially when computations reach petascale
โฆ LIBER โฆ
[ACM Press the 20th international symposium - San Jose, California, USA (2011.06.08-2011.06.11)] Proceedings of the 20th international symposium on High performance distributed computing - HPDC '11 - Algorithm-based recovery for iterative methods without checkpointing
โ Scribed by Chen, Zizhong
- Book ID
- 120594986
- Publisher
- ACM Press
- Year
- 2011
- Weight
- 779 KB
- Category
- Article
- ISBN
- 1450305520
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
[ACM Press the 20th international sympos
โ
Chen, Zizhong
๐
Article
๐
2011
๐
ACM Press
โ 779 KB
[ACM Press the 20th international sympos
โ
Al-Kiswany, Samer; Subhraveti, Dinesh; Sarkar, Prasenjit; Ripeanu, Matei
๐
Article
๐
2011
๐
ACM Press
โ 620 KB
[ACM Press the 20th international sympos
โ
Deshpande, Umesh; Wang, Xiaoshuang; Gopalan, Kartik
๐
Article
๐
2011
๐
ACM Press
โ 742 KB
[ACM Press the 20th international sympos
โ
Ravi, Vignesh T.; Becchi, Michela; Agrawal, Gagan; Chakradhar, Srimat
๐
Article
๐
2011
๐
ACM Press
โ 854 KB
[ACM Press the 30th annual ACM SIGACT-SI
โ
Pandurangan, Gopal; Trehan, Amitabh
๐
Article
๐
2011
๐
ACM Press
๐
English
โ 536 KB
[ACM Press the 30th annual ACM SIGACT-SI
โ
Pandurangan, Gopal; Trehan, Amitabh
๐
Article
๐
2011
๐
ACM Press
๐
English
โ 536 KB
We consider the problem of self-healing in reconfigurable networks (e.g. peer-to-peer and wireless mesh networks) that are under repeated attack by an omniscient adversary and propose a fully distributed algorithm, Xheal , that maintains good expansion and spectral properties of the network, also ke