Stem lock$ (all stems)

200 papers:

DAC-2015-AsadJ #programming #using #verification

Verifying inevitability of phase-locking in a charge pump phase lock loop using sum of squares programming (HuA, KDJ), p. 6.

VLDB-2015-MakreshanskiLS #hardware #memory management #transaction

To Lock, Swap, or Elide: On the Interplay of Hardware Transactional Memory and Lock-Free Indexing (DM, JJL, RS), pp. 1298–1309.

FM-2015-DerrickDSTW #transaction #verification

Verifying Opacity of a Transactional Mutex Lock (JD, BD, GS, OT, HW), pp. 161–177.

ICFP-2015-NewtonFV #adaptation #scalability

Adaptive lock-free maps: purely-functional to scalable (RRN, PPF, AV), pp. 218–229.

CHI-2015-SongCOKH #effectiveness #on the

On the Effectiveness of Pattern Lock Strength Meters: Measuring the Strength of Real World Pattern Locks (YS, GC, SO, HK, JHH), pp. 2343–2352.

CHI-2015-ZezschwitzLJH

Easy to Draw, but Hard to Trace?: On the Observability of Grid-based (Un)lock Patterns (EvZ, ADL, PJ, HH), pp. 2339–2342.

OOPSLA-2015-CohenP #automation #data type #memory management

Automatic memory reclamation for lock-free data structures (NC, EP), pp. 260–279.

CGO-2015-ZhengLHWJ #approach #debugging #manycore #on the #performance

On performance debugging of unnecessary lock contentions on multicore processors: a replay-based approach (LZ, XL, BH, SW, HJ), pp. 56–67.

LCTES-2015-ZhengW

WCET-Aware Dynamic D-cache Locking for A Single Task (WZ, HW), p. 10.

PPoPP-2015-0003GTT #queue

The lock-free k-LSM relaxed priority queue (MW, JG, JLT, PT), pp. 277–278.

PPoPP-2015-ChabbiFM #multi #performance

High performance locks for multi-level NUMA systems (MC, MWF, JMMC), pp. 215–226.

PPoPP-2015-Golan-GuetaRSY #automation #scalability #semantics

Automatic scalable atomicity via semantic locking (GGG, GR, MS, EY), pp. 31–41.

PPoPP-2015-RamachandranM #concurrent #named #performance #using

CASTLE: fast concurrent internal binary search tree using edge-based locking (AR, NM), pp. 281–282.

DAC-2014-Bhushan #injection #predict #visual notation

A Rigorous Graphical Technique for Predicting Sub-harmonic Injection Locking in LC Oscillators (PB), p. 8.

DATE-2014-DingLM

WCET-Centric dynamic instruction cache locking (HD, YL, TM), pp. 1–6.

VLDB-2014-SadoghiCBNR #concurrent #database #multi

Reducing Database Locking Contention Through Multi-version Concurrency (MS, MC, BB, FN, KAR), pp. 1331–1342.

STOC-2014-AlistarhCS #algorithm #concurrent #question

Are lock-free concurrent algorithms practically wait-free? (DA, KCH, NS), pp. 714–723.

OOPSLA-2014-ChakrabartiBB #consistency #memory management #named

Atlas: leveraging locks for non-volatile memory consistency (DRC, HJB, KB), pp. 433–452.

PADL-2014-AreiasR #correctness #logic programming #on the #performance #source code

On the Correctness and Efficiency of Lock-Free Expandable Tries for Tabled Logic Programs (MA, RR), pp. 168–183.

SAC-2014-SerranoG #performance

Locking fast (MS, JG), pp. 1556–1561.

ICSE-2014-CaiWC #approach #constraints #dynamic analysis #named #parallel #source code #thread

ConLock: a constraint-based approach to dynamic checking on deadlocks in multithreaded programs (YC, SW, WKC), pp. 491–502.

LCTES-2014-ZhengW #named

WCET: aware dynamic instruction cache locking (WZ, HW), pp. 53–62.

PPoPP-2014-Golan-GuetaRSY #automation #semantics

Automatic semantic locking (GGG, GR, MS, EY), pp. 385–386.

PPoPP-2014-NatarajanM #concurrent #performance

