Finding piece-wise affine scheduling function
Trudy Instituta matematiki, Tome 14 (2006) no. 2, pp. 3-10
Voir la notice de l'article provenant de la source Math-Net.Ru
The problem of algorithm transformation for parallelization and improving data locality is considered. A method for finding piece-wise affine scheduling functions is proposed.
@article{TIMB_2006_14_2_a0,
author = {E. V. Adutskevich and N. A. Likhoded},
title = {Finding piece-wise affine scheduling function},
journal = {Trudy Instituta matematiki},
pages = {3--10},
publisher = {mathdoc},
volume = {14},
number = {2},
year = {2006},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/TIMB_2006_14_2_a0/}
}
E. V. Adutskevich; N. A. Likhoded. Finding piece-wise affine scheduling function. Trudy Instituta matematiki, Tome 14 (2006) no. 2, pp. 3-10. http://geodesic.mathdoc.fr/item/TIMB_2006_14_2_a0/