• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Computational Science and Its Applications - ICCSA 2003 Pt.3 May 18-21, 2003 Montreal, Canada >Finding Coarse Grained Parallelism in Computational Geometry Algorithms
【24h】

Finding Coarse Grained Parallelism in Computational Geometry Algorithms

机译：在计算几何算法中查找粗粒度并行度

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

A technique, permitting automatic finding coarse grained parallelism in algorithms presented with arbitrary nested loops, is presented. The technique is based on finding affine space partition mappings. The main advantage of this technique is that it allows us to form constraints for finding mappings directly in a linear form while known techniques result in building non-linear constraints which should next be linearized. After finding affine space partition mappings, well-known code generation approaches can be applied to expose algorithm parallelism. It is shown how this technique can be applied for parallelizing computational geometry algorithms by means of two examples.
机译：提出了一种技术，该技术允许在具有任意嵌套循环的算法中自动查找粗糙粒度的并行度。该技术基于查找仿射空间分区映射。该技术的主要优点是，它使我们能够形成用于直接以线性形式查找映射的约束，而已知技术会导致构建非线性约束，然后应将其线性化。找到仿射空间分区映射后，可以使用众所周知的代码生成方法来公开算法并行性。通过两个示例显示了如何将该技术应用于计算几何算法的并行化。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号