Fast concurrent lock-free binary search trees (AN, NM), pp. 317–328.

PPoPP-2014-OdairaCT #hardware #interpreter #memory management #ruby #transaction

Eliminating global interpreter locks in ruby through hardware transactional memory (RO, JGC, HT), pp. 131–142.

PPoPP-2014-PusukuriGB #concurrent #thread

Lock contention aware thread migrations (KKP, RG, LNB), pp. 369–370.

PPoPP-2014-TimnatP #data type #simulation

A practical wait-free simulation for lock-free data structures (ST, EP), pp. 357–368.

LICS-CSL-2014-Padovani #concurrent #linear #π-calculus

Deadlock and lock freedom in the linear π-calculus (LP), p. 10.

ASE-2013-Ganai #incremental #performance #predict #reasoning

Efficient data race prediction with incremental reasoning on time-stamped lock history (MKG), pp. 37–47.

DAC-2013-DingLM #analysis #multi #realtime

Integrated instruction cache analysis and locking in multitasking real-time systems (HD, YL, TM), p. 10.

SIGMOD-2013-GraefeLKTV

Controlled lock violation (GG, ML, HAK, JT, ACV), pp. 85–96.

SIGMOD-2013-JungHFHY #multi #scalability

A scalable lock manager for multicores (HJ, HH, ADF, GH, HYY), pp. 73–84.

ESOP-2013-CollingbourneDKQ #analysis #gpu #kernel #semantics #verification

Interleaving and Lock-Step Semantics for Analysis and Verification of GPU Kernels (PC, AFD, JK, SQ), pp. 270–289.

ESOP-2013-LuPX #correlation

Structural Lock Correlation with Ownership Types (YL, JP, JX), pp. 391–410.

FoSSaCS-2013-BonnetC #bound

Bounded Context-Switching and Reentrant Locking (RB, RC), pp. 65–80.

ICSM-2013-XinQHXZWG #concurrent #empirical #source code

An Automation-Assisted Empirical Study on Lock Usage for Concurrent Programs (RX, ZQ, SH, CX, YZ, YW, HG), pp. 100–109.

SAS-2013-LammichMSW #automaton #network

Contextual Locking for Dynamic Pushdown Networks (PL, MMO, HS, AW), pp. 477–498.

VISSOFT-2013-ReissT #automation #behaviour #categorisation #visualisation

Automatic categorization and visualization of lock behavior (SPR, AT), pp. 1–10.

CGO-2013-ChoKWLLM #concurrent #source code

Practical lock/unlock pairing for concurrent programs (HKC, TK, YW, SL, HL, SAM), p. 12.

CGO-2013-YanTZYS #algorithm #fine-grained #graph #named #parallel #traversal

Vlock: Lock virtualization mechanism for exploiting fine-grained parallelism in graph traversal algorithms (JY, GT, XZ, EY, NS), p. 10.

PPoPP-2013-AfekLM #hardware #programming

Programming with hardware lock elision (YA, AL, AM), pp. 295–296.

PPoPP-2013-CalciuDLLMS

NUMA-aware reader-writer locks (IC, DD, YL, VL, VJM, NS), pp. 157–166.

PPoPP-2013-DiceLLLM #algorithm #hardware #memory management #transaction #using

Using hardware transactional memory to correct and simplify and readers-writer lock algorithm (DD, YL, YL, VL, MM), pp. 261–270.

LICS-2013-HoffmannMS #proving #reasoning

Quantitative Reasoning for Proving Lock-Freedom (JH, MM, ZS), pp. 124–133.

DAC-2012-DingLM

WCET-centric partial instruction cache locking (HD, YL, TM), pp. 412–420.

DATE-2012-NeogyR #analysis #design #injection

Analysis and design of sub-harmonically injection locked oscillators (AN, JSR), pp. 1209–1214.

VLDB-2013-RenTA12 #database #in memory #lightweight #memory management

Lightweight Locking for Main Memory Database Systems (KR, AT, DJA), pp. 145–156.

ESOP-2012-HawkinsAFRS #reasoning

Reasoning about Lock Placements (PH, AA, KF, MCR, MS), pp. 336–356.

