法国Télécom ParisTech和CentraleSupélec大学闫起发博士学术报告

来源:信息科学与技术学院  作者:唐小虎  日期:2018-12-03  点击数:195

法国Télécom ParisTechCentraleSupélec大学闫起发博士学术报告

报告题目:Storage, Computation, and Communication: A Fundamental Tradeoff in Distributed Computing

报告人:法国Télécom ParisTechCentraleSupélec大学闫起发博士

报告时间:20181205 09:30

报告地点:西南交通大学犀浦校区9号楼#9428

主持人:唐小虎 教授

  

报告摘要Distributed computing has become one of the most important frameworks in dealing with large computation tasks. In this talk, we investigate a MapReduce like distributed computing system. We will characterize the optimal tradeoff between storage space, computation load, and communication load. The corner points of the optimal tradeoff surface are achieved by the modified coded distributed computing (M-CDC) scheme proposed by Ezzeldin et al, and time- and memory- sharing between these points achieves general surface.  We also derive an information-theoretical converse , which exactly matches the achievability. Our result thus extends the result by Li et al. on the optimum tradeoff between storage and communication to account also for the computation load. We further show how to obtain a distributed computing scheme from any placement delivery array (PDA) whose ordinary symbols occur at least twice. Previously proposed PDAs to solve the subpacketization problem in coded caching. allow us then to derive optimal distributed computing schemes that require only a small number of files, and thus have reduced complexity.

 

报告人简介:Qifa Yan received the B.S. degree in mathematicse and applied mathematicsfrom Shanxi University, Taiyuan, China, in 2010. He obtained the Ph.D degree in communication and information system at the School of  Information Science and Technology,Southwest Jiaotong University, Chengdu, China  in 2017. He is currently working as a joint Postdoctoral  at Télécom ParisTech and CentraleSupélec in France. His research interests includecaching networks, distributed computing, and other fields related to wireless networks,  information theory and coding theory.