Decoupling algorithms from schedules for easy optimization of image processing pipelines
Using existing programming tools, writing high-performance image processing code requires sacrificing readability, portability, and modularity. We argue that this is a consequence of conflating what computations define the algorithm, with decisions about storage and the order of computation. We refe...
Principais autores: | Adams, Andrew, Paris, Sylvain, Levoy, Marc, Ragan-Kelley, Jonathan Millar, Amarasinghe, Saman P., Durand, Fredo |
---|---|
Outros Autores: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Formato: | Artigo |
Idioma: | en_US |
Publicado em: |
Association for Computing Machinery (ACM)
2014
|
Acesso em linha: | http://hdl.handle.net/1721.1/85942 https://orcid.org/0000-0001-9919-069X https://orcid.org/0000-0002-7231-7643 |
Registros relacionados
-
Decoupled Sampling for Graphics Pipelines
por: Ragan-Kelley, Jonathan Millar, et al.
Publicado em: (2012) -
Halide: a language and compiler for optimizing parallelism, locality, and recomputation in image processing pipelines
por: Barnes, Connelly, et al.
Publicado em: (2014) -
Decoupled Sampling for Real-Time Graphics Pipelines
por: Ragan-Kelley, Jonathan, et al.
Publicado em: (2010) -
Decoupling algorithms from the organization of computation for high performance image processing
por: Ragan-Kelley, Jonathan Millard
Publicado em: (2014) -
A Hierarchical Volumetric Shadow Algorithm for Single Scattering
por: Baran, Ilya, et al.
Publicado em: (2012)