Optimization strategies for inter-thread synchronization overhead on NUMA machine

Author(s):  
Song Wu ◽  
Jun Zhang ◽  
Yaqiong Peng ◽  
Hai Jin ◽  
Wenbin Jiang
2013 ◽  
Vol 20 (6) ◽  
pp. 1582-1591 ◽  
Author(s):  
Rui Zhu ◽  
Lei-hua Qin ◽  
Jing-li Zhou ◽  
Huan Zheng

Author(s):  
James Dinan ◽  
Clement Cole ◽  
Gabriele Jost ◽  
Stan Smith ◽  
Keith Underwood ◽  
...  

2013 ◽  
Vol 9 (4) ◽  
pp. 1-22 ◽  
Author(s):  
Jimmy Cleary ◽  
Owen Callanan ◽  
Mark Purcell ◽  
David Gregg

2001 ◽  
Vol 31 (7) ◽  
pp. 667-695 ◽  
Author(s):  
Hsin-Ta Chiao ◽  
Shyan-Ming Yuan

2012 ◽  
Vol 263-266 ◽  
pp. 1492-1496
Author(s):  
Jin Ho Ahn

Two opposite approaches were proposed to address some scalability problem resulting from coordinated checkpointing's synchronization during failure-free operation: minimizing the number of checkpointing participants and having the checkpointing process non-blocking. However, these previous approaches, oblivious to the underlying network, may not fundamentally provide any breakthrough for ensuring high scalability required in very large-scale P2P-based systems. This paper proposes a non-blocking coordinated checkpointing protocol to significantly reduce checkpointing synchronization overhead by structuring the peer-to-peer network into a set of groups according to a particular criterion. In this protocol, among processes in a group, one is designated as representative with the following special roles, intra-group and inter-group checkpointing coordination. Intra-group checkpointing coordination addresses the checkpointing procedure among processes within a group. On the other hand, inter-group checkpointing coordination is performed only among representatives. Thanks to this beneficial feature, the proposed protocol may considerably reduce the number of checkpointing control messages routed on core networks compared with the existing ones.


Sign in / Sign up

Export Citation Format

Share Document