Y.Y. Li, K.S. Leung, et al.
J Combin Optim
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.
Y.Y. Li, K.S. Leung, et al.
J Combin Optim
A. Grill, B.S. Meyerson, et al.
Proceedings of SPIE 1989
A.R. Gourlay, G. Kaye, et al.
Proceedings of SPIE 1989
Shu Tezuka
WSC 1991