Efficient Bounded Timestamping from Standard Synchronization Primitives (Q6202232): Difference between revisions

@@ Property / cites work @@
+Atomic snapshots of shared memory
@@ Property / cites work: Atomic snapshots of shared memory / rank @@
+Normal rank
@@ Property / cites work @@
+Making objects writable
@@ Property / cites work: Making objects writable / rank @@
+Normal rank
@@ Property / cites work @@
+Composite registers
@@ Property / cites work: Composite registers / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded Concurrent Time-Stamping
@@ Property / cites work: Bounded Concurrent Time-Stamping / rank @@
+Normal rank
@@ Property / cites work @@
+Time-Lapse Snapshots
@@ Property / cites work: Time-Lapse Snapshots / rank @@
+Normal rank
@@ Property / cites work @@
+Simple and efficient bounded concurrent timestamping and the traceable use abstraction
+Normal rank
@@ Property / cites work @@
+The space complexity of unbounded timestamps
@@ Property / cites work: The space complexity of unbounded timestamps / rank @@
+Normal rank
@@ Property / cites work @@
+Anonymous and fault-tolerant shared-memory computing
+Normal rank
@@ Property / cites work @@
+Bounded concurrent timestamp systems using vector clocks
+Normal rank
@@ Property / cites work @@
+The space complexity of long-lived and one-shot timestamp implementations
+Normal rank
@@ Property / cites work @@
+Efficient and practical constructions of LL/SC variables
+Normal rank
@@ Property / cites work @@
+A new solution of Dijkstra's concurrent programming problem
+Normal rank
@@ Property / cites work @@
+Time, clocks, and the ordering of events in a distributed system
+Normal rank
@@ Property / cites work @@
+Q4427876
@@ Property / cites work: Q4427876 / rank @@
+Normal rank