【24h】

Adaptive Support of Range Queries via Push-Pull Algorithms

机译:通过推挽算法对范围查询的自适应支持

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

摘要

In many real time interactive simulations the problem of interest management is that of filtering updates through application-specified range queries. This 'associative 'form of memory access is often implemented more simply as a reference memory access pattern by discretising the n-Dimensional space in to 'cells'. Range queries then being mapped on to this discretised form. In this paper we leverage previous work on optimising communication in reference memory access systems to provide the same optimisation to associative memory access systems. We define possible semantics of range queries and present three designs along with an analysis of the problem in various applications domains and a discussion of the viability of our designs for each problem domain.
机译:在许多实时交互式仿真中,兴趣管理的问题是通过应用程序指定的范围查询过滤更新。通过将n维空间离散化为“单元”,这种“关联”形式的存储器访问通常可以更简单地实现为参考存储器访问模式。然后将范围查询映射到此离散形式。在本文中,我们利用先前在参考存储器访问系统中优化通信的工作来为关联的存储器访问系统提供相同的优化。我们定义了范围查询的可能语义,并提出了三种设计以及对各种应用程序领域中问题的分析,并讨论了针对每个问题域的设计可行性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号