首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Noncontiguous processor allocation algorithms for mesh-connected multicomputers
【24h】

Noncontiguous processor allocation algorithms for mesh-connected multicomputers

机译:网格连接多计算机的不连续处理器分配算法

获取原文
获取原文并翻译 | 示例

摘要

Current processor allocation techniques for highly parallel systems are typically restricted to contiguous allocation strategies for which performance suffers significantly due to the inherent problem of fragmentation. As a result, message-passing systems have yet to achieve the high utilization levels exhibited by traditional vector supercomputers. We are investigating processor allocation algorithms which lift the restriction on contiguity of processors in order to address the problem of fragmentation. Three noncontiguous processor allocation strategies-paging allocation, random allocation, and the Multiple Buddy Strategy (MBS)-are proposed and studied in this paper. Simulations compare the performance of the noncontiguous strategies with that of several well-known contiguous algorithms. We show that noncontiguous allocation algorithms perform better overall than the contiguous ones, even when message-passing contention is considered. We also present the results of experiments on an Intel Paragon XP/S-15 with 208 nodes that show noncontiguous allocation is feasible with current technologies.
机译:当前用于高度并行系统的处理器分配技术通常限于连续分配策略,由于碎片的固有问题,其性能会受到严重影响。结果,消息传递系统尚未达到传统矢量超级计算机所展现的高利用率。我们正在研究处理器分配算法,该算法解除了对处理器连续性的限制,以解决碎片问题。提出并研究了三种不连续的处理器分配策略:分页分配,随机分配和多伙伴策略(MBS)。仿真将非连续策略的性能与几种众所周知的连续算法的性能进行了比较。我们表明,即使考虑消息传递争用,非连续分配算法的整体性能也比连续算法更好。我们还介绍了在具有208个节点的Intel Paragon XP / S-15上的实验结果,这些结果表明使用当前技术进行非连续分配是可行的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号