{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:44:00Z","timestamp":1755999840655},"reference-count":28,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2018,7,20]],"date-time":"2018-07-20T00:00:00Z","timestamp":1532044800000},"content-version":"vor","delay-in-days":19,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/http\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Computer Graphics Forum"],"published-print":{"date-parts":[[2018,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Traditional automatic shader simplification simplifies shaders in an offline process, which is typically carried out in a context\u2010oblivious manner or with the use of some example contexts, e.g., certain hardware platforms, scenes, and uniform parameters, etc. As a result, these pre\u2010simplified shaders may fail at adapting to runtime changes of the rendering context that were not considered in the simplification process. In this paper, we propose a new automatic shader simplification technique, which explores two key aspects of a runtime simplification framework: the optimization space and the instant search for optimal simplified shaders with runtime context. The proposed technique still requires a preprocess stage to process the original shader. However, instead of directly computing optimal simplified shaders, the proposed preprocess generates a reduced shader optimization space. In particular, two heuristic estimates of the quality and performance of simplified shaders are presented to group similar variants into representative ones, which serve as basic graph nodes of the simplification dependency graph (SDG), a new representation of the optimization space. At the runtime simplification stage, a parallel discrete optimization algorithm is employed to instantly search in the SDG for optimal simplified shaders. New data\u2010driven cost models are proposed to predict the runtime quality and performance of simplified shaders on the basis of data collected during runtime. Results show that the selected simplifications of complex shaders achieve 1.6 to 2.5 times speedup and still retain high rendering quality.<\/jats:p>","DOI":"10.1111\/cgf.13482","type":"journal-article","created":{"date-parts":[[2018,7,20]],"date-time":"2018-07-20T10:55:46Z","timestamp":1532084146000},"page":"143-154","update-policy":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/http\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Runtime Shader Simplification via Instant Search in Reduced Optimization Space"],"prefix":"10.1111","volume":"37","author":[{"given":"Yazhen","family":"Yuan","sequence":"first","affiliation":[{"name":"State Key Lab of CAD&amp;CG Zhejiang University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Wang","sequence":"additional","affiliation":[{"name":"State Key Lab of CAD&amp;CG Zhejiang University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianlei","family":"Hu","sequence":"additional","affiliation":[{"name":"State Key Lab of CAD&amp;CG Zhejiang University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hujun","family":"Bao","sequence":"additional","affiliation":[{"name":"State Key Lab of CAD&amp;CG Zhejiang University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2018,7,20]]},"reference":[{"key":"e_1_2_9_2_2","doi-asserted-by":"crossref","unstructured":"AnselJ. KamilS. VeeramachaneniK. Ragan\u2010KelleyJ. BosboomJ. O'ReillyU.\u2010M. AmarasingheS.:Opentuner: An extensible framework for program autotuning. InParallel Architecture and Compilation Techniques (PACT) 2014 23rd International Conference on(2014) IEEE pp.303\u2013315. 2.","DOI":"10.1145\/2628071.2628092"},{"key":"e_1_2_9_3_2","doi-asserted-by":"crossref","unstructured":"BaskaranM. M. HartonoA. TavarageriS. HenrettyT. RamanujamJ. SadayappanP.:Parameterized tiling revisited. InProceedings of the 8th annual IEEE\/ACM international symposium on Code generation and optimization(2010) ACM pp.200\u2013209. 2.","DOI":"10.1145\/1772954.1772983"},{"key":"e_1_2_9_4_2","unstructured":"BoydC.:The directx 11 compute shader.shading Course SIGGRAPH(2008). 8."},{"key":"e_1_2_9_5_2","doi-asserted-by":"crossref","unstructured":"BavoilL. SainzM. DimitrovR.:Image\u2010space horizon\u2010based ambient occlusion. InACM SIGGRAPH 2008 talks(2008) ACM p.22. 9.","DOI":"10.1145\/1401032.1401061"},{"key":"e_1_2_9_6_2","doi-asserted-by":"crossref","unstructured":"DornJ. BarnesC. LawrenceJ. WeimerW.:Towards automatic band\u2010limited procedural shaders. InComputer Graphics Forum(2015) vol.34 Wiley Online Library pp.77\u201387. 3","DOI":"10.1111\/cgf.12747"},{"key":"e_1_2_9_7_2","doi-asserted-by":"crossref","unstructured":"DrebinR. A. CarpenterL. HanrahanP.:Volume rendering. InComputer Graphics (Proceedings of SIGGRAPH)(1988) vol.22 ACM pp.65\u201374. 9.","DOI":"10.1145\/378456.378484"},{"key":"e_1_2_9_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2004.840301"},{"key":"e_1_2_9_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/24039.24041"},{"issue":"4","key":"e_1_2_9_10_2","article-title":"A system for rapid exploration of shader optimization choices","volume":"35","author":"He Y.","year":"2016","journal-title":"ACM Transactions on Graphics (Proceedings of SIGGRAPH)"},{"issue":"4","key":"e_1_2_9_11_2","article-title":"Shader components: modular and high performance shader development","volume":"36","author":"He Y.","year":"2017","journal-title":"ACM Transactions on Graphics (Proceedings of SIGGRAPH)"},{"issue":"6","key":"e_1_2_9_12_2","article-title":"A system for rapid, automatic shader level\u2010of\u2010detail","volume":"34","author":"He Y.","year":"2015","journal-title":"ACM Transactions on Graphics (Proceedings of SIGGRAPH ASIA)"},{"key":"e_1_2_9_13_2","doi-asserted-by":"crossref","unstructured":"JordanH. ThomanP. DurilloJ. J. PellegriniS. GschwandtnerP. FahringerT. MoritschH.:A multi\u2010objective auto\u2010tuning framework for parallel codes. InHigh Performance Computing Networking Storage and Analysis (SC) 2012 International Conference for(2012) IEEE pp.1\u201312. 2.","DOI":"10.1109\/SC.2012.7"},{"key":"e_1_2_9_14_2","doi-asserted-by":"crossref","unstructured":"KendallM. G.:A new measure of rank correlation.Biometrika 30 1\/2 (1938) 81\u201393. 7.","DOI":"10.1093\/biomet\/30.1-2.81"},{"key":"e_1_2_9_15_2","unstructured":"NaonoK. TeranishiK. CavazosJ. SudaR.:Software automatic tuning: from concepts to state\u2010of\u2010the\u2010art results.Springer Science & Business Media 2010. 2."},{"key":"e_1_2_9_16_2","unstructured":"OlanoM. KuehneB. SimmonsM.:Automatic shader level of detail. InProceedings of the ACM SIGGRAPH\/EUROGRAPHICS conference on Graphics hardware(2003) Eurographics Association pp.7\u201314. 2."},{"key":"e_1_2_9_17_2","doi-asserted-by":"crossref","unstructured":"PellaciniF.:User\u2010configurable automatic shader simplification. InACM Transactions on Graphics (Proceedings of SIGGRAPH)(2005) vol.24 ACM pp.445\u2013452. 2 4 11.","DOI":"10.1145\/1073204.1073212"},{"key":"e_1_2_9_18_2","doi-asserted-by":"crossref","unstructured":"Sitthi\u2010AmornP. LawrenceJ. YangL. SanderP. V. NehabD. XiJ.:Automated reprojection\u2010based pixel shader optimization. InACM Transactions on Graphics (Proceedings of SIGGRAPH ASIA)(2008) vol.27 ACM p.127. 2 3 4.","DOI":"10.1145\/1409060.1409080"},{"issue":"6","key":"e_1_2_9_19_2","article-title":"Genetic programming for shader simplification","volume":"30","author":"Sitthi\u2010Amorn P.","year":"2011","journal-title":"ACM Transactions on Graphics (Proceedings of SIGGRAPH ASIA)"},{"key":"e_1_2_9_20_2","unstructured":"SampsonA. BaixoA. RansfordB. MoreauT. YipJ. CezeL. OskinM.:Accept: A programmer\u2010guided compiler framework for practical approximate computing.University of Washington Technical Report UW\u2010CSE\u201015\u201001 1(2015). 2."},{"key":"e_1_2_9_21_2","unstructured":"ScherzerD. JeschkeS. WimmerM.:Pixel\u2010correct shadow maps with temporal reprojection and shadow test confidence. InProceedings of the 18th Eurographics conference on Rendering Techniques(2007) Eurographics Association pp.45\u201350. 3."},{"key":"e_1_2_9_22_2","unstructured":"TessendorfJ.:Simulating ocean water.Simulating Nature: Realistic and Interactive Techniques. SIGGRAPH1 2 (2001) 5. 9."},{"key":"e_1_2_9_23_2","doi-asserted-by":"crossref","unstructured":"TiwariA. HollingsworthJ. K.:Online adaptive code generation and tuning. InParallel & Distributed Processing Symposium (IPDPS) 2011 IEEE International(2011) IEEE pp.879\u2013892. 2.","DOI":"10.1109\/IPDPS.2011.86"},{"key":"e_1_2_9_24_2","doi-asserted-by":"crossref","unstructured":"VuducR. DemmelJ. W. YelickK. A.:Oski: A library of automatically tuned sparse matrix kernels. InJournal of Physics: Conference Series(2005) vol.16 IOP Publishing p.521. 2.","DOI":"10.1088\/1742-6596\/16\/1\/071"},{"key":"e_1_2_9_25_2","doi-asserted-by":"crossref","unstructured":"WhaleyR. C. DongarraJ. J.:Automatically tuned linear algebra software. InProceedings of the 1998 ACM\/IEEE conference on Supercomputing(1998) IEEE Computer Society pp.1\u201327. 2.","DOI":"10.1109\/SC.1998.10004"},{"key":"e_1_2_9_26_2","doi-asserted-by":"crossref","unstructured":"WhitlockD. DeyP. HyattR.:A parallel best\u2010first search. InProceedings of the 1988 ACM Sixteenth Annual Conference on Computer Science(1988) CSC '88 pp. 735\u2010. 8.","DOI":"10.1145\/322609.323190"},{"issue":"6","key":"e_1_2_9_27_2","article-title":"Automatic shader simplification using surface signal approximation","volume":"33","author":"Wang R.","year":"2014","journal-title":"ACM Transactions on Graphics (Proceedings of SIGGRAPH ASIA)"},{"key":"e_1_2_9_28_2","doi-asserted-by":"crossref","unstructured":"XiongJ. JohnsonJ. JohnsonR. PaduaD.:Spl: A language and compiler for dsp algorithms. InACM SIGPLAN Notices(2001) vol.36 ACM pp.298\u2013308. 2.","DOI":"10.1145\/381694.378860"},{"key":"e_1_2_9_29_2","doi-asserted-by":"crossref","unstructured":"YangY. BarnesC.:Approximate program smoothing using mean\u2010variance statistics with application to procedural shader bandlimiting. InComputer Graphics Forum(2018) vol.37 Wiley Online Library pp.443\u2013454. 3.","DOI":"10.1111\/cgf.13374"}],"container-title":["Computer Graphics Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1111%2Fcgf.13482","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/pdf\/10.1111\/cgf.13482","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,17]],"date-time":"2023-09-17T22:27:22Z","timestamp":1694989642000},"score":1,"resource":{"primary":{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/10.1111\/cgf.13482"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["10.1111\/cgf.13482"],"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.1111\/cgf.13482","archive":["Portico"],"relation":{},"ISSN":["0167-7055","1467-8659"],"issn-type":[{"value":"0167-7055","type":"print"},{"value":"1467-8659","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7]]},"assertion":[{"value":"2018-07-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}