License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.OPODIS.2017.18
URN: urn:nbn:de:0030-drops-86538
URL: http://drops.dagstuhl.de/opus/volltexte/2018/8653/
Go to the corresponding LIPIcs Volume Portal


Attiya, Hagit ; Yavneh, Gili

Remote Memory References at Block Granularity

pdf-format:
LIPIcs-OPODIS-2017-18.pdf (0.5 MB)


Abstract

The cost of accessing shared objects that are stored in remote memory, while neglecting accesses to shared objects that are cached in the local memory, can be evaluated by the number of remote memory references (RMRs) in an execution. Two flavours of this measureŚcache-coherent (CC) and distributed shared memory (DSM)Śmodel two popular shared-memory architectures. The number of RMRs, however, does not take into account the granularity of memory accesses, namely, the fact that accesses to the shared memory are performed in blocks. This paper proposes a new measure, called block RMRs, counting the number of remote memory references while taking into account the fact that shared objects can be grouped into blocks. On the one hand, this measure reflects the fact that the RMR incurred for bringing a shared object to the local memory might save another RMR for bringing another object placed at the same block. On the other hand, this measure accounts for false sharing: the fact that an RMR may be incurred when accessing an object due to a concurrent access to another object in the same block. This paper proves that in both the CC and the DSM models, finding an optimal placement is NP-hard when objects have different sizes, even for two processes. In the CC model, finding an optimal placement, i.e., grouping of objects into blocks, is NP-hard when a block can store three objects or more; the result holds even if the sequence of accesses is known in advance. In the DSM model, the answer depends on whether there is an efficient mechanism to inform processes that the data in their local memory is no longer valid, i.e., cache coherence is supported. If coherence is supported with cheap invalidation, then finding an optimal solution is NP-hard. If coherence is not supported, an optimal placement can be achieved by placing each object in the memory of the process that accesses it most often, if the sequence of accesses is known in advance.

BibTeX - Entry

@InProceedings{attiya_et_al:LIPIcs:2018:8653,
  author =	{Hagit Attiya and Gili Yavneh},
  title =	{{Remote Memory References at Block Granularity}},
  booktitle =	{21st International Conference on Principles of Distributed Systems (OPODIS 2017)},
  pages =	{18:1--18:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-061-3},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{95},
  editor =	{James Aspnes and Alysson Bessani and Pascal Felber and Jo{\~a}o Leit{\~a}o},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/8653},
  URN =		{urn:nbn:de:0030-drops-86538},
  doi =		{10.4230/LIPIcs.OPODIS.2017.18},
  annote =	{Keywords: false sharing, cache coherence, distributed shared memory, NP-hardness}
}

Keywords: false sharing, cache coherence, distributed shared memory, NP-hardness
Seminar: 21st International Conference on Principles of Distributed Systems (OPODIS 2017)
Issue Date: 2018
Date of publication: 16.03.2018


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI