首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Algorithms for search trees on message passing architectures
【24h】

Algorithms for search trees on message passing architectures

机译:消息传递体系结构上的搜索树算法

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

摘要

In this paper we describe a new algorithm for maintaining a balanced search tree on a message-passing MIMD architecture; the algorithm is particularly well suited for implementation on a small number of processors. We introduce a (2/sup B-2/, 2/sup B/) search tree that uses a bidirectional ring of O(log n) processors to store n entries. Update operations use a bottom-up node-splitting scheme, which performs significantly better than top-down search tree algorithms. The bottom-up algorithm requires many fewer messages and results in less blocking due to synchronization than top-down algorithms. Additionally, for a given cost ratio of computation to communication the value of B may be varied to maximize performance. Implementations on a parallel-architecture simulator are described.
机译:在本文中,我们描述了一种在消息传递MIMD架构上维护平衡搜索树的新算法;该算法特别适合在少量处理器上实现。我们引入了(2 / sup B-2 /,2 / sup B /)搜索树,该树使用O(log n)处理器的双向环来存储n个条目。更新操作使用自下而上的节点拆分方案,该方案的性能明显优于自上而下的搜索树算法。与自上而下的算法相比,自下而上的算法所需的消息少得多,并且由于同步而导致的阻塞更少。另外,对于给定的计算与通信成本比,可以改变B的值以最大化性能。描述了在并行体系结构模拟器上的实现。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号