M. Shub, B. Weiss
Ergodic Theory and Dynamical Systems
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.
M. Shub, B. Weiss
Ergodic Theory and Dynamical Systems
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
Imran Nasim, Melanie Weber
SCML 2024
Alfred K. Wong, Antoinette F. Molless, et al.
SPIE Advanced Lithography 2000