TACAS-2012-ChadhaMV #reachability

Reachability under Contextual Locking (RC, PM, MV), pp. 437–450.

CHI-2012-KarrerWB #named #navigation #video

DragLocks: handling temporal ambiguities in direct manipulation video navigation (TK, MW, JOB), pp. 623–626.

ECOOP-2012-GudkaHE #library #scalability

Lock Inference in the Presence of Large Libraries (KG, TH, SE), pp. 308–332.

SAC-2012-FanS #automation #collaboration #dependence #programming #realtime #semantics

Dependency-based automatic locking for semantic conflict prevention in real-time collaborative programming (HF, CS), pp. 737–742.

CGO-2012-PlazarKMF

WCET-aware static locking of instruction caches (SP, JCK, PM, HF), pp. 44–52.

PPoPP-2012-DiceMS #design

Lock cohorting: a general technique for designing NUMA locks (DD, VJM, NS), pp. 247–256.

PPoPP-2012-LiuS #queue

A lock-free, array-based priority queue (YL, MFS), pp. 323–324.

PPoPP-2012-ZhangL #linear #named

LHlf: lock-free linear hashing (poster paper) (DZ, PÅL), pp. 307–308.

CAV-2012-KahlonW #concurrent #source code

Lock Removal for Concurrent Trace Programs (VK, CW), pp. 227–242.

DAC-2011-NowrozWR #modelling #using

Improved post-silicon power modeling using AC lock-in techniques (ANN, GW, SR), pp. 101–106.

PLDI-2011-ZengWL #concurrent #data type #monitoring #named #using

Cruiser: concurrent heap buffer overflow monitoring using lock-free data structures (QZ, DW, PL), pp. 367–377.

STOC-2011-FawziHS #nondeterminism #performance

From low-distortion norm embeddings to explicit uncertainty relations and efficient information locking (OF, PH, PS), pp. 773–782.

OOPSLA-2011-Golan-GuetaBARSY #automation #using

Automatic fine-grain locking using shape properties (GGG, NGB, AA, GR, MS, EY), pp. 225–242.

ICSE-2011-SchaferSDT #flexibility #java #refactoring #source code

Refactoring Java programs for flexible locking (MS, MS, JD, FT), pp. 71–80.

LCTES-2011-SarkarMR #manycore #migration #predict

Predictable task migration for locked caches in multi-core systems (AS, FM, HR), pp. 131–140.

PPoPP-2011-FernandesC #memory management #multi #scalability #transaction

Lock-free and scalable multi-version software transactional memory (SMF, JPC), pp. 179–188.

VMCAI-2011-GawlitzaLMSW #analysis #concurrent #process #reachability #source code

Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation (TMG, PL, MMO, HS, AW), pp. 199–213.

DAC-2010-LiangM #reuse #using

Instruction cache locking using temporal reuse profile (YL, TM), pp. 344–349.

ESOP-2010-LeinoMS #concurrent

Deadlock-Free Channels and Locks (KRML, PM, JS), pp. 407–426.

ICSM-2010-CeccatoT #consistency #legacy #migration #static analysis #thread

Static analysis for enforcing intra-thread consistent locks in the migration of a legacy system (MC, PT), pp. 1–9.

PLDI-2010-NakaikeM #java

Lock elision for read-only critical sections in Java (TN, MMM), pp. 269–278.

SAS-2010-FarzanK #analysis #composition #concurrent #source code

Compositional Bitvector Analysis for Concurrent Programs with Nested Locks (AF, ZK), pp. 253–270.

PPoPP-2010-AgrawalLS #parallel #programming

Helper locks for fork-join parallel programming (KA, CEL, JS), pp. 245–256.

PPoPP-2010-CedermanT #composition #concurrent

Supporting lock-free composition of concurrent data objects (DC, PT), pp. 339–340.

PPoPP-2010-MannarswamyCRS #compilation #memory management #performance #transaction

Compiler aided selective lock assignment for improving the performance of software transactional memory (SM, DRC, KR, SS), pp. 37–46.

PPoPP-2010-TallentMP #parallel #thread

Analyzing lock contention in multithreaded applications (NRT, JMMC, AP), pp. 269–280.

