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:20230312T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20231105T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20231006T130000
DTEND;TZID=America/Los_Angeles:20231006T140000
DTSTAMP:20260526T013917
CREATED:20231004T193718Z
LAST-MODIFIED:20231004T193757Z
UID:1631-1696597200-1696600800@isg.ics.uci.edu
SUMMARY:Glenn Galvizo: Removing the 'A' in DAG: Navigational Queries in Hyracks
DESCRIPTION:Abstract \n\n\nThe need to “view” existing data under different models (e.g. JSON to graph) is a requirement seen in many modern applications. A naive solution involves utilizing narrow-purposed systems to handle each model\, however\, this multi-DBMS architecture significantly increases the cost of owning one’s data. For Apache AsterixDB users\, we offer Graphix as a way to issue synergistic document-graph queries on their existing Big Data\, in-situ (i.e. in partition-parallel).\n\nIn this talk\, we’ll be walking through how we modified Hyracks\, the runtime platform for AsterixDB\, to execute a recursive Graphix query. We’ll first talk about how tuple-pipelineable recursion occurs in a non-distributed setting. We will then extend our discussion for the distributed setting\, and conclude with optimizations we take to handle dense graphs.\n\n\n\nBio \nGlenn Justo Galvizo is a 5th-year Ph.D. candidate in the Computer Science Department at UC Irvine. He received his M.S. in CS at UC Irvine\, and his B.S. in CS at the University of Hawaii\, Manoa. His research interests include query languages\, graph data management\, and data modelling.
URL:https://isg.ics.uci.edu/event/removing-the-a-in-dag-navigational-queries-in-hyracks/
LOCATION:DBH 4011
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20231013T130000
DTEND;TZID=America/Los_Angeles:20231013T170000
DTSTAMP:20260526T013917
CREATED:20231007T181612Z
LAST-MODIFIED:20231007T181612Z
UID:1637-1697202000-1697216400@isg.ics.uci.edu
SUMMARY:Suyash Gupta(UC Berkeley): Dissecting BFT Consensus: In Trusted Components we Trust!
DESCRIPTION:The Information Systems Group (ISG) at UC Irvine welcomes \nSuyash Gupta \nUC Berkeley  \n\nDissecting BFT Consensus: In Trusted Components we Trust! \n  \nABSTRACT \nThe growing interest in reliable multi-party applications has fostered widespread adoption of Byzantine Fault-Tolerant (bft) consensus protocols. Existing bft protocols need f more replicas than Paxos-style protocols to prevent equivocation attacks. trust-bft protocols seek to minimize this cost by making use of trusted components at replicas. This paper makes two contributions. First\, we analyze the design of existing trust-bft protocols and uncover three fundamental limitations that preclude most practical deployments. Some of these limitations are fundamental\, while others are linked to the state of trusted components today. Second\, we introduce a novel suite of consensus protocols\, FlexiTrust\, that attempts to sidestep these issues. We show that our FlexiTrust protocols achieve up to 185% more throughput than their trust-bft counterparts. \nBIO \nSuyash Gupta is a postdoctoral researcher at the SkyLab\, University of California\, Berkeley. He is also the Lead Architect of ResilientDB fabric. Prior to joining Berkeley\, he received his Ph.D. degree from University of California\, Davis. He also holds two Master of Science degrees; one from Purdue University and another from Indian Institute of Technology Madras. His current research focuses on attaining safe and efficient\, fault tolerant distributed consensus and communication. He has also co-authored a book on fault-tolerant distributed transaction processing at Morgan & Claypool. He has been awarded the Best Graduate Researcher Award for 2021 by UC Davis and Best Paper Award at EuroSys’23. In his free time\, Suyash likes to code and his team won Best Hacker Award at BostonHacks\, HackIllinois\, and HackPrinceton\, among others.
URL:https://isg.ics.uci.edu/event/suyash-guptauc-berkeley-dissecting-bft-consensus-in-trusted-components-we-trust/
LOCATION:DBH 4011
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20231020T110000
DTEND;TZID=America/Los_Angeles:20231020T120000
DTSTAMP:20260526T013917
CREATED:20231016T182746Z
LAST-MODIFIED:20231016T182746Z
UID:1640-1697799600-1697803200@isg.ics.uci.edu
SUMMARY:Boon Thau Loo(UPenn): Towards Full-Stack Adaptivity in Permissioned Blockchain Systems
DESCRIPTION:  \nThe Computer Science Department and Information Systems Group (ISG) \nat UC Irvine welcomes \n\n \nBoon Thau Loo \nUniversity of Pennsylvania \n\nTowards Full-Stack Adaptivity in Permissioned Blockchain Systems \nOctober 20\, 2023 at 11:00AM \nDBH 6011 \n  \nABSTRACT \nPermissioned blockchain systems are an emerging instance of untrustworthy distributed databases. As novel smart contracts\, modern hardware\, and new cloud platforms arise\, future-proof permissioned blockchain systems need to be designed with full-stack adaptivity in mind.  At the application level\, a future-proof system must adaptively learn the best transaction processing paradigm in order to maximize performance for dynamic workloads\, and quickly adapt to new hardware as well as unanticipated workload changes on-the-fly. Likewise\, the Byzantine consensus layer must dynamically adjust itself to the workloads\, faulty conditions\, and network configuration while maintaining compatibility with the transaction processing paradigm. At the infrastructure level\, cloud providers must enable cross-layer adaptation\, which identifies performance bottlenecks and possible attacks\, and determines at runtime the degree of resource disaggregation that best meets application requirements. \n  \nThis talk presents four preliminary building blocks towards our vision of full-stack adaptivity: (1) FlexChain\, a novel permissioned blockchain system that physically disaggregating CPUs\, DRAM\, and storage devices to process different blockchain workloads efficiently; (2) AdaChain\, a learning-based framework that adaptively chooses the best permissioned blockchain architecture to optimize effective throughput for dynamic transaction workloads; (3) Bedrock\, a unified platform for Byzantine consensus protocol analysis\, implementation\, and experimentation; and (4) DeCon\, a declarative programming language for implementing\, optimizing\, and verifying smart contracts deployed on Blockchain systems. We conclude the talk with our ongoing work towards the goal of full-stack adaptivity across transaction processing\, consensus protocols\, and hardware infrastructure layers.  \nBIO \nBoon Thau Loo is the RCA Professor in the Computer and Information Science (CIS) department at the University of Pennsylvania. He is also the Associate Dean for Graduate Programs\, where he oversees all academic and admissions operations for doctoral\, master’s and professional programs at the School of Engineering and Applied Science. He received his Ph.D. degree in Computer Science from the University of California at Berkeley in 2006. Prior to his Ph.D.\, he received his M.S. degree from Stanford University in 2000\, and his B.S. degree with highest honors from University of California-Berkeley in 1999. His research focuses on distributed data management systems\, Internet-scale query processing\, and the application of data-centric techniques and formal methods to the design\, analysis and implementation of networked systems.  He leads the NetDB@Penn research team\, and is also the director of the Distributed Systems Laboratory (DSL)\, an inter-disciplinary systems research lab bringing together researchers in networking\, distributed systems\, and security.  \nLoo is the recipient of the David J. Sakrison Memorial Prize (2006) for the most outstanding dissertation research in the Department of EECS at University of California-Berkeley\, the ACM SIGMOD Dissertation Award (2007)\, NSF CAREER award (2009)\, the Air Force Office of Scientific Research (AFOSR) Young Investigator Award (2012)\, Penn’s Emerging Inventor of the year award (2018)\, the Ruth and Joel Spira award for Excellence in Teaching (2021)\, and the University Lindback award for distinguished teaching (2022). He has published 160+ peer reviewed publications and has graduated sixteen Ph.D. students and three postdocs\, including three tenured professors\, four current tenure-track professors\, and winners of five dissertation awards. As an entrepreneur\, he co-founded two companies: Netsil\, a cloud microservices analytics company acquired by public cloud company Nutanix Inc.\, and Termaxia\, an energy-efficient big data storage company acquired by Frontiir.  
URL:https://isg.ics.uci.edu/event/boon-thau-looupenn-towards-full-stack-adaptivity-in-permissioned-blockchain-systems/
LOCATION:DBH 6011
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20231027T110000
DTEND;TZID=America/Los_Angeles:20231027T120000
DTSTAMP:20260526T013917
CREATED:20231016T183414Z
LAST-MODIFIED:20231016T183414Z
UID:1643-1698404400-1698408000@isg.ics.uci.edu
SUMMARY:Ken Birman (Cornell): Cascade:  A Platform for Fast Edge Intelligence
DESCRIPTION:The Computer Science Department and Information Systems Group (ISG) \nat UC Irvine welcomes \n \nKen Birman \nCornell University \nCascade:  A Platform for Fast Edge Intelligence \nOctober 27\, 2023 at 11:00AM \nDBH 6011 \n  \nABSTRACT \nThere is a growing need to apply machine intelligence and learning at the edge of the cloud.  Doing so would reduce delays for interactive LLM queries\, enable expanded use of assistive technology for drivers\, and let us bring AI into settings like factories and hospitals.  However\, the cloud was designed mostly to support scalable web applications\, and many of those design choices are mismatched relative to the needs of edge intelligence applications.   Our new system\, Cascade\, overcomes these issues.  Cascade enables a fast reactive edge in which AIs always see consistent\, current data.  The work centers on a rethinking of the lowest levels of modern computing frameworks and entails eliminating copying\, locking\, and synchronous distributed interactions.  This leads to an asynchronous flow model that yields dramatic reductions in delay\, improved throughput\, and even saves power.     \nBIO \nKen has worked in distributed systems since getting his PhD at UC Berkeley in 1991.  He is currently the N. Rama Rao Professor in the Department of Computer Science at Cornell.  Past projects including building the infrastructure that operated the New York and Swiss Stock Exchanges\, developing the core architecture and software for the French Air Traffic Control System\, and inventing some of the techniques that enabled today’s scalable\, self-managed\, cloud computing settings.  Ken is a fellow of the ACM and IEEE\, and won the IEEE Kanai Award for his research in distributed systems.  
URL:https://isg.ics.uci.edu/event/ken-birman-cornell-cascade-a-platform-for-fast-edge-intelligence/
LOCATION:DBH 6011
END:VEVENT
END:VCALENDAR