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:20251003T130000
DTEND;TZID=America/Los_Angeles:20251003T140000
DTSTAMP:20260426T083107
CREATED:20250928T025441Z
LAST-MODIFIED:20251005T052555Z
UID:2259-1759496400-1759500000@isg.ics.uci.edu
SUMMARY:Dr. Taina Coleman: Research Without Borders: High Performance Computing for Discovery Across Domains
DESCRIPTION:Research Without Borders: High Performance Computing for Discovery Across Domains\nDr. Tainã Coleman\, San Diego Supercomputer Center (SDSC)\n\nOct. 3\, Friday\, 1 – 2 pm\, DBH 3011\, UCI\n\n\n\nTitle: High-performance computing (HPC) drives discovery\, but access often requires deep technical expertise. This talk explores how to broaden access and empower researchers across disciplines. I’ll begin with WfCommons (wfcommons.org)\, which generates realistic workflows and benchmarks to lower barriers for building and evaluating workflow applications. Next\, I’ll cover the National Data Platform (nationaldataplatform.org)\, a federated ecosystem that connects distributed data resources. My work there involves developing tools that make large-scale data and computing resources usable beyond computer science\, thereby democratizing access across various fields. Finally\, I’ll share emerging directions that extend HPC into the humanities and beyond\, including collaborations on Indigenous datasets that highlight the need for culturally respectful approaches. Together\, these efforts envision HPC without borders\, where workflows\, data\, and cultural awareness converge to enable discovery across all domains.\n\n\nBio: Tainã Coleman is a Schmidt AI in Science Postdoctoral Fellow at the San Diego Supercomputer Center. Her research centers on developing solutions and tools that expand access to high-performance computing (HPC) for researchers across both the sciences and the humanities. A key focus of her work is on scientific workflows\, primarily examining how workflow structure impacts execution in HPC environments and designing algorithms\, benchmarks\, and data-driven methods to enhance efficiency and usability. More recently\, she has integrated artificial intelligence into her research\, exploring its applications across diverse domains. She earned her B.S. in Computer Engineering from Universidade Federal de Itajubá (2016)\, her M.S. in Computer Science from California State University\, Long Beach (2020)\, and her Ph.D. in Computer Science from the University of Southern California (2023).\n\nSlides: Research Without Borders_ High Performance Computing for Discovery Across Domains
URL:https://isg.ics.uci.edu/event/research-without-borders-high-performance-computing-for-discovery-across-domains/
LOCATION:DBH 3011
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251010T130000
DTEND;TZID=America/Los_Angeles:20251010T140000
DTSTAMP:20260426T083107
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
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251022T093000
DTEND;TZID=America/Los_Angeles:20251022T110000
DTSTAMP:20260426T083107
CREATED:20251017T005844Z
LAST-MODIFIED:20251017T005844Z
UID:2279-1761125400-1761130800@isg.ics.uci.edu
SUMMARY:Dr. Doug Terry: Consistency in the Cloud
DESCRIPTION:Dr. Doug Terry will give a guest lecture in CS 224P (“Big Data”) class. The talk should be very interesting to ISG members.  Doug is a fantastic speaker!\n  \nTitle: Consistency in the Cloud\nLecturer: Doug Terry\n\nOct. 22\, Wednesday\, 9:30 am – 10:50 am\nDBH 6011\, UC Irvine \nAbstract: Data is routinely replicated in the cloud for fault-tolerance\, disaster recovery\, scalable throughput\, and low-latency access. The design of a replication scheme involves fundamental trade-offs between consistency\, availability\, and performance. This lecture explores the consistency choices that are offered by cloud providers using baseball as an illustrative application. \nBio: Doug Terry recently joined LinkedIn as a Distinguished Software Engineer. Prior to that\, he led research projects at Xerox PARC\, Microsoft\, and Samsung\, and he pioneered innovative cloud services at Amazon and Microsoft. He also taught Distributed Systems at U.C. Berkeley and Stanford University.
URL:https://isg.ics.uci.edu/event/dr-doug-terry-consistency-in-the-cloud/
LOCATION:DBH 6011
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251031T130000
DTEND;TZID=America/Los_Angeles:20251031T140000
DTSTAMP:20260426T083107
CREATED:20251027T210415Z
LAST-MODIFIED:20251027T210415Z
UID:2282-1761915600-1761919200@isg.ics.uci.edu
SUMMARY:Pratyoy Das: SmartRabbit An Interactive Query Processor
DESCRIPTION:For this week’s IGS seminar\, Pratyoy will be presenting his research work.\n\nTime & Location:\n\n\nFriday Oct 31\, 2025\, 1:00 PM – 2:00 PM\nDonald Bren Hall 3011\, ICS\, UC Irvine \nLunch will be provided. \nTitle:\nSmartRabbit: An Interactive Query Processor \nAbstract: \nTraditional relational database systems optimize analytical queries to minimize their end-to-end latency. The resulting optimal plans are usually blocking\, forcing users to wait until full query completion before seeing any results. This execution model precludes interactivity\, i.e.\, users cannot observe partial results or gain early insights for long-running queries. Query optimizers rarely choose plans that promote interactivity\, since such plans either incur prohibitively large latencies or involve operators for which interactive alternatives are unavailable. We introduce a novel interactive query processor SmartRabbit that promotes interactivity of answers while matching the end-to-end latency of blocking execution plans. We achieve this by first designing a plan optimized for interactivity for a given query\, and then simultaneously executing this plan alongside a traditional blocking plan. The two executions are carefully synchronized to maintain the correct order of answers and prevent duplicates. We implement SmartRabbit in AsterixDB and show that SmartRabbit consistently delivers early and continuous results across various analytical queries\, data scales\, and parallel (multi-node\, multi-partition) system instances\, while matching the latencies of the standalone blocking executions.\n\nBio: \n\n\n\nPratyoy is a 4th year PhD student under Professor Sharad Mehrotra. His research focuses on query optimization and query execution with specific interests in adaptive\, interactive and progressive query optimization. Pratyoy had previously interned in the query optimization team of Amazon Redshift and was a Software Engineer at Microsoft before joining UC Irvine.\n\n\n\n\n\nVolunteer:\nXiaozhen Liu
URL:https://isg.ics.uci.edu/event/pratyoy-das-smartrabbit-an-interactive-query-processor/
LOCATION:DBH 3011
END:VEVENT
END:VCALENDAR