PPoPP-2010-UpadhyayaMP #data type #generative #performance #using

Using data structure knowledge for efficient lock generation and strong atomicity (GU, SPM, VSP), pp. 281–292.

VLDB-2009-JohnsonPA #inheritance #scalability #using

Improving OLTP Scalability using Speculative Lock Inheritance (RJ, IP, AA), pp. 479–489.

VLDB-2009-LometM #transaction

Locking Key Ranges with Unbundled Transaction Services (DBL, MFM), pp. 265–276.

PLDI-2009-PetrankMS #bound #parallel #source code

Progress guarantee for parallel programs via bounded lock-freedom (EP, MM, BS), pp. 144–154.

POPL-2009-GuerraouiK #memory management #semantics #transaction

The semantics of progress in lock-based transactional memory (RG, MK), pp. 404–415.

SAC-2009-LaiRC #embedded #on the #realtime #scheduling

On scheduling soft real-time tasks with lock-free synchronization for embedded devices (SL, BR, HC), pp. 1685–1686.

CAV-2009-FarzanMS

Meta-analysis for Atomicity Violations under Nested Locking (AF, PM, FS), pp. 248–262.

LICS-2009-Kahlon #bound #communication #decidability #thread

Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via Locks (VK), pp. 27–36.

DAC-2008-SuhendraM #clustering #multi #predict

Exploring locking & partitioning for predictable shared caches on multi-cores (VS, TM), pp. 300–303.

DATE-2008-GouraryRUZMG #analysis #injection

Analysis of Oscillator Injection Locking by Harmonic Balance Method (MMG, SGR, SLU, MMZ, BJM, KKG), pp. 318–323.

DATE-2008-QuSN #configuration management #performance #runtime

Improving the Efficiency of Run Time Reconfigurable Devices by Configuration Locking (YQ, JPS, JN), pp. 264–267.

PLDI-2008-CheremCG

Inferring locks for atomic sections (SC, TMC, SG), pp. 304–315.

ICEIS-DISI-2008-HuangG #api #documentation #protocol #xml

A Locking Protocol for DOM API on XML Documents (YFH, MLG), p. 105–?.

SAC-2008-ChenCK #multi #realtime

Multiprocessor frequency locking for real-time task synchronization (YSC, LPC, TWK), pp. 289–293.

CC-2008-CunninghamGE

Keep Off the Grass: Locking the Right Path for Atomicity (DC, KG, SE), pp. 276–290.

PPoPP-2008-GiacomoniMV #concurrent #parallel #performance #pipes and filters #queue

FastForward for efficient pipeline parallelism: a cache-optimized concurrent lock-free queue (JG, TM, MV), pp. 43–52.

CAV-2008-KobayashiS #hybrid #mobile #process #type system

A Hybrid Type System for Lock-Freedom of Mobile Processes (NK, DS), pp. 80–93.

DAC-2007-ChanZ #modelling

Modeling Simultaneous Switching Noise-Induced Jitter for System-on-Chip Phase-Locked Loops (HHYC, ZZ), pp. 430–435.

DAC-2007-KangKR #design #power management #using

Variation Resilient Low-Power Circuit Design Methodology using On-Chip Phase Locked Loop (KK, KK, KR), pp. 934–939.

DATE-2007-BarajasCCMGCBI #behaviour #interactive #modelling #optimisation

Interactive presentation: Behavioral modeling of delay-locked loops and its application to jitter optimization in ultra wide-band impulse radio systems (EB, RC, DC, DM, JLG, IC, SB, MI), pp. 1430–1435.

DATE-2007-PuautP #comparison #realtime

Scratchpad memories vs locked caches in hard real-time systems: a quantitative comparison (IP, CP), pp. 1484–1489.

SEFM-2007-ColvinG #algorithm #scalability #stack #verification

A Scalable Lock-Free Stack Algorithm and its Verification (RC, LG), pp. 339–348.

TOOLS-EUROPE-2007-PotterS #incremental

Incremental Lock Selection for Composite Objects (JP, AS), pp. 477–494.

PPDP-2007-Berdine #reasoning

Local reasoning about storable locks (JB), p. 153.

