scientific article; zbMATH DE number 1351080

DOI10.4086/CJTCS.1999.009MaRDI QIDQ4267802zbMATH OpenOpenAlexFDO

Authors Martha J. Kosa

Publication date 20 October 1999

Published in Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4086/cjtcs.1999.009

zbMATH Keywords

linearizabilitysequential consistencyspecific types

Mathematics Subject Classification ID

Computer system organization (68M99) Data structures (68P05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Improved time bounds for linearizable implementations of abstract data types
• Implementing hybrid consistency with high-level synchronization operations
• Linearizable read/write objects
• scientific article; zbMATH DE number 1983294
• Time-Adaptive Algorithms for Synchronization

Cited in

(12)

• Hybrid concurrency control for abstract data types
• Linearizable read/write objects
• Improved time bounds for linearizable implementations of abstract data types
• Lower bounds on message passing implementations of multiplicity-relaxed queues and stacks
• Anomalies and similarities among consensus numbers of variously-relaxed queues
• Relaxed data types as consistency conditions
• Implementing set objects in dynamic distributed systems
• Implementing hybrid consistency with high-level synchronization operations
• Hundreds of impossibility results for distributed computing
• Parallel Processing and Applied Mathematics
• Brief Announcement: Improved, Partially-Tight Multiplicity Queue Lower Bounds
• Fast and space-efficient queues via relaxation

This page was built for publication:

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