BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Information Systems Group - ECPv6.4.0.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://isg.ics.uci.edu
X-WR-CALDESC:Events for Information Systems Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20250309T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20251102T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251010T130000
DTEND;TZID=America/Los_Angeles:20251010T140000
DTSTAMP:20260525T152527
CREATED:20251010T193828Z
LAST-MODIFIED:20251010T193828Z
UID:2276-1760101200-1760104800@isg.ics.uci.edu
SUMMARY:Farzad Habibi: Brook-2PL: Tolerating High Contention Workloads with A Deadlock-Free Two-Phase Locking Protocol
DESCRIPTION:For this week’s IGS seminar\, Farzad will be presenting his research work.\n\nTime & Location:\n\n\nFriday Oct 10\, 2025\, 1:00 PM – 2:00 PM\nDonald Bren Hall 3011\, ICS\, UC Irvine \nLunch will be provided. \nTitle:\nBrook-2PL: Tolerating High Contention Workloads with A Deadlock-Free Two-Phase Locking Protocol \nAbstract: \nThe problem of hotspots remains a critical challenge in high-contention workloads for concurrency control (CC) protocols. Traditional concurrency control approaches encounter significant difficulties under high contention\, resulting in excessive transaction aborts and deadlocks. In this paper\, we propose Brook-2PL\, a novel two-phase locking (2PL) protocol that (1) introduces SLW-Graph for deadlock-free transaction execution\, and (2) proposes partial transaction chopping for early lock release. Previous methods suffer from transaction aborts that lead to wasted work and can further burden the system due to their cascading effects. Brook-2PL addresses this limitation by statically analyzing a new graph-based dependency structure called SLW-Graph\, enabling deadlock-free two-phase locking through predetermined lock acquisition. Brook-2PL also reduces contention by enabling early lock release using partial transaction chopping and static transaction analysis. We overcome the inherent limitations of traditional transaction chopping by providing a more flexible chopping method. Evaluation using both our synthetic online game store workload and the TPC-C benchmark shows that Brook-2PL significantly outperforms state-of-the-art CC protocols. Brook-2PL achieves an average speed-up of 2.86x while reducing tail latency (p95) by 48% in the TPC-C benchmark.\n\nBio: \n\n\n\nFarzad Habibi is a fourth-year PhD candidate in Computer Science at UC Irvine\, with a background in Computer Engineering from the University of Tehran. His research focuses on distributed data management\, spanning blockchain resilience\, database availability to metastable failures\, geo-distributed transactional databases\, and concurrency control under high contention.\n\n\n\n\nVolunteer:\nJuncheng Fang
URL:https://isg.ics.uci.edu/event/farzad-habibi-brook-2pl-tolerating-high-contention-workloads-with-a-deadlock-free-two-phase-locking-protocol/
LOCATION:DBH 3011
END:VEVENT
END:VCALENDAR