54 search results - page 2 / 11 » The Worst Page-Replacement Policy |
ICS
1999
Tsinghua U.
13 years 10 months ago
1999
Tsinghua U.
This paper presents an investigation into local mechanisms and scheduling policies that allow guest processes to efficiently exploit otherwise-idle workstation resources. Unlike t...
ICS
2010
Tsinghua U.
14 years 3 months ago
2010
Tsinghua U.
Almost all of the modern computers use multiple cores, and the number of cores is expected to increase as hardware prices go down, and Moore's law fails to hold. Most of the ...
SCHEDULING
2008
13 years 5 months ago
2008
We consider the packet routing problem in store-and-forward networks whose topologies are either paths, trees, or rings. We are interested by the quality of the solution produced,...
IWMM
2007
Springer
13 years 12 months ago
2007
Springer
Traditionally, operating systems use a coarse approximation of memory accesses to implement memory management algorithms by monitoring page faults or scanning page table entries. ...
CODES
2009
IEEE
13 years 10 months ago
2009
IEEE
Reconfigurable Processors utilize a reconfigurable fabric (to implement application-specific accelerators) and may perform runtime reconfigurations to exchange the set of deployed...