• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Computers and Artificial Intelligence >AUTOMATED TRANSFORMATION OF SEQUENTIAL DIVIDE-AND-CONQUER ALGORITHMS INTO PARALLEL PROGRAMS
【24h】

AUTOMATED TRANSFORMATION OF SEQUENTIAL DIVIDE-AND-CONQUER ALGORITHMS INTO PARALLEL PROGRAMS

机译：顺序除数算法自动转换为并行程序

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

摘要

Divide-and-conquer algorithms obtain the solution to a given problem by dividing it into subproblems, solving these recursively and combining their solutions. In this paper we present a system that automatically transforms sequential divide-and-conquer algorithms written in the C programming language into parallel code which is then executed on message-passing multicomputers. The user of the system is expected to add only a few annotations to an existing sequential program. The strategies required for transforming sequential source code to executable binaries are discussed. The performance speedups attainable will be illustrated by several examples.
机译：分而治之算法通过将给定问题划分为子问题，然后递归解决这些问题并组合其解决方案，从而获得了给定问题的解决方案。在本文中，我们提出了一个系统，该系统可将用C编程语言编写的顺序分治算法自动转换为并行代码，然后在消息传递多计算机上执行该并行代码。系统的用户应仅向现有的顺序程序添加一些注释。讨论了将顺序源代码转换为可执行二进制文件所需的策略。可以通过几个示例来说明可达到的性能提升。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号