Tight rmr lower bounds for mutual exclusion and other problems

@inproceedings{Attiya2008TightRL,
  title={Tight rmr lower bounds for mutual exclusion and other problems},
  author={Hagit Attiya and Danny Hendler and Philipp Woelfel},
  booktitle={STOC},
  year={2008}
}
We investigate the remote memory references (RMRs) complexity of deterministic processes that communicate by reading and writing shared memory in asynchronous cache-coherent and distributed shared-memory multiprocessors. We define a class of algorithms that we call order encoding. By applying information-theoretic arguments, we prove that every order encoding algorithm, shared by n processes, has an execution that incurs Ω(n log n) RMRs. From this we derive the same lower bound for the mutual… CONTINUE READING
Highly Cited
This paper has 66 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

66 Citations

051015'10'13'16'19
Citations per Year
Semantic Scholar estimates that this publication has 66 citations based on the available data.

See our FAQ for additional information.

References

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

Similar Papers

Loading similar papers…