multiplexer graph
This commit is contained in:
parent
ec44eb85f3
commit
b604b139e5
2 changed files with 5 additions and 0 deletions
|
@ -2054,6 +2054,11 @@ inverse of the application request. Since the logical inverse of most
|
||||||
application request is another application request, we can {\em reuse} our
|
application request is another application request, we can {\em reuse} our
|
||||||
logging format and wrapper functions to implement a purely logical log.
|
logging format and wrapper functions to implement a purely logical log.
|
||||||
|
|
||||||
|
\begin{figure}
|
||||||
|
\includegraphics[width=1\columnwidth]{graph-traversal.pdf}
|
||||||
|
\caption{\label{fig:multiplexor} Multiplexer...}
|
||||||
|
\end{figure}
|
||||||
|
|
||||||
For our graph traversal algorithm we use a {\em log multiplexer} to
|
For our graph traversal algorithm we use a {\em log multiplexer} to
|
||||||
route entries from a single log into many sub-logs according to the
|
route entries from a single log into many sub-logs according to the
|
||||||
page that each entry refers to. This is easy to do with the Array
|
page that each entry refers to. This is easy to do with the Array
|
||||||
|
|
BIN
doc/paper2/graph-traversal.pdf
Normal file
BIN
doc/paper2/graph-traversal.pdf
Normal file
Binary file not shown.
Loading…
Reference in a new issue