BEGIN:VCALENDAR VERSION:2.0 PRODID:IEEE vTools.Events//EN CALSCALE:GREGORIAN BEGIN:VTIMEZONE TZID:America/Chicago BEGIN:DAYLIGHT DTSTART:20190310T030000 TZOFFSETFROM:-0600 TZOFFSETTO:-0500 RRULE:FREQ=YEARLY;BYDAY=2SU;BYMONTH=3 TZNAME:CDT END:DAYLIGHT BEGIN:STANDARD DTSTART:20191103T010000 TZOFFSETFROM:-0500 TZOFFSETTO:-0600 RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=11 TZNAME:CST END:STANDARD END:VTIMEZONE BEGIN:VEVENT DTSTAMP:20190703T161013Z UID:E5FC4795-3238-4405-8CF5-F4E6D851CFDF DTSTART;TZID=America/Chicago:20190628T103000 DTEND;TZID=America/Chicago:20190628T113000 DESCRIPTION:Emerging Technology Speaker Series - Motorola Mobility LLC\n\n1 0.30 am-11.30 am\, Friday June 28\, 2019\n\nChicago Theater\, 19th Floor ( Must register online to obtain a visitor's pass to reach the floor.)\n\nTi tle: Codes for distributed computing\n\nProf. Daniela Tuninetti\, Ph.D.\n\ nNICEST Lab\n\nUniversity of Illinois Chicago\; danielat@uic.edu\n\nSessio n Highlights:\n\nSince Shannon’s landmark paper\, codes have been succes sfully employed at the physical layer of communications systems to detect or correct errors introduced by various channel impairments\, such as rand om noise. In modern large-scale computing systems\, the main problem is ho wever not “noise” but the “distributed nature” of the data availab ility or of data processors. If “lack” of data at a node in a computin g system is thought of as an “erasure\,” then codes can come to the re scue. Erasure and network codes are expected to become critical components in distributed storage systems\, in distributed computation systems\, and in cache-aided systems. In those examples\, codes effectively mitigate th e effect of strugglers or reduce the communication loads in the data shuff ling phase of distributed machine learning algorithms. They do so by caref ully leveraging local storage capabilities/redundancy to create multicast opportunities in the communication data exchange phase (i.e.\, multicast m eans that the same transmission benefits simultaneously many workers). Thi s talk will focus on the use of codes for speeding up computations in larg e distributed computing systems\, and discuss interesting tradeoffs betwee n distributed storage/cache space and download/delivery time.\n\nAbout the speaker:\n\nDr. Daniela Tuninetti is currently a Professor within the Dep artment of Electrical and Computer Engineering at the University of Illino is at Chicago (UIC)\, which she joined in 2005. Dr. Tuninetti got her Ph.D . in Electrical Engineering in 2002 from ENST/Telecom ParisTech (Paris\, F rance\, with work done at the Eurecom Institute in Sophia Antipolis\, Fran ce)\, and she was a postdoctoral research associate at the School of Commu nication and Computer Science at the Swiss Federal Institute of Technology in Lausanne (EPFL\, Lausanne\, Switzerland) from 2002 to2004. Dr. Tuninet ti is a recipient of a best paper award at the European Wireless Conferenc e in 2002\, of an NSF CAREER award in 2007\, and named UIC University Scho lar in 2015. Dr. Tuninetti was the editor-in-chief of the IEEE Information Theory Society Newsletter from 2006 to 2008\, an editor for IEEE COMMUNIC ATION LETTERS from 2006 to 2009\, for IEEE TRANSACTIONS ON WIRELESS COMMUN ICATIONS from 2011 to 2014\; and for IEEE TRANSACTIONS ON INFORMATION THEO RY from 2014 to 2017. Dr. Tuninetti’s research interests are in the ulti mate performance limits of wireless interference networks (with special em phasis on cognition and user cooperation)\, coexistence between radar and communication systems\, and multi- relay networks. Recently\, she has work ed on content-type coding\, cache-aided systems and distributed coded comp uting.\n\nChicago\, Illinois\, United States LOCATION:Chicago\, Illinois\, United States ORGANIZER:dguo@northwestern.edu SEQUENCE:9 SUMMARY:Daniela Tuninetti to talk about codes for distributed computing at Motorola Mobility URL;VALUE=URI:https://events.vtools.ieee.org/m/200502 X-ALT-DESC:Description: <br /><p>Emerging Technology Speaker Series - Motor ola Mobility LLC</p>\n<p>10.30 am-11.30 am\, Friday June 28\, 2019</p>\n<p >Chicago Theater\, 19th Floor (Must register online to obtain a visitor's pass to reach the floor.)</p>\n<p>Title: Codes for distributed computing</ p>\n<p>Prof. &nbsp\;Daniela Tuninetti\, Ph.D.</p>\n<p>NICEST Lab</p>\n<p>U niversity of Illinois Chicago\; danielat@uic.edu</p>\n<p>Session Highlight s:</p>\n<p>Since Shannon&rsquo\;s landmark paper\, codes have been success fully employed at the physical layer of communications systems to detect o r correct errors introduced by various channel impairments\, such as rando m noise. In modern large-scale computing systems\, the main problem is how ever not &ldquo\;noise&rdquo\; but the &ldquo\;distributed nature&rdquo\; of the data availability or of data processors. If &ldquo\;lack&rdquo\; of data at a node in a computing system is thought of as an &ldquo\;erasure\ ,&rdquo\; then codes can come to the rescue. Erasure and network codes are expected to become critical components in distributed storage systems\, i n distributed computation systems\, and in cache-aided systems. In those e xamples\, codes effectively mitigate the effect of strugglers or reduce th e communication loads in the data shuffling phase of distributed machine l earning algorithms. They do so by carefully leveraging local storage capab ilities/redundancy to create multicast opportunities in the communication data exchange phase (i.e.\, multicast means that the same transmission ben efits simultaneously many workers). This talk will focus on the use of cod es for speeding up computations in large distributed computing systems\, a nd discuss interesting tradeoffs between distributed storage/cache space a nd download/delivery time.</p>\n<p>About the speaker:</p>\n<p>Dr. Daniela Tuninetti is currently a Professor within the Department of Electrical and Computer Engineering at the University of Illinois at Chicago (UIC)\, whi ch she joined in 2005. Dr. Tuninetti got her Ph.D. in Electrical Engineeri ng in 2002 from ENST/Telecom ParisTech (Paris\, France\, with work done at the Eurecom Institute in Sophia Antipolis\, France)\, and she was a postd octoral research associate at the School of Communication and Computer Sci ence at the Swiss Federal Institute of Technology in Lausanne (EPFL\, Laus anne\, Switzerland) from 2002 to2004. &nbsp\;Dr. Tuninetti is a recipient of a best paper award at the European Wireless Conference in 2002\, of an NSF CAREER award in 2007\, and named UIC University Scholar in 2015. &nbsp \;Dr. Tuninetti was the editor-in-chief of the IEEE Information Theory Soc iety Newsletter from 2006 to 2008\, an editor for IEEE COMMUNICATION LETTE RS from 2006 to 2009\, for IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS fr om 2011 to 2014\; and for IEEE TRANSACTIONS ON INFORMATION THEORY from 201 4 to 2017. &nbsp\;Dr. Tuninetti&rsquo\;s research interests are in the ult imate performance limits of wireless interference networks (with special e mphasis on cognition and user cooperation)\, coexistence between radar and communication systems\, and multi- relay networks. Recently\, she has wor ked on content-type coding\,&nbsp\;cache-aided systems and distributed cod ed computing.</p> END:VEVENT END:VCALENDAR