New for: D2, D3
It has been posed as an open question: what is the best possible lower bound when coordination mechanisms use preemption. In this thesis we consider three cases: when the jobs have IDs, when coordination mechanisms order the jobs randomly, and when the jobs are anonymous. We prove a tight lower bound for the first two cases and we show our progress in the third case.