Packed Memory Structure
	o Operations: n Traverse(k)  --  O(k/B) n Insert  --  O(log2n/B) n Delete  -- O(log2n/B) o Goal: n Design a lock-free version of the cache- oblivious algorithm