.png){kind=icon}
返回
Representing and Scheduling Procedural Generation using Operator Graphs
.png){kind=icon}
PRE
AI
DOI：10.1145/2980179.2980227.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we present the concept of operator graph scheduling for high performance procedural generation on the graphics processing unit (GPU). The operator graph forms an intermediate representation that describes all possible operations and objects that can arise during a specific procedural generation. While previous methods have focused on parallelizing a specific procedural approach, the operator graph is applicable to all procedural generation methods that can be described by a graph, such as L-systems, shape grammars, or stack based generation methods. Using the operator graph, we show that all partitions of the graph correspond to possible ways of scheduling a procedural generation on the GPU, including the scheduling strategies of previous work. As the space of possible partitions is very large, we describe three search heuristics, aiding an optimizer in finding the fastest valid schedule for any given operator graph. The best partitions found by our optimizer increase performance of 8 to 30x over the previous state of the art in GPU shape grammar and L-system generation.
Keyword:
Procedural Generation
Operator Graph
GPU
Auto-tuner
Dynamic Scheduling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.5
论文数:
4.8K
被引数:
3.6W
机构
引用论文
.png){kind=icon}
分享收藏
Assessment of land-use land-cover dynamics and urban heat island effect of Dehradun city, North India: a remote sensing approach印度北部德拉登市的土地利用土地覆盖动态和城市热岛效应评估: 一种遥感方法
PREAI
分享收藏Controlling Procedural Modeling Programs with Stochastically-Ordered Sequential Monte Carlo用随机排序的顺序蒙特卡洛控制过程建模程序
PREAI
分享收藏
查看更多内容