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:20200308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20201101T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200417T123000
DTEND;TZID=America/Los_Angeles:20200417T140000
DTSTAMP:20261108T020434
CREATED:20191118T211239Z
LAST-MODIFIED:20200117T182717Z
UID:1228-1587126600-1587132000@isg.ics.uci.edu
SUMMARY:David Lomet: Better Database Cost/Performance via Programmable SSD Batched I/O
DESCRIPTION:Abstract: A database storage manager should place data at the most cost/performance-effective tier in the storage hierarchy.  While performance and cost both decrease with distance from the CPU\, the cost/performance trade-off depends on how efficiently a storage manager can move data across tiers.  Log structuring (LS) is designed to improve the cost/performance of secondary storage by writing batches of pages from main memory to secondary storage when using a conventional block-at-a-time I/O interface.  The advent of programmable SSDs changes the game.  A storage manager no longer has to work within the limitations of the block-at-a-time interface.  In this paper\, we re-program an SSD controller’s flash translation layer into one that enables a storage manager to batch pages without itself needing to implement LS.  This removes the CPU computational and I/O load associated with LS recovery and garbage collection.  We compare the Bw-tree key-value store with its LLAMA host-based LS to the same key-value software stack but executing on our batch-interface SSD.  Our experimental results show the benefits of eliminating redundancies\, minimizing interactions across storage layers\, and avoiding the CPU cost of providing LS. \nShort Bio: \nDavid Lomet founded the Database Group at Microsoft Research Redmond in 1995 and managed it for 20 years. His research career began at IBM where\, while on a 1975-76 sabbatical at the University of Newcastle-on-Tyne\, he invented atomic actions (a form of transactions).  He later worked at Wang Institute as a faculty member\, and at Digital Equipment Corporation as a software architect and research staff member. He received a Ph.D. in computer science from the University of Pennsylvania. \nLomet’s primary focus has been the engineering of database systems\, with a focus on database system kernels.  His work on concurrency control and recovery contributed to making DEC’s Rdb and Microsoft’s SQL Server database management systems leaders in cost/performance. His Deuteronomy research project’s latch-free Bw-tree index and log structure store are key elements in Microsoft’s Hekaton main memory database and Azure Cosmos DB cloud data service.  Deuteronomy won the Microsoft Research Redmond “2017 Best Research Project” Award.  Lomet is an author of over 120 papers and over 60 patents. \nLomet has won IEEE awards as well as the ACM SIGMOD Contributions Award and the Computer Society TCDE Service Award  for his 25 year tenure as EIC of the IEEE Data Engineering Bulletin.  HE has also served as editor of ACM TODS\, VLDB Journal and others\, and has been a member of the VLDB Board.  He has been a PC co-chair for ICDE and VLDB.  He is a member of the IEEE Computer Society Board of Governors and society Secretary\, and has been First Vice President and Treasurer.  He is a fellow of IEEE\, ACM\, and AAAS\, and a member of the National Academy of Engineering. \n  \nLunch provided.
URL:https://isg.ics.uci.edu/event/david-lomet-tbd/
LOCATION:DBH 3011
END:VEVENT
END:VCALENDAR