Author:
Bielecki Wlodzimierz,Palkowski Marek
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Bastoul, C.: Code generation in the polyhedral model is easier than you think. In: PACT 13 IEEE International Conference on Parallel Architecture and Compilation Techniques, Juan-les-Pins, pp. 7–16 (September 2004)
2. Beletska, A., Bielecki, W., Cohen, A., Palkowski, M., Siedlecki, K.: Coarse-grained loop parallelization: Iteration space slicing vs affine transformations. Parallel Computing 37, 479–497 (2011)
3. Lecture Notes in Computer Science;V. Beletskyy,2003
4. Bielecki, W., Klimek, T., Trifunovic, K.: Calculating exact transitive closure for a normalized affine integer tuple relation. Electronic Notes in Discrete Mathematics 33, 7–14 (2009)
5. Lecture Notes in Computer Science;B. Wlodzimierz,2010
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Optimizing Numerical Code by means of the Transitive Closure of Dependence Graphs;Proceedings of the 2017 Federated Conference on Computer Science and Information Systems;2017-09-24
2. Tile Merging Technique to Generate Valid Tiled Code by Means of the Transitive Closure of a Dependence Graph;Hard and Soft Computing for Artificial Intelligence, Multimedia and Security;2016-10-20
3. TRACO Parallelizing Compiler;Advances in Intelligent Systems and Computing;2015