Load Balancing and Visualization for Parallel Processors

并行处理器的负载平衡和可视化

• 批准号: 8818574
• 负责人: Mark Franklin
• 金额: $ 10.54万
• 依托单位: Washington University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1989
• 资助国家: 美国
• 起止时间: 1989-06-01 至 1990-11-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=8818574&HistoricalAwards=false
• 关键词: Load; Balancing; Visualization; Parallel; Processors

With the increasing availability of parallel computing systems, the problems associated with constructing parallel algorithms, mapping them onto parallel architectures, and determining algorithm and system performance have grown in importance. The results of poor mappings are inefficient computation and system performance, and an overall reduction in the speedups potentially obtainable from a given parallel processor. The proposed research is aimed at examining approaches to allocating tasks to processors in a manner that ensures effective use of the available resources (i.e., high processor utilization with minimal delays due to interprocessor communications). A number of task allocation (load balancing) algorithms are proposed. One is based on utilizing a new parallel simulated annealing algorithm, while a third is a hybrid of the former two approaches. Contrasting these algorithms with each other, and with other algorithms proposed in the literature is a key part of the proposed research.

随着并行计算系统的可用性越来越多，与并行算法相关的问题，将其映射到并行体系结构上，并确定算法和系统性能的重要性已越来越重要。 映射不良的结果是效率低下的计算和系统性能，并且可以从给定的并行处理器中获得的加速度总体降低。 拟议的研究旨在以确保有效利用可用资源的方式（即高处理器利用率具有最小的延迟，由于处理器通信，将任务分配给处理器的方法）。 提出了许多任务分配（负载平衡）算法。 一个基于利用新的平行模拟退火算法，而三分之一是前两种方法的混合体。 将这些算法与文献中提出的其他算法进行对比是拟议研究的关键部分。