Przeglądaj źródła

Added a conclusion to the paper

Cameron Weinfurt 5 miesięcy temu
rodzic
commit
e71e1d6290
1 zmienionych plików z 3 dodań i 4 usunięć
  1. 3
    4
      paper.tex

+ 3
- 4
paper.tex Wyświetl plik

@@ -95,10 +95,7 @@ manage a series of finite sized watermark allocators. The implementation does no
95 95
 of a watermark allocator until a request for a fixed sized allocation is made. It is limited to a
96 96
 space of 4096 bytes, enforcing that the allocator be used for small, fixed size allocations. Larger
97 97
 allocations will either fail or be allocated using the tree allocator instead. Should an allocator run
98
-out of space, a new one is created and the allocation is performed on that new allocator. In addition,
99
-    it is stored as a node within the tree allocator, meaning the last reference to the memory region
100
-    will be the global allocator itself, which will free the space through the tree allocator
101
-    automatically when the reference count on the space goes to zero. 
98
+out of space, a new one is created and the allocation is performed on that new allocator. In addition, it is stored as a node within the tree allocator, meaning the last reference to the memory region will be the global allocator itself, which will free the space through the tree allocator automatically when the reference count on the space goes to zero. 
102 99
 
103 100
 \section{Results}
104 101
 
@@ -119,4 +116,6 @@ A set of 3 allocations were made of size 20. They were doubled in size repeatedl
119 116
 
120 117
 \section{Conclusion}
121 118
 
119
+Due to time constraints, we were unable to finalize the allocator as a whole. The tree allocator is in a mostly working state, but appears to behave different depending on build parameters and which tools the test environment is run under. In most cases, the allocator will leak due to bugs in the red-black tree implementation. The watermark allocator, being dependent on the tree allocator, was not tested even though an implementation was written. The choice to use a red-black tree may have been suboptimal. Even though it is a self-balancing binary search tree that gives logarithmic time search, insert and deletion, other types of self-balancing trees could have been used. A B-tree may have been the more appropriate 
120
+
122 121
 \end{document}

Ładowanie…
Anuluj
Zapisz