The space complexity of long-lived and one-shot timestamp implementations

DOI10.1145/2559904MaRDI QIDQ6829038zbMATH OpenFDO

Authors Maryam Helmi, Lisa Higham, Eduardo Pacheco, Philipp Woelfel

Publication date 12 September 2014

Published in Journal of the ACM (Search for Journal in Brave)

zbMATH Keywords

shared memoryspace complexitytimestampsobstruction-freewait-freesolo-termination

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

This page was built for publication: The space complexity of long-lived and one-shot timestamp implementations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6829038)