BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CECS - ECPv6.18.4//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CECS
X-ORIGINAL-URL:https://www.cecs.uci.edu
X-WR-CALDESC:Events for CECS
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:20170312T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20171105T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20180311T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20181104T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20190310T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20191103T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20181016T150000
DTEND;TZID=America/Los_Angeles:20181016T160000
DTSTAMP:20231011T190904Z
CREATED:20231011T190859Z
LAST-MODIFIED:20231011T190904Z
UID:14566-1539702000-1539705600@www.cecs.uci.edu
SUMMARY:An Initial Study of Simple Approaches To Eliminating Out-of-Thin-Air Results
DESCRIPTION:Name: Peizhao Ou\nChair: Prof. Brian Demsky \nDate: Tuesday October 16\, 2018 \nTime: 10am – 12pm \nLocation: CALIT2 Room 3008 \nTitle: An Initial Study of Simple Approaches To Eliminating Out-of-Thin-Air Results \nAbstract:\nEliminating so-called “out-of-thin-air” (OOTA) results is an open problem in many existing programming language memory models including Java\, C\, and C++.  OOTA behaviors are problematic in that they break both formal and informal modular reasoning about program behavior. In spite of many years of research\nefforts\, defining memory model semantics that are easily understood\, allow existing optimizations\, and forbid OOTA results remains an open problem. This thesis explores two simple solutions to this problem that forbid OOTA results. The first solution is targeted towards Java-like languages in which all memory operations may create OOTA executions\, and the second solution is targeted towards C/C++-like memory models in which racing operations are explicitly labeled as atomic operations. Our solutions provide a per-candidate execution criterion that makes it possible to examine a single execution and determine whether the memory model permits the execution. We implemented and evaluated both solutions in the LLVM compiler framework. Our results show that on an ARMv8 processor the first solution has an average overhead of 3.1% and a maximum overhead of 17.6% on the SPEC CPU2006 C/C++ benchmarks\, and that the second solution has no overhead on average and a maximum overhead of 6.3% on 43 concurrent data structures.  The results indicate that these simple approaches to eliminating out-of-thin-air behaviors deserve further consideration.
URL:https://www.cecs.uci.edu/event/an-initial-study-of-simple-approaches-to-eliminating-out-of-thin-air-results/
CATEGORIES:PhD Defenses
END:VEVENT
END:VCALENDAR