POPL-2007-EmmiFJM

Lock allocation (ME, JSF, RJ, RM), pp. 291–296.

PPoPP-2007-Boehm #constraints #order #thread

Reordering constraints for pthread-style locks (HJB), pp. 173–182.

PPoPP-2007-ZhangSZSG #concurrent

Optimized lock assignment and allocation: a method for exploiting concurrency among critical sections (YZ, VCS, WZ, VS, GRG), pp. 146–147.

DAC-2006-ZouMGS #optimisation

A CPPLL hierarchical optimization methodology considering jitter, power and locking time (JZ, DM, HEG, US), pp. 19–24.

DATE-2006-ChoRJ #embedded #realtime

Lock-free synchronization for dynamic embedded real-time systems (HC, BR, EDJ), pp. 438–443.

DATE-DF-2006-ChengL #multi

A fast-lock mixed-mode DLL with wide-range operation and multiphase outputs (KHC, YLL), pp. 178–182.

SIGMOD-2006-MathisHH #query #xml

Locking-aware structural join operators for XML query processing (CM, TH, MPH), pp. 467–478.

VLDB-2006-HausteinHL #contest #protocol #xml

Contest of XML Lock Protocols (MPH, TH, KL), pp. 1069–1080.

ESOP-2006-BrobergS #calculus #policy #towards

Flow Locks: Towards a Core Calculus for Dynamic Flow Policies (NB, DS), pp. 180–196.

FLOPS-2006-DiscoloHMJS #data type #haskell #using

Lock Free Data Structures Using STM in Haskell (AD, TH, SM, SLPJ, SS), pp. 65–80.

ECOOP-2006-WelcHJ #java #transaction

Transparently Reconciling Transactions with Locking for Java Synchronization (AW, ALH, SJ), pp. 148–173.

OOPSLA-2006-RussellD

Eliminating synchronization-related atomic operations with biased locking and bulk rebiasing (KR, DD), pp. 263–272.

OSDI-2006-Burrows #distributed

The Chubby Lock Service for Loosely-Coupled Distributed Systems (MB), pp. 335–350.

PPoPP-2005-HarrisF #programming

Revocable locks for non-blocking programming (TLH, KF), pp. 72–82.

CAV-2005-KahlonIG #communication #reasoning #thread

Reasoning About Threads Communicating via Locks (VK, FI, AG), pp. 505–518.

PLDI-2004-Michael #memory management #scalability

Scalable lock-free dynamic memory allocation (MMM), pp. 35–46.

ECOOP-2004-OnoderaKK #java

Lock Reservation for Java Reconsidered (TO, KK, AK), pp. 559–583.

SAC-2004-SundellT #concurrent #scalability

Scalable and lock-free concurrent dictionaries (HS, PT), pp. 1438–1445.

CAV-2004-GaoH #algorithm #parallel #reduction

A Formal Reduction for Lock-Free Parallel Algorithms (HG, WHH), pp. 44–56.

DATE-2003-AkgulM #generative #named

PARLAK: Parametrized Lock Cache Generator (BSA, VJMI), pp. 11138–11139.

DATE-2003-BurbidgeTR #automation #embedded #monitoring

Techniques for Automatic On Chip Closed Loop Transfer Function Monitoring For Embedded Charge Pump Phase Locked Loops (MJB, JT, AR), pp. 10496–10503.

DATE-2003-VanasscheGS #analysis #detection #domain model #modelling

Time-Varying, Frequency-Domain Modeling and Analysis of Phase-Locked Loops with Sampling Phase-Frequency Detectors (PV, GGEG, WMCS), pp. 10238–10243.

SIGMOD-2003-ChoALS #named #query #xml

LockX: A System for Efficiently Querying Secure XML (SC, SAY, LVSL, DS), p. 669.

VLDB-2003-LuoNEW #protocol

Locking Protocols for Materialized Aggregate Join Views (GL, JFN, CJE, MW), pp. 596–607.

HPCA-2003-RadovicH #architecture #communication

Hierarchical Backoff Locks for Nonuniform Communication Architectures (ZR, EH), pp. 241–252.

DATE-2002-DuarteVI #power management

