* It has been decided that using an array'ized bucket'ized hash table is probably a better approach.
* References: [1](http://kerneltrap.org/mailarchive/freebsd-current/2010/10/1/6260944) [2](http://leaf.dragonflybsd.org/mailarchive/kernel/2005-01/msg00122.html)
+### Trampoline Code Page instead of direct syscalls
+* Map a read/execute trampoline page into every process, which has a syscall table, i.e. is used instead of "int" to enter the kernel. This way we can easily change the kernel enter method from "int" to e.g. "sysenter" without having to recompile userland applications, or even implement some syscalls in userspace.
+
+### Compressed in-memory swap device
+* A device that uses physical memory as swap space, but compresses it.
+* Do we support stacking of swap space? For example, one would have this compressed in-memory swap device with highest priority. Replaced objects will be put into the next priority swap device (e.g. a SSD), and so on.
+
For more theoretical projects and project concepts see [[ResearchProjects|/docs/developer/ResearchProjectsPage]]