Optimization problems in graphs for message dissemination

消息传播图中的优化问题

• 批准号: 227738-2010
• 负责人: Harutyunyan, Hovhannes
• 金额: $ 1.46万
• 依托单位: Concordia University
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2012
• 资助国家: 加拿大
• 起止时间: 2012-01-01 至 2013-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=508047
• 关键词: Optimization; problems; graphs; message; dissemination

The proposed research program will investigate optimal or near optimal message dissemination problems in computer systems for parallel and distributed computing. Different parallel and distributed primitives such as routing, broadcasting, multicasting and gossiping will be considered. Various information dissemination models are considered by placing constraints on the amount of information available for each processor, number of senders and receivers, length of the message, transmission or processing delay, the number of faulty links, the number of messages, etc. These primitives, especially broadcasting and multicasting, play an important role in parallel processes, in data migration, in cache coherence and in data sharing in communication networks.

提出的研究计划将调查并行和分布式计算计算机系统中最优或接近最优的消息传播问题。将考虑不同的并行和分布式原语，如路由、广播、多播和八卦。通过对每个处理器可用的信息量、发送者和接收者的数量、消息的长度、传输或处理延迟、错误链接的数量、消息的数量等施加约束，考虑了各种信息传播模型。这些原语，特别是广播和多播，在并行进程、数据迁移、缓存一致性和通信网络中的数据共享中发挥着重要作用。