A Complete Phase-Locked Loop Power Consumption Model (DD, NV, MJI), p. 1108.

ASIA-PEPM-2002-IwamaK #type system #virtual machine

A new type system for JVM lock primitives (FI, NK), pp. 71–82.

OOPSLA-2002-KawachiyaKO #java

Lock reservation: Java locks can mostly do without atomic operations (KK, AK, TO), pp. 130–141.

ASPLOS-2002-RajwarG #execution #source code #transaction

Transactional lock-free execution of lock-based programs (RR, JRG), pp. 5–17.

ISMM-2002-DiceG

Mostly lock-free malloc (DD, AG), pp. 269–280.

PODS-2001-Schuldt #execution #order #process #protocol #transaction

Process Locking: A Protocol based on Ordered Shared Locks for the Execution of Transactional Processes (HS).

AdaEurope-2001-Burns #ada #policy

Defining New Non-preemptive Dispatching and Locking Policies for Ada (AB), pp. 328–336.

PPoPP-2001-ScottS #scalability

Scalable queue-based spin locks with timeout (MLS, WNSI), pp. 44–52.

DATE-2000-GouraryRUZGM #approach

A New Approach for Computation of Timing Jitter in Phase Locked Loops (MMG, SGR, SLU, MMZ, KKG, BJM), pp. 345–349.

VLDB-1999-Campbell #architecture #sql

The New Locking, Logging, and Recovery Architecture of Microsoft SQL Server 7.0 (DC), p. 249.

ESOP-1999-FlanaganA

Types for Safe Locking (CF, MA), pp. 91–108.

OOPSLA-1999-AgesenDGKRW #implementation #performance #ubiquitous

An Efficient Meta-Lock for Implementing Ubiquitous Synchronization (OA, DD, AG, RK, YSR, DW), pp. 207–222.

OOPSLA-1999-OnoderaK #case study

A Study of Locking Objects with Bimodal Fields (TO, KK), pp. 223–237.

HPCA-1999-KuoCK #message passing #named

MP-LOCKs: Replacing H/W Synchronization Primitives with Message Passing (CCK, JBC, RK), pp. 284–288.

PLDI-1998-BaconKMS #java

Thin Locks: Featherweight Synchronization for Java (DFB, RBK, CM, MJS), pp. 258–268.

Best-of-PLDI-1998-BaconKMS98a #java

Thin locks: featherweight Synchronization for Java (with retrospective) (DFB, RBK, CM, MJS), pp. 583–595.

HCI-SEC-1997-MatsushitaMA #interactive #pointer

Lock-On Pointer: A Foundation for Human-Object Interaction (NM, MM, YA), pp. 193–196.

EDOC-1997-Hull #transaction

Global Predicate-Based Locks in Long-Running Transactions (RH), p. 197–?.

SAC-1996-JunY #automation #database #object-oriented

A mechanism for automatic object locking in C++-based object-oriented databases (YSJ, SIY), pp. 137–144.

PODS-1995-ChaudhriH #database #policy

Safe Locking Policies for Dynamic Databases (VKC, VH), pp. 233–244.

VLDB-1995-KornackerB

High-Concurrency Locking in R-Trees (MK, DB), pp. 134–145.

EDAC-1994-LinKL #approach #synthesis

Direct Synthesis of Hazard-Free Asynchronous Circuits from STGs Based on Lock Relation and BG-Decomposition Approach (KJL, JWK, CSL), pp. 178–183.

PODS-1994-AlonsoAA #constraints #protocol

Reducing Recovery Constraints on Locking based Protocols (GA, DA, AEA), pp. 129–138.

CIKM-1994-ChuW #object-oriented

Minipage Locking Support for Object-Oriented Page-Server DBMS (ISC, MW), pp. 171–178.

CIKM-1994-HelalKF

Quasi-Dynamic Two-Phase Locking (AH, THK, JF), pp. 211–218.

CIKM-1994-RezendeH #abstraction #semantics #using

A Lock Method for KBMSs Using Abstraction Relationships’ Semantics (FdFR, TH), pp. 112–121.

OOPSLA-1994-ResendeAA #database #object-oriented #semantics

