1. Voevodin, V.V. Parallel'nye vychisleniya / V.V. Voevodin, Vl.V. Voevodin. - SPb.: BKhV-Peterburg, 2002. - 608 s.
2. Voevodin V.V. Vychislitel'naya matematika i struktura algoritmov / V.V. Voevodin // MGU [Elektronnyi resurs] - 2006. - Rezhim dostupa: http://parallel.ru/info/parallel/voevodin. - Data dostupa: 26.12.2007.
3. Darte, A. Mathematical tools for loop transformations: from systems of uniform recurrence equations to the polytope model / A. Darte // Algorithms for Parallel Processing, IMA Volumes in Mathematics and its Applications. - 1999. - Vol. 105. - P. 147-183.
4. Feautrier, P. Some efficient solutions to the affine scheduling problem. Part 2 / P. Feautrier // Int. J. of Parallel Programming. - 1992. - Vol. 21, № 6. - P 389-420.
5. Lim, A.W. Maximizing parallelism and minimizing synchronization with affine partitions / A.W. Lim, M.S. Lam // Parallel Computing. - 1998. - Vol. 24, № 3, 4. - P. 445-475.
6. Adutskevich, E.V. Affine transformations of loop nests for parallel execution and distribution of data over processors / E.V. Adutskevich, S.V. Bakhanovich, N.A. Likhoded. - Minsk, 2005. - 10 s. - (Preprint / NAN Belarusi, In-t matematiki; № 3 (574)).
7. (Pen)-Ultimate Tiling? / P. Boulet [et al.] // Integration, The VLSI J. - 1994. - Vol. 17. - P. 33-51.
8. Hodzic, E. On-Time Optimal Supernode Shape / E. Hodzic, W. Shang // IEEE Transactions on Parallel and Distributed Systems. - 2002. - Vol. 13, № 12. - P. 1220-1223.
9. Xue, J. Time-minimal tiling when rise is larger than zero / J. Xue, W. Cai // Parallel Computing. - 2002. - Vol. 28, № 5. - P. 915-939.
10. Bakhanovich, S.V. Otobrazhenie algoritmov na vychislitel'nye sistemy s raspredelennoi pamyat'yu: optimizatsiya tailinga dlya odno- i dvumernykh topologii / S.V. Bakhanovich, P.I. Sobolevskii // Vestsi NAN Belarusi. Ser. fiz.-mat. navuk. - 2006. - № 2. - S. 106-112.
Email this article 