Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJanuary 2024
Modeling the Interplay between Loop Tiling and Fusion in Optimizing Compilers Using Affine Relations
- Jie Zhao,
- Jinchen Xu,
- Peng Di,
- Wang Nie,
- Jiahui Hu,
- Yanzhi Yi,
- Sijia Yang,
- Zhen Geng,
- Renwei Zhang,
- Bojie Li,
- Zhiliang Gan,
- Xuefeng Jin
ACM Transactions on Computer Systems (TOCS), Volume 41, Issue 1-4Article No.: 5, Pages 1–45https://doi.org/10.1145/3635305Loop tiling and fusion are two essential transformations in optimizing compilers to enhance the data locality of programs. Existing heuristics either perform loop tiling and fusion in a particular order, missing some of their profitable compositions, or ...
- research-articleJune 2016
A distributed OpenCL framework using redundant computation and data replication
PLDI '16: Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and ImplementationPages 553–569https://doi.org/10.1145/2908080.2908094Applications written solely in OpenCL or CUDA cannot execute on a cluster as a whole. Most previous approaches that extend these programming models to clusters are based on a common idea: designating a centralized host node and coordinating the other ...
Also Published in:
ACM SIGPLAN Notices: Volume 51 Issue 6 - research-articleJune 2013
Halide: a language and compiler for optimizing parallelism, locality, and recomputation in image processing pipelines
PLDI '13: Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and ImplementationPages 519–530https://doi.org/10.1145/2491956.2462176Image processing pipelines combine the challenges of stencil computations and stream programs. They are composed of large graphs of different stencil stages, as well as complex reductions, and stages with global or data-dependent access patterns. ...
Also Published in:
ACM SIGPLAN Notices: Volume 48 Issue 6 - ArticleJuly 2012
Using Program Dynamic Analysis for Weak Algorithm Detection
COMPSAC '12: Proceedings of the 2012 IEEE 36th Annual Computer Software and Applications ConferencePages 342–343https://doi.org/10.1109/COMPSAC.2012.97Most of the proposed software testing approaches have concentrated on identifying faults in the implemented programs with the premise that the program may be implemented incorrectly. Although such premise is valid for many developed software systems and ...
- ArticleOctober 2006
Application of Computational Redundancy in Dangling Pointers Detection
Many programmers manipulate dynamic data improperly, which may produce dynamic memory problems, such as dangling pointer. Dangling pointers can occur when a function returns a pointer to an automatic variable, or when trying to access a deleted object. ...
- ArticleJuly 2005
Application of redundant computation in software performance analysis
WOSP '05: Proceedings of the 5th international workshop on Software and performancePages 111–121https://doi.org/10.1145/1071021.1071032Redundant computation is an execution of a program statement(s) that does not contribute to the program output. The same statement on one execution may exhibit redundant computation whereas on a different execution, it contributes to the program output. ...
- ArticleJanuary 2004
Application of the operational profile in software performance analysis
WOSP '04: Proceedings of the 4th international workshop on Software and performancePages 64–68https://doi.org/10.1145/974044.974053Most of the existing operational profile studies have been proposed for software reliability. Operational profile describes how the program to be used. Our experience with software performance analysis shows that the operational profile may play a role ...
Also Published in:
ACM SIGSOFT Software Engineering Notes: Volume 29 Issue 1 - ArticleMarch 1995
Pushing Semantics Inside Recursion: A General Framework for Semantic Optimization of Recursive Queries
We consider a class of linear query programs and integrity constraints and develop methods for (i) computing the residues and (ii) pushing them inside the recursive programs, minimizing redundant computation and run-time overhead. We also discuss ...