BEGIN:VCALENDAR
VERSION:2.0
PRODID:IEEE vTools.Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:Israel
BEGIN:DAYLIGHT
DTSTART:20210326T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
RRULE:FREQ=YEARLY;BYDAY=-1FR;BYMONTH=3
TZNAME:IDT
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20201025T010000
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:IST
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20211002T084101Z
UID:C9B0418C-C871-460B-9E09-159CE2686368
DTSTART;TZID=Israel:20210217T113000
DTEND;TZID=Israel:20210217T123000
DESCRIPTION:A concurrency semantics (aka a memory model) for a programming 
 language defines the allowed behaviors of multithreaded programs. For prog
 rammers\, sequential consistency (i.e.\, standard interleaving-based seman
 tics) is considered as the most intuitive model. However\, it is too costl
 y to implement. Designing a satisfactory substitute is highly challenging 
 as it requires to carefully balance the conflicting desires of programmers
 \, compilers\, and hardware. In this talk I will introduce this challenge 
 and the key ideas behind the prototype example of the C/C++ concurrency mo
 del from 2011. Then\, I will demonstrate the drawback of the C/C++ approac
 h\, notoriously known as the “out-of-thin-air” problem. I will conclud
 e by describing the “promising semantics” solution\, and remaining cha
 llenges.\n\nWe study basic demand-aware problems in offchain network desig
 n: Efficiently mapping users to an offchain topology of a known structure 
 as well as constructing a topology of a bounded number of channels that ca
 n serve well typical payments. Likewise\, we suggest an approach for joint
 ly serving multiple payments by finding an equivalent set of payments that
  has the same impact on user balance but can be served efficiently in a gi
 ven topology.\n\nSpeaker(s): Dr. Ori Lahav\, \n\nVirtual: https://events.v
 tools.ieee.org/m/283121
LOCATION:Virtual: https://events.vtools.ieee.org/m/283121
ORGANIZER:idabran@cs.technion.ac.il
SEQUENCE:1
SUMMARY:CE Club Seminar - Designing a Programming Language Shared-Memory Co
 ncurrency Semantics
URL;VALUE=URI:https://events.vtools.ieee.org/m/283121
X-ALT-DESC:Description: <br /><p>A concurrency semantics (aka a memory mode
 l) for a programming language defines the allowed behaviors of multithread
 ed programs. For programmers\, sequential consistency (i.e.\, standard int
 erleaving-based semantics) is considered as the most intuitive model. Howe
 ver\, it&nbsp\;is too costly to implement. Designing a satisfactory substi
 tute is highly challenging as it requires to carefully balance the conflic
 ting desires of programmers\, compilers\, and hardware. In this talk I wil
 l introduce this challenge and the key ideas behind the prototype example 
 of the C/C++ concurrency model from 2011. Then\, I will demonstrate the dr
 awback of the C/C++ approach\, notoriously known as&nbsp\;the &ldquo\;out-
 of-thin-air&rdquo\; problem. I will conclude by describing the &ldquo\;pro
 mising semantics&rdquo\; solution\, and remaining&nbsp\;challenges.</p>\n<
 p>We study basic demand-aware problems in offchain network design: Efficie
 ntly mapping users to an offchain topology of a known structure as well as
  constructing a topology of a bounded number of channels that can serve we
 ll typical payments. Likewise\, we suggest an approach for jointly serving
  multiple payments by finding an equivalent set of payments that has the s
 ame impact on user balance but can be served efficiently in a given topolo
 gy.</p>
END:VEVENT
END:VCALENDAR