G. Pawlowski, T.P. Sauer, et al.
Microlithography 1990
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.
G. Pawlowski, T.P. Sauer, et al.
Microlithography 1990
H.O. Posten
Technometrics
Fritz J. Hohn
Proceedings of SPIE 1989
D. Coppersmith, Fred Mintzer, et al.
Proceedings of SPIE - The International Society for Optical Engineering