English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

We consider asynchronous multiprocessor systems where processes communicateby accessing shared memory. Exchange of information among processes in such amultiprocessor necessitates costly memory accesses called \emph{remote memoryreferences} (RMRs), which generate communication on the interconnect joiningprocessors and main memory. In this paper we compare two popular shared memoryarchitecture models, namely the \emph{cache-coherent} (CC) and\emph{distributed shared memory} (DSM) models, in terms of their power forsolving synchronization problems efficiently with respect to RMRs. Theparticular problem we consider entails one process sending a "signal" to asubset of other processes. We show that a variant of this problem can be solvedvery efficiently with respect to RMRs in the CC model, but not so in the DSMmodel, even when we consider amortized RMR complexity.  To our knowledge, this is the first separation in terms of amortized RMRcomplexity between the CC and DSM models. It is also the first separation interms of RMR complexity (for asynchronous systems) that does not rely in anyway on wait-freedom---the requirement that a process makes progress in abounded number of its own steps.

A Complexity Separation Between the Cache-Coherent and Distributed Shared Memory Models