资 源 简 介
This is a Homework given in Technion,Israel in the course Operating Systems (http://webcourse.cs.technion.ac.il/234123/).
We are required to insert a new Data structure to the Linux kernel, the ds is B plus tree with degree = 9.
and handle the cases in which k threads insert and find a key in the tree, without getting deadlocked, and the run time should be optimal.
So we have to design the locks on the nodes of the tree to handle these cases.
