Implementation of automated fine-granularity locking in a persistent programming language

DOI10.1002/(SICI)1097-024X(20000410)30:4%3C325::AID-SPE302%3E3.0.CO;2-QMaRDI QIDQ4791143zbMATH OpenOpenAlexFDO

Authors Laurent Daynès

Publication date 4 February 2003

Full work available at URL https://doi.org/10.1002/(sici)1097-024x(20000410)30:4%3C325::aid-spe302%3E3.0.co;2-q

zbMATH Keywords

automated lockingperformancepersistent programming language

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of operating systems (68N25) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 2000446
• scientific article; zbMATH DE number 1897118
• Multi-granularity locking for nested transactions: A proof using a possibilities mapping
• scientific article; zbMATH DE number 1897135
• Adaptive locks: combining transactions and locks for efficient concurrency

Cited in

(5)

• Lock coarsening: Eliminating lock overhead in automatically parallelized object-based programs
• An efficient object promotion algorithm for persistent objet systems
• scientific article; zbMATH DE number 2080405 (Why is no real title available?)
• Autarkies and Persistencies for QUBO
• On Cross-Stage Persistence in Multi-Stage Programming

Describes a project that uses

Uses Software

• SPECjvm98

This page was built for publication: Implementation of automated fine-granularity locking in a persistent programming language

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