Author:
Bielecki Wlodzimierz,Palkowski Marek,Klimek Tomasz
Subject
Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software
Reference37 articles.
1. Some efficient solutions to the affine scheduling problem: I. one-dimensional time;Feautrier;Int. J. Parallel Prog.,1992
2. Some efficient solutions to the affine scheduling problem: II. multi-dimensional time;Feautrier;Int. J. Parallel Prog.,1992
3. Constructive methods for scheduling uniform loop nests;Darte;IEEE Trans. Parallel Distrib. Syst.,1994
4. Affine scheduling on bounded convex polyhedric domains is asymptotically optimal;Le Gouëslier d’Argence;Theor. Comput. Sci.,1998
5. A.W. Lim, G.I. Cheong, M.S. Lam, An affine partitioning algorithm to maximize parallelism and minimize communication, in: Proceedings of the 13th ACM SIGARCH International Conference on Supercomputing, ACM Press, 1999, pp. 228–237.
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献