greg/stasis-aries-wal
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

14 pages!!! (Pulled references, part of conclusion for multiplexer...

Browse source
This commit is contained in:
Sears Russell 2005-03-26 07:26:19 +00:00
parent 1617075291
commit 1738db486a
1 changed files with 9 additions and 8 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

17
doc/paper2/LLADD.tex
View file

@ -2267,14 +2267,15 @@ is more expensive then making a recursive function call.
We considered applying some of the optimizations discussed earlier in We considered applying some of the optimizations discussed earlier in
the paper to our graph traversal algorithm, but opted to dedicate this the paper to our graph traversal algorithm, but opted to dedicate this
section to request reordering. Delta-based log entries would be an section to request reordering.
obvious benefit for this scheme, and there may be a way to use the %Delta-based log entries would be an
\oasys implementation to reduce page file utilization. The request %obvious benefit for this scheme, and there may be a way to use the
reordering optimization made use of reusable operation implementations %\oasys implementation to reduce page file utilization. The request
by borrowing ArrayList from the hashtable. It cleanly separates wrapper %%reordering optimization made use of reusable operation implementations
functions from implementations and makes use of application-level log %by borrowing ArrayList from the hashtable. It cleanly separates wrapper
manipulation primitives to produce locality in workloads. We believe %functions from implementations and makes use of application-level log
these techniques can be generalized to other applications quite easily. %manipulation primitives to produce locality in workloads. We believe
%these techniques can be generalized to other applications quite easily.
%This section uses: %This section uses:
% %