Fausto Bernardini, Holly Rushmeier
Proceedings of SPIE - The International Society for Optical Engineering
We consider the problem of interleaving sequences of positive and negative numbers in order to maximize the minimum, overall prefixes p of the interleaved sequence, of the sum of the numbers in p. A simple and efficient offline solution is given. We also consider an online version of the problem. Under a cost model suitable for the prefetching application that motivates the problem, a strongly competitive online algorithm is given. These problems abstract two practical problems of scheduling data prefetches in a multiprogrammed or multithreaded computing environment.
Fausto Bernardini, Holly Rushmeier
Proceedings of SPIE - The International Society for Optical Engineering
Harpreet S. Sawhney
IS&T/SPIE Electronic Imaging 1994
I.K. Pour, D.J. Krajnovich, et al.
SPIE Optical Materials for High Average Power Lasers 1992
Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization