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

DOI10.1016/0196-6774(81)90023-7zbMath0474.68059OpenAlexW2041066466MaRDI QIDQ3929050

Witold jun. Lipski, Christos H. 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

lockingcomputational geometrydatabase concurrency controlconcurrent database updatesrectangles on the plane

Mathematics Subject Classification ID

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

Related Items (11)

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

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