Information Technology Reference
In-Depth Information
Figure 4. Reading overhead with different maxi-
mum prefetching buffer proportion
time interval of two neighboring items is greater
than a threshold. In the last set of simulations, we
vary this time interval threshold from 10ms to
150ms (the default value is 30ms), and illustrate
the overhead and hit ratio with prefetching in
Figure 8 and Figure 9, respectively. We observe
that here also exists an optimal value for this
threshold. In particular, short traces would miss
some long sequences during the trace collecting
process, while a large time interval threshold that
may keep longer traces would take a long time to
collect enough traces for prefetching, resulting in
the slow increase of the trace library size and thus
less accuracy of the algorithm.
RELATED WORK
Figure 5. Hit ratio with different maximum
prefetching buffer proportion
The history of remote memory sharing system
can be retrospect to 1990s. As an initial work,
several memory sharing schemes, which are
usually called network memory systems, have
been proposed. We can category these systems
into three major types based on the objectives,
which are high-speed paging device (Feeley,
et al.
, 1995; Hines, Lewandowski,
et al.
, 2006;
Hines, Wang,
et al.
, 2006; Markatos,
et al.
, 1996;
Oleszkiewicz,
et al.
, 2004), data cache for local
Figure 6. Reading overhead with different maxi-
mum trace library size
but also old traces that are kept in the large trace
library for a long time, which would not help
improve the accuracy of the algorithm. Therefore,
the desired algorithm should either wash out the
old traces in time, or reduce their impact, which
are interesting topics for our future work.
Simulation 4
. The effect of splitting threshold
According to the trace recording process, a se-
quence is split into small ones when the recording
Search WWH ::
Custom Search