Semantic Locking in Object-Oriented Database Systems (RFR, DA, AEA), pp. 388–402.

VLDB-1993-Lomet #concurrent

Key Range Locking Strategies for Improved Concurrency (DBL), pp. 655–664.

CIKM-1993-CellaryW #database #multi #object-oriented

Locking Objects and Classes in Multiversion Object-Oriented Databases (WC, WW), pp. 586–595.

CIKM-1993-Lee #algorithm #precise #transaction

Precision Locking Algorithm for Nested Transactions Systems (JKL), pp. 674–683.

PPoPP-1993-MorrisettT #framework #ml #multi #standard

Procs and Locks: A Portable Multiprocessing Platform for Standard ML of New Jersey (JGM, APT), pp. 198–207.

PODS-1992-AgrawalAJ #approach #protocol #transaction

An Approach to Eliminate Transaction Blocking in Locking Protocols (DA, AEA, RJ), pp. 223–235.

PODS-1992-TurekSP #algorithm #concurrent #data type

Locking without Blocking: Making Lock Based Concurrent Data Structure Algorithms Nonblocking (JT, DS, SP), pp. 212–222.

SIGMOD-1992-AgrawalAJ #database #protocol #realtime #using

Using Delayed Commitment in Locking Protocols for Real-Time Databases (DA, AEA, RJ), pp. 104–113.

SIGMOD-1992-DanY #analysis #performance #policy

Performance Analysis of Coherency Control Policies through Lock Retention (AD, PSY), pp. 114–123.

SIGMOD-1992-MohanPL #flexibility #performance #transaction #version control

Efficient and Flexible Methods for Transient Versioning of Records to Avoid Locking by Read-Only Transactions (CM, HP, RAL), pp. 124–133.

VLDB-1992-BoberC #multi #query

Multiversion Query Locking (PMB, MJC), pp. 497–510.

VLDB-1992-GottemukkalaL #database

Locking and Latching in a Memory-Resident Database System (VG, TJL), pp. 533–544.

CSCW-1992-Newman-WolfeWM #concurrent #editing #object-oriented

Implicit Locking in the Ensemble Concurrent Object-Oriented Graphics Editor (RENW, MLW, MM), pp. 265–272.

SOSP-WIP-1991-MassalinP92 #kernel #multi

A Lock-Free Multiprocessor OS Kernel (Abstract) (HM, CP), p. 8.

VLDB-1991-Joshi #adaptation #multi

Adaptive Locking Strategies in a Multi-node Data Sharing Environment (AMJ), pp. 181–191.

VLDB-1991-MohanN #performance #protocol #transaction

Recovery and Coherency-Control Protocols for Fast Intersystem Page Transfer and Fine-Granularity Locking in a Shared Disks Transaction Environment (CM, IN), pp. 193–207.

PODS-1990-AgrawalA

Locks with Constrained Sharing (DA, AEA), pp. 85–93.

PODS-1990-CareyKL #approach

Load Control for Locking: The “Half-and-Half” Approach (MJC, SK, ML), pp. 72–84.

VLDB-1990-Mohan #concurrent #multi #named #transaction

ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes (CM), pp. 392–405.

VLDB-1990-Mohan90a #commit #named #novel #transaction

Commit_LSN: A Novel and Simple Method for Reducing Locking and Latching in Transaction Processing Systems (CM), pp. 406–418.

PODS-1988-Kelter #concurrent #protocol #queue

The Queue Protocol: A Deadlock-free Homogeneous Non-Two-Phase Locking Protocol (UK), pp. 142–151.

PODS-1988-LaninS #concurrent #set

Concurrent Set Manipulation without Locking (VL, DS), pp. 211–220.

SIGMOD-1988-RoeslerB #concurrent #distributed #modelling #object-oriented #semantics

Deadlock Resolution and Semantic Lock Models in Object-Oriented Distributed Systems (MR, WAB), pp. 361–370.

PODS-1987-Biliris

Operation Specific Locking in B-Trees (AB), pp. 159–169.

PODS-1987-FeketeLMW #transaction

Nested Transactions and Read/Write Locking (AF, NAL, MM, WEW), pp. 97–111.

