【24h】

Parallel Real Root Isolation Using the Descartes Method

机译:使用笛卡尔方法的并行实际根隔离

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

摘要

Two new scheduling algorithms are presented. They are used to isolate polynomial real roots on massively parallel systems. One algorithm schedules computations modeled by a pyramid DAG. This is a directed acyclic graph isomprphic to Pascal's triangle. Pyramid DAGs are scheduled so that the communication overhead is linear. The other algorithm schedules parallelizable independent tasks that have identical computing time functions in the number of processors. The two algorithms are combined to schedule a tree-search for polynomial roots; the first algorithm schedules the computations associated with each node of the tree; the second algorithm schedules the nodes on each level of the tree.
机译:提出了两种新的调度算法。它们用于隔离大规模并行系统上的多项式实根。一种算法调度由金字塔DAG建模的计算。这是与Pascal三角形等距的有向无环图。安排金字塔DAG,以便通信开销是线性的。另一种算法调度可并行化的独立任务,这些任务在处理器数量上具有相同的计算时间函数。将这两种算法结合在一起,可以安排多项式根的树搜索。第一种算法调度与树的每个节点相关的计算;第二种算法在树的每个级别上调度节点。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号