A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems

DOI10.1016/0196-6774(81)90023-7MaRDI QIDQ3929050zbMATH OpenOpenAlexFDO

Authors Witold jun. Lipski, Christos Papadimitriou

Publication date 1981

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(81)90023-7

zbMATH Keywords

computational geometryconcurrent database updatesdatabase concurrency controllockingrectangles on the plane

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Cited in

(12)

• Is distributed locking harder?
• Partitioning and separating sets of orthogonal polygons
• Generalized halfspaces in restricted-orientation convexity
• Fundamentals of restricted-orientation convexity
• Visibility in semi-convex spaces
• A decompositin theorem for convexity spaces
• PLANAR STRONG VISIBILITY
• The geometry of conservative programs
• Deadlock-freedom (and safety) of transactions in a distributed database
• Cut-off theorems for the \textit{PV}-model
• Non-Hausdorff parallelized manifolds over geometric models of conservative programs
• On the power of safe locking

This page was built for publication: A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems

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