BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20190331T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20181028T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260405T190240Z
UID:5b9645624b3c2811754419@ist.ac.at
DTSTART:20181127T153000
DTEND:20181127T163000
DESCRIPTION:Speaker: Naama Ben-David\nhosted by Dan Alistarh\nAbstract: The
  shared-memory and message-passing models have traditionally been studied 
 separately in the distributed computing community. However\, recent trends
  in hardware have led to machines that may use both shared memory and mess
 age-passing primitives. Motivated by these trends\, we consider a hybrid m
 essage-and-memory model that allows programs to both share memory and pass
  messages.We show that the message-and-memory model can leverage the share
 d memory to become more powerful than the message-passing model in isolati
 on.In this talk\, I will exemplify the power of a message-and-memory netwo
 rk by considering the classic consensus problem. I will show that such a n
 etwork can tolerate more failures when solving consensus than a purely mes
 sage-passing one. This is true even when limiting shared memory communicat
 ion to be only between neighbors in a shared memory graph\, rather than be
 tween every pair of processes. In particular\, I will show that graphs wit
 h good expansion properties provide a good trade-off between scalability a
 nd fault-tolerance in this context\, and prove upper and lower bounds on t
 he fault-tolerance of a message-and-memory network.If time permits\, I wil
 l also discuss how messages and memory together can be used to implement a
  leader election algorithm that is more robust to network asynchrony than 
 previous algorithms.Based on joint work with Marcos Aguilera\, Irina Calci
 u\, Rachid Guerraoui\, Erez Petrank\, and Sam Toueg.
LOCATION:Meeting room 2nd floor / Central Bldg. (I01.2OG.)\, ISTA
ORGANIZER:gavni@ist.ac.at
SUMMARY:Naama Ben-David: Passing Messages while Sharing Memory
URL:https://talks-calendar.ista.ac.at/events/1622
END:VEVENT
END:VCALENDAR