BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
X-LIC-LOCATION:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20220715T000421Z
LOCATION:3005\, Level 3
DTSTART;TZID=America/Los_Angeles:20220714T171000
DTEND;TZID=America/Los_Angeles:20220714T173000
UID:dac_DAC 2022_sess129_RESEARCH348@linklings.com
SUMMARY:PATH: Evaluation of Boolean Logic using Path-based In-Memory Compu
 ting
DESCRIPTION:Research Manuscript\n\nPATH: Evaluation of Boolean Logic using
  Path-based In-Memory Computing\n\nThijssen, Jha, Ewetz\n\nProcessing in-m
 emory breaks von-Neumann based constructs to accelerate data-intensive app
 lications. Noteworthy efforts have been devoted to executing  Boolean logi
 c using digital in-memory computing. The limitation of state-of-the-art pa
 radigms is that they heavily rely on repeatedly switching the state of the
  non-volatile resistive devices using expensive WRITE operations. In this 
 paper, we propose a new in-memory computing paradigm called path-based com
 puting for evaluating Boolean logic. Computation within the paradigm is pe
 rformed using a one-time expensive compile phase and a fast and efficient 
 evaluation phase. The key property of the paradigm is that the execution p
 hase only involves cheap READ operations.\n\nTopic: Design\n\nKeyword: Eme
 rging Models of Computation
END:VEVENT
END:VCALENDAR