...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Computer physics communications >Parallelization issues of a code for physically-based simulation of fabrics
【24h】

Parallelization issues of a code for physically-based simulation of fabrics

机译：织物基于物理仿真的代码的并行化问题

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

摘要

The simulation of fabrics, clothes, and flexible materials is an essential topic in computer animation of realistic virtual humans and dynamic sceneries. New emerging technologies, as interactive digital TV and multimedia products, make necessary the development of powerful tools to perform real-time simulations. Parallelism is one of such tools. When analyzing computationally fabric simulations we found these codes belonging to the complex class of irregular applications. Frequently this kind of codes includes reduction operations in their core, so that an important fraction of the computational time is spent on such operations. In fabric simulators these operations appear when evaluating forces, giving rise to the equation system to be solved. For this reason, this paper discusses only this phase of the simulation. This paper analyzes and evaluates different irregular reduction parallelization techniques on ccNUMA shared memory machines, applied to a real, physically-based, fabric simulator we have developed. Several issues are taken into account in order to achieve high code performance, as exploitation of data access locality and parallelism, as well as careful use of memory resources (memory overhead). In this paper we use the concept of data affinity to develop various efficient algorithms for reduction parallelization exploiting data locality. (C) 2004 Elsevier B.V. All rights reserved.
机译：织物，衣服和柔性材料的模拟是逼真的虚拟人物和动态场景的计算机动画中的重要主题。作为交互式数字电视和多媒体产品的新兴技术，使得有必要开发功能强大的工具来执行实时仿真。并行性就是这样的工具之一。在分析计算结构模拟时，我们发现这些代码属于不规则应用程序的复杂类。通常，这类代码在其核心中包含归约运算，因此，很大一部分计算时间都花在了此类运算上。在织物模拟器中，这些操作在评估力时出现，从而产生了要求解的方程组。因此，本文仅讨论仿真的这一阶段。本文分析并评估了ccNUMA共享存储计算机上不同的不规则归约并行化技术，并将其应用于我们开发的基于物理的真实织物模拟器。为了实现高代码性能，需要考虑几个问题，例如要利用数据访问位置和并行性，以及谨慎使用内存资源（内存开销）。在本文中，我们使用数据亲和力的概念来开发各种有效的算法，以利用数据局部性来减少并行化。 （C）2004 Elsevier B.V.保留所有权利。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号