发明授权
- 专利标题: Optimized chaining of vertex and fragment programs
- 专利标题(中): 优化链接的顶点和片段程序
-
申请号: US10883893申请日: 2004-07-02
-
公开(公告)号: US07426724B2公开(公告)日: 2008-09-16
- 发明人: Mark J. Kilgard , Christopher T. Dodd , Rev Lebaredian
- 申请人: Mark J. Kilgard , Christopher T. Dodd , Rev Lebaredian
- 申请人地址: US CA Santa Clara
- 专利权人: NVIDIA Corporation
- 当前专利权人: NVIDIA Corporation
- 当前专利权人地址: US CA Santa Clara
- 代理机构: Townsend and Townsend and Crew LLP
- 主分类号: G06F9/45
- IPC分类号: G06F9/45
摘要:
A system optimizes two or more stream processing programs based upon the data exchanged between the stream processing programs. The system alternately processes each stream processing program to identify and remove dead program code, thereby improving execution performance. Dead program code is identified by propagating constants received as inputs from other stream processing programs and by analyzing a first stream processing program and determining the outputs of a second stream processing program that are unused by the first stream processing program. The system may perform multiple iterations of this optimization is previous iterations introduce additional constants used as inputs to a stream processing program. Following optimization of the stream processing programs, the optimized stream processing programs are compiled to a format adapted to be executed by a stream processing system.
公开/授权文献
- US20060005178A1 Optimized chaining of vertex and fragment programs 公开/授权日:2006-01-05
信息查询