Piece-wise affine scheduling function
Trudy Instituta matematiki, Tome 14 (2006) no. 1, pp. 23-29
Voir la notice de l'article provenant de la source Math-Net.Ru
The paper is dedicated to the problem of algorithms transformation for parallelization and improving of data locality. Piece-wise affine scheduling functions are introduced. Formal constraints which these functions are to satisfy are investigated.
@article{TIMB_2006_14_1_a2,
author = {E. V. Adutskevich and N. A. Likhoded},
title = {Piece-wise affine scheduling function},
journal = {Trudy Instituta matematiki},
pages = {23--29},
publisher = {mathdoc},
volume = {14},
number = {1},
year = {2006},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/TIMB_2006_14_1_a2/}
}
E. V. Adutskevich; N. A. Likhoded. Piece-wise affine scheduling function. Trudy Instituta matematiki, Tome 14 (2006) no. 1, pp. 23-29. http://geodesic.mathdoc.fr/item/TIMB_2006_14_1_a2/