Load Balancing and Visualization for 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.