報告題目：Low-Complexity and Communiation-Efficient Coded Distributed Computing via Combinatorial Designs

報告時間：2023年9月15日上午10:00-11:00

報告地點：kaiyun開云官方網(wǎng)站犀浦校區(qū)7教7509

報告人：程民權

摘要：Coded distributed computing (CDC) introduced by Li et al. can greatly reduce the communication load for MapReduce computing systems. In the general cascaded CDC with K workers, N input files and Q Reduce functions, each input file will be mapped by r workers and each Reduce function will be computed by s workers such that coding techniques can be applied to create multicast opportunities. The main drawback of most existing CDC schemes is that they require the original data to be split into a large number of input files that grows exponentially with K, which would significantly increase the coding complexity and degrade the system performance. In this talk, we construct several classes of CDC schemes which perform significantly better than the known schemes.

報告人簡介：程民權，畢業(yè)于（日本）筑波大學并獲得筑波大學校長特別表彰。現(xiàn)為廣西師范大學教授、博士生導師，研究領域為：組合設計及其在分布式系統(tǒng)、信息安全與隱私、多媒體版權保護、機器學習等領域的應用。 首批廣西百人計劃，廣西杰青。目前已發(fā)表SCI學術論文45篇，其中8篇發(fā)表在信息論國際頂級期刊《IEEE Transactions on Information Theory》上，14篇發(fā)表通信領域頂級期刊《IEEE Transactions on Communications》上，6篇發(fā)表在國際密碼學報《Designs Codes And Cryptography》上。