Getting ready to alphabetize references...
This commit is contained in:
Sears Russell
parent
1cb0e73767
commit
ae003b5b45
6 changed files with 67 additions and 13 deletions
55
doc/paper/LLADD-Arch3.fig
Normal file
55
doc/paper/LLADD-Arch3.fig
Normal file
|
|
@ -0,0 +1,55 @@
|
|||
#FIG 3.2 Produced by xfig version 3.2.5-alpha5
|
||||
Landscape
|
||||
Center
|
||||
Metric
|
||||
A4
|
||||
100.00
|
||||
Single
|
||||
-2
|
||||
1200 2
|
||||
6 450 990 6570 1350
|
||||
6 6030 1080 6570 1260
|
||||
1 4 0 1 0 0 50 -1 20 0.000 1 0.0000 6120 1170 23 23 6098 1170 6143 1170
|
||||
1 4 0 1 0 0 50 -1 20 0.000 1 0.0000 6300 1170 23 23 6278 1170 6323 1170
|
||||
1 4 0 1 0 0 50 -1 20 0.000 1 0.0000 6480 1170 23 23 6458 1170 6503 1170
|
||||
-6
|
||||
2 2 0 1 0 7 50 -1 -1 0.000 0 0 -1 0 0 5
|
||||
450 990 1620 990 1620 1350 450 1350 450 990
|
||||
2 2 0 1 0 7 50 -1 -1 0.000 0 0 -1 0 0 5
|
||||
1890 990 3870 990 3870 1350 1890 1350 1890 990
|
||||
2 2 0 1 0 7 50 -1 -1 0.000 0 0 -1 0 0 5
|
||||
4050 990 5850 990 5850 1350 4050 1350 4050 990
|
||||
4 0 0 50 -1 0 14 0.0000 0 195 1260 540 1260 Hash Table\001
|
||||
4 0 0 50 -1 0 14 0.0000 0 195 2280 1980 1260 Record based access \001
|
||||
4 0 0 50 -1 0 14 0.0000 0 255 1935 4140 1260 Page based access\001
|
||||
-6
|
||||
6 5130 4230 6210 4590
|
||||
2 2 0 1 0 7 50 -1 -1 0.000 0 0 -1 0 0 5
|
||||
5130 4230 6120 4230 6120 4590 5130 4590 5130 4230
|
||||
4 0 0 50 -1 0 14 0.0000 0 255 945 5220 4500 Page I/O\001
|
||||
-6
|
||||
2 2 0 1 0 7 50 -1 -1 0.000 0 0 -1 0 0 5
|
||||
3600 2340 6390 2340 6390 2700 3600 2700 3600 2340
|
||||
2 2 0 1 0 7 50 -1 -1 0.000 0 0 -1 0 0 5
|
||||
1710 3600 3060 3600 3060 3960 1710 3960 1710 3600
|
||||
2 2 0 1 0 7 50 -1 -1 0.000 0 0 -1 0 0 5
|
||||
1260 4230 2070 4230 2070 4590 1260 4590 1260 4230
|
||||
2 1 0 1 0 0 50 -1 20 0.000 0 0 7 0 0 2
|
||||
450 1890 6570 1890
|
||||
2 2 0 1 0 7 50 -1 -1 0.000 0 0 -1 0 0 5
|
||||
630 2340 3330 2340 3330 2700 630 2700 630 2340
|
||||
2 2 0 1 0 7 50 -1 -1 0.000 0 0 -1 0 0 5
|
||||
3510 3600 5130 3600 5130 3960 3510 3960 3510 3600
|
||||
2 2 0 1 0 7 50 -1 -1 0.000 0 0 -1 0 0 5
|
||||
2340 4230 4680 4230 4680 4590 2340 4590 2340 4230
|
||||
2 2 0 1 0 7 50 -1 -1 0.000 0 0 -1 0 0 5
|
||||
2160 2970 4860 2970 4860 3330 2160 3330 2160 2970
|
||||
4 0 0 50 -1 0 14 0.0000 0 255 4605 450 1800 Operation Implementations (Extensions)\001
|
||||
4 0 0 50 -1 0 14 0.0000 0 195 945 450 2160 LLADD\001
|
||||
4 0 0 50 -1 0 14 0.0000 0 255 3120 720 2610 Page Manipulation Routines\001
|
||||
4 0 0 50 -1 0 14 0.0000 0 255 2985 3870 2610 Tcommit(), Tabort(), etc...\001
|
||||
4 0 0 50 -1 0 14 0.0000 0 255 3165 2250 3240 Operations API (Tupdate())\001
|
||||
4 0 0 50 -1 0 14 0.0000 0 255 1035 1980 3870 Recovery\001
|
||||
4 0 0 50 -1 0 14 0.0000 0 255 1755 3600 3870 Buffer Manager\001
|
||||
4 0 0 50 -1 0 14 0.0000 0 255 765 1350 4500 Logger\001
|
||||
4 0 0 50 -1 0 14 0.0000 0 255 2670 2430 4500 Page replacement policy\001
|
||||
BIN
doc/paper/LLADD-Arch3.pdf
Normal file
BIN
doc/paper/LLADD-Arch3.pdf
Normal file
Binary file not shown.
Binary file not shown.
|
|
@ -397,8 +397,8 @@ values), and releases any latches that it acquired. %
|
|||
width=0.70\columnwidth]{TSetCall.pdf}
|
||||
\end{center}
|
||||
|
||||
\caption{\label{cap:Tset}Runtime behavior of a simple operation. Tset() and do\_set() are
|
||||
implemented as extensions, while Tupdate() is built in. New operations
|
||||
\caption{\label{cap:Tset}Runtime behavior of a simple operation. Tset() and redoSet() are
|
||||
extensions that implement a new operation, while Tupdate() is built in. New operations
|
||||
need not be aware of the complexities of LLADD.}
|
||||
\end{figure}
|
||||
|
||||
|
|
@ -577,9 +577,8 @@ data primitives to application developers.
|
|||
|
||||
%
|
||||
\begin{figure}
|
||||
\includegraphics[%
|
||||
width=1.0\columnwidth]{LLADD-Arch2.pdf}
|
||||
|
||||
~~\includegraphics[%
|
||||
width=1.0\columnwidth]{LLADD-Arch3.pdf}
|
||||
|
||||
\caption{\label{cap:LLADD-Architecture}Simplified LLADD Architecture: The
|
||||
core of the library places as few restrictions on the application's
|
||||
|
|
@ -615,7 +614,7 @@ refined the boundaries among these modules. Figure~\ref{cap:LLADD-Architecture}
|
|||
core of the LLADD library is quite small at 2218 lines of code, 2155
|
||||
lines of implementations of operations and other extensions, and 408
|
||||
lines of installable header files.\footnote{These counts were generated using David
|
||||
A. Wheeler's {\tt SLOCCount}. \cite{sloccount}} The code has been documented extensively,
|
||||
A. Wheeler's {\tt SLOCCount}.} The code has been documented extensively,
|
||||
and we hope that we have exposed most of the subtle interactions
|
||||
among internal modules in the online documentation.
|
||||
|
||||
|
|
@ -658,7 +657,7 @@ adding a ``simulate crash'' operation to a few of the key components,
|
|||
we can simulate application level crashes by clearing LLADD's internal
|
||||
state, re-initializing the library and verifying that recovery was
|
||||
successful. These tests currently cover approximately
|
||||
90\%\footnote{generated using ``gcov'', which is part of gcc, and ``lcov,'' which interprets gcov's output.~\cite{lcov}}
|
||||
90\%\footnote{generated using ``gcov'', which is part of gcc, and ``lcov,'' which interprets gcov's output.}
|
||||
of the code. We have not yet developed a mechanism that will allow us to
|
||||
accurately model hardware failures, which is an area where futher
|
||||
work is needed. However, the basis for this work will be the development
|
||||
|
|
@ -1144,7 +1143,7 @@ LLADD is free software, available at:
|
|||
|
||||
\bibitem[Stonebraker]{newTypes} Stonebraker. {\em Inclusion of New Types in Relational Data Base } ICDE (1986) p. 262-269
|
||||
|
||||
\bibitem[Gray]{physiological} Gray, J. and Reuter, A. {\em Transaction Processing: Concepts and Techniques}. Morgan Kaufmann (199) San Mateo, CA
|
||||
\bibitem[Gray]{physiological} Gray, J. and Reuter, A. {\em Transaction Processing: Concepts and Techniques}. Morgan Kaufmann (1993) San Mateo, CA
|
||||
|
||||
\bibitem[Agrawal]{multipleGenericLocking} Agrawal, et al. {\em Concurrency Control Performance Modeling: Alternatives and Implications}. TODS 12(4): (1987) 609-654
|
||||
|
||||
|
|
@ -1162,9 +1161,9 @@ LLADD is free software, available at:
|
|||
|
||||
\bibitem[BDB]{bdb} Berkeley~DB~4.2.52, {\tt http://www.sleepycat.com/}
|
||||
|
||||
\bibitem[SLOCCount]{sloccount} SLOCCount, {\tt http://www.dwheeler.com/sloccount/ }
|
||||
%\bibitem[SLOCCount]{sloccount} SLOCCount, {\tt http://www.dwheeler.com/sloccount/ }
|
||||
%
|
||||
\bibitem[lcov]{lcov} The~LTP~gcov~extension, {\tt http://ltp.sourceforge.net/coverage/lcov.php }
|
||||
%\bibitem[lcov]{lcov} The~LTP~gcov~extension, {\tt http://ltp.sourceforge.net/coverage/lcov.php }
|
||||
%
|
||||
\bibitem[Reiser]{reiser} Reiser,~Hans~T. {\em ReiserFS 4} {\tt http://www.namesys.com/v4/v4.html } (2004)
|
||||
%
|
||||
|
|
|
|||
|
|
@ -22,7 +22,7 @@ Single
|
|||
4 0 0 50 -1 1 12 0.0000 0 195 915 4095 4005 Update lsn\001
|
||||
4 0 0 50 -1 1 12 0.0000 0 195 1575 4095 3735 Write data to page\001
|
||||
4 0 0 50 -1 1 12 0.0000 0 195 1455 4095 3465 Parse arguments\001
|
||||
4 0 0 50 -1 1 14 0.0000 0 255 1980 3960 3105 do_set(LogEntry)\001
|
||||
4 0 0 50 -1 1 14 0.0000 0 255 2655 3690 1395 TUpdate(Record, Args)\001
|
||||
4 0 0 50 -1 1 14 0.0000 0 255 2310 3420 765 TSet(Record, Value)\001
|
||||
4 0 0 50 -1 1 14 0.0000 0 255 2595 3690 1395 Tupdate(Record, Args)\001
|
||||
4 0 0 50 -1 1 14 0.0000 0 255 2265 3420 765 Tset(Record, Value)\001
|
||||
4 0 0 50 -1 1 12 0.0000 0 195 1890 3825 2745 Invoke redo operation\001
|
||||
4 0 0 50 -1 1 14 0.0000 0 255 2115 3960 3105 redoSet(LogEntry)\001
|
||||
|
|
|
|||
Binary file not shown.
Loading…
Reference in a new issue