S.M. Sadjadi, S. Chen, et al.
TAPIA 2009
The running time of programs in a paging machine generally increases as the store in which programs are constrained to run decreases. Experiment, however, have revealed cases in which the reverse is true: a decrease in the size of the store is accompanied by a decrease in running time. An informal discussion of the anomalous behavior is given, and for the case of the FIFO replacement algorithm a formal treatment is presented. © 1969, ACM. All rights reserved.
S.M. Sadjadi, S. Chen, et al.
TAPIA 2009
Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
Fan Zhang, Junwei Cao, et al.
IEEE TETC