PODS-1986-Su #safety

Safety of Non-Well-Locked Trasnaction Systems (JS), pp. 47–52.

VLDB-1985-CellaryM #database #distributed #infinity

Locking with Prevention of Cyclic and Infinite Restarting in Distributed Database Systems (WC, TM), pp. 115–126.

VLDB-1985-LausenSW #concurrent #policy

Pre-Analysis Locking: A Safe and Deadlock Free Locking Policy (GL, ESS, PW), pp. 270–281.

PODS-1984-BuckleyS #concurrent #graph #protocol #using

Concurrency Control in Graph Protocols by Using Edge Locks (GNB, AS), pp. 45–50.

PODS-1984-LausenSW #concurrent

Maximal Concurrency by Locking (GL, ESS, PW), pp. 38–44.

PODS-1984-TaySG #database #performance

A Mean Value Performance Model for Locking in Databases: The Waiting Case (YCT, RS, NG), pp. 311–322.

VLDB-1984-TayS #database #performance

Choice and Performance in Locking for Databases (YCT, RS), pp. 119–128.

PODS-1983-GoodmanST #database #performance

A Simple Analytic Model for Performance of Exclusive Locking in Database Systems (NG, RS, YCT), pp. 203–215.

SIGMOD-1983-KohlerWS #comparison #database #policy

An Experimental Comparison of Locking Policies in a Testbed Database System (WHK, KCW, JAS), pp. 108–119.

VLDB-1983-DasguptaK #concurrent #database #protocol

A Non-Two-Phase Locking Protocol for Concurrency Control in General Databases (PD, ZMK), pp. 92–94.

VLDB-1983-LinN #multi

Basic Timestamp, Multiple Version Timestamp, and Two-Phase Locking (WTKL, JN), pp. 109–119.

PODS-1982-KanellakisP #distributed #question

Is Distributed Locking Harder? (PCK, CHP), pp. 98–107.

PODS-1982-MohanFS #commutative #protocol

Compatibility and Commutativity in Non-two-phase Locking Protocols (CM, DSF, AS), pp. 283–292.

PODS-1982-Soisalon-SoininenW #algorithm #detection #safety #testing #transaction

An Optimal Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems (ESS, DW), pp. 108–116.

VLDB-1982-KedemMS #concurrent #performance #protocol

An Efficient Deadlock Removal Scheme for Non-Two-Phase Locking Protocols (ZMK, CM, AS), pp. 91–97.

CADE-1982-GreenbaumNOP #comparison #deduction #implementation

Comparison of Natural Deduction and Locking Resolution Implementations (SG, AN, PO, DAP), pp. 159–171.

SIGMOD-1981-JordanBB #precise

Precision Locks (JRJ, JB, RBB), pp. 143–147.

SIGMOD-1981-Papadimitriou #on the #power of

On the Power of Locking (CHP), pp. 148–154.

VLDB-1981-FussellKS #database #formal method #protocol

A Theory of Correct Locking Protocols for Database Systems (DSF, ZMK, AS), pp. 112–124.

STOC-1981-Yannakakis #concurrent #correctness #database

Issues of Correctness in Database Concurrency Control by Locking (MY), pp. 363–367.

VLDB-1980-KedemS #protocol

Non-Two-Phase Locking Protocols with Shared and Exclusive Locks (ZMK, AS), pp. 309–317.

SIGMOD-1979-HuntR #complexity #testing

The Complexity of Testing Predicate Locks (HBHI, DJR), pp. 127–133.

VLDB-1979-Date #database #programming #tutorial

Locking and Recovery in a Shared Database System: An Application Programming Tutorial (CJD), pp. 1–15.

SIGMOD-1978-MenascePM #coordination #database #distributed #protocol

A Locking Protocol for Resource Coordination in Distributed Databases (Abstract) (DAM, GJP, RRM), p. 2.

SIGMOD-1977-RiesS #case study #database

A Study of the Effects of Locking Granularity in a Data Base Management System (Abstract) (DRR, MS), p. 121.

VLDB-1975-GrayLPT #database #scalability

Granularity of Locks in a Large Shared Data Base (JG, RAL, GRP, ILT), pp. 428–451.