Free Scheduling of Tiles Based on the Transitive Closure of Dependence Graphs-Reference-Cited by-同舟云学术

Free Scheduling of Tiles Based on the Transitive Closure of Dependence Graphs

Published:2016 Issue: Volume: Page:133-142
ISSN:0302-9743
Container-title:Parallel Processing and Applied Mathematics
language:
Short-container-title:

Author:

Bielecki Wlodzimierz,Palkowski Marek,Klimek Tomasz

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-32152-3_13

Reference20 articles.

1. Bastoul, C.: Code generation in the polyhedral model is easier than you think. In: PACT 2013 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 Comput. 37, 479–497 (2011)

3. Lecture Notes in Computer Science;M-W Benabderrahmane,2010

4. Bielecki, W., Palkowski, M.: Perfectly nested loop tiling transformations based on the transitive closure of the program dependence graph. Soft Comput. Comput. Inf. Sci. 342, 309–320 (2015)

5. Bielecki, W., Palkowski, M., Klimek, T.: Free scheduling for statement instances of parameterized arbitrarily nested affine loops. Parallel Comput. 38(9), 518–532 (2012)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Generation of parallel synchronization-free tiled code;Computing;2017-10-20

2. 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

3. Parallel Tiled Code Generation with Loop Permutation within Tiles;Computing and Informatics;2017

4. Tiling arbitrarily nested loops by means of the transitive;International Journal of Applied Mathematics and Computer Science;2016-12-01