An Omega (n log n) lower bound on the cost of mutual exclusion

@inproceedings{Fan2006AnO,
  title={An Omega (n log n) lower bound on the cost of mutual exclusion},
  author={Rui Fan and Nancy A. Lynch},
  booktitle={PODC},
  year={2006}
}
We prove an Ω(n log n) lower bound on the number of non-busywaiting memory accesses by any deterministic algorithm solving n process mutual exclusion that communicates via shared registers. The cost of the algorithm is measured in the state change cost model, a variation of the cache coherent model. Our bound is tight in this model. We introduce a novel information theoretic proof technique. We first establish a lower bound on the information needed by processes to solve mutual exclusion. Then… CONTINUE READING
Highly Cited
This paper has 27 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Similar Papers

Loading similar papers…