首页> 外文会议>High-performance computing and networking >A Comparison Between HPF and PVM for Data Parallel Algorithm on a Cluster of Workstations Using a High Speed Network
【24h】

A Comparison Between HPF and PVM for Data Parallel Algorithm on a Cluster of Workstations Using a High Speed Network

机译:HPF和PVM在使用高速网络的工作站集群上进行数据并行算法的比较

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

摘要

In the data parallelism model, the data is partitioned and distributed to all the machines. Operations (often similar) are performed on each set of data and information is passed between processes until the problem is solved. The data parallel algorithm we have implemented simulates the Koch neural network to estimate the optical flow with the gradient-based approach proposed by Horn and Schunk.
机译:在数据并行性模型中,数据被分区并分配给所有机器。对每组数据执行操作(通常是类似的操作),并且信息在流程之间传递,直到问题解决。我们已经实现的数据并行算法使用Horn和Schunk提出的基于梯度的方法来模拟Koch神经网络以估计光流。

著录项

  • 来源
  • 会议地点 Milan(IT);Milan(IT)
  • 作者单位

    Istituto Elaborazionc Segnali ed Immagini C.N.R. Bari - Italy;

    Istituto Elaborazionc Segnali ed Immagini C.N.R. Bari - Italy;

    Istituto Elaborazionc Segnali ed Immagini C.N.R. Bari - Italy;

  • 会议组织
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 TQ4;
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号