Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
The notion of a weak snapshot scan is introduced and a methodology for using this abstraction is proposed. Two examples of algorithms are presented whose performance is enhanced while retaining a simple modular structure: bounded concurrent time-stamping and bounded randomized consensus. The resulting time-stamping protocol dominates all other currently known time-stamping protocols.
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
Yun Mao, Hani Jamjoom, et al.
CoNEXT 2006
Zohar Feldman, Avishai Mandelbaum
WSC 2010
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000