Papers
Home
A few papers! I have written are given below. They may not be very
rigorous, but they probably were not ment to be so in the first place.
Please let me know if you have any breaking information about the
things I have written on, or if you feel that what I have written is
incorrect.
Thanks!
- Multithreaded(Concurrent) Hash
Tables: This paper describes 2 possible implementations of Hash
Tables in a parallel execution environment. It shows 2 different
approaches that may be used in different situations depending upon the
various requirements and needs of the application, and the environment
it is running in. It also describes why tradititional implementations
of Hash Tables are not fit for use in a concurrent/parallel execution
environment.
- Best Fit algorithm O(n)
barrier broken: In short, this paper describes how to break the
O(n) barrier while implementing the Best-Fit algorithm for a
memory allocator. Specifically, it describes in detail, how to
implement the said algorithm having an asymptotic loose upper bound of
O(lg(n))!