Software Systems Lab
Overview Downloads
Project Title:


In order to guarantee a constant worst-case operation times, nowadays hash table schemes make usage, besides the main memory, also of a content-addressable memory(CAM) device; a small and expensive memory chip that supports parallel lookup operation to all its memory words. The CAM is used to store overflow elements that no free space was found for them on insertion (in the main memory) up until the guaranteed constant worst-case operation time. As the CAM device is extremely expensive, it makes sense to move elements back from the CAM to the main memory whenever a space gets available as a result of a deletion operation. Thus, there is a need to maintain much smaller CAM. In this project we will learn, simulate and compare various strategies to move back elements from the CAM to the main memory.

all completed projects