Efficient dependency tracking for relevant events in shared-memory systems

DOI10.1145/1073814.1073818MaRDI QIDQ5177220zbMATH OpenOpenAlexFDO

Authors Anurag Agarwal, Vijay K. Garg

Publication date 10 March 2015

Published in Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1073814.1073818

zbMATH Keywords

predicate detectionshared-memoryvector clock

Mathematics Subject Classification ID

Distributed systems (68M14) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Theory of operating systems (68N25) Data structures (68P05) Distributed algorithms (68W15)

Recommendations

• Efficient dependency tracking for relevant events in concurrent systems
• Efficient vector time with dynamic process creation and termination
• An efficient implementation of vector clocks
• Plausible clocks: constant size logical clocks for distributed systems
• Bounded concurrent timestamp systems using vector clocks

Cited in

(6)

• Efficient dependency tracking for relevant events in concurrent systems
• Timestamping messages and events in a distributed system using synchronous communication
• Modeling, analyzing and slicing periodic distributed computations
• scientific article; zbMATH DE number 1863304 (Why is no real title available?)
• Sound concurrent traces for online monitoring
• Opportunistic monitoring of multithreaded programs

This page was built for publication: Efficient dependency tracking for relevant events in shared-memory systems

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