Concurrent linearizable access to shared objects can be prohibitively expensive in a high contention workload. Many applications apply ad-hoc techniques to eliminate the need for synchronous atomic updates, which may result in non-linearizable implementations. We propose a new model which leverages such patterns for concurrent access to objects in a shared memory system. In this model, each thread maintains different views on the shared object: a thread-local view and a global view. As the thread-local view is not shared, it can be updated without incurring synchronization costs. These local updates become visible to other threads only after the thread-local view is merged with the global view. This enables better performance at the expense...
International audienceIn large scale systems such as the Internet, replicating data is an essential ...
Most methods for programming loosely-coupled systems are based on message-passing. Recently, however...
Programming efficient distributed, concurrent systems requires new abstractions that go beyond tradi...
Concurrent linearizable access to shared objects can be prohibitively expensive in a high contention...
The advent of heterogeneous many-core systems has increased the spectrum of achievable performance ...
This dataset contains the source code that is used for the evaluation described in the Euro-Par 2018...
This paper proposes a novel View-based Consistency model for Distributed Shared Memory. A view is a ...
The semantics of concurrent data structures is usually given by a sequential specification and a con...
The semantics of concurrent data structures is usually given by a sequential specification and a con...
The semantics of concurrent data structures is usually given by a sequential specification and a con...
paradigm in parallel and distributed environments. However, DSM often suffers from performance probl...
A problem with running distributed shared memory applications in heterogeneous environments is that ...
For more than fifteen years, researchers have tried to support global optimizations in a usable sema...
Increased programmability for concurrent applications in distributed systems requires automatic supp...
Proving the linearizability of highly concurrent data structures, such as those using optimistic con...
International audienceIn large scale systems such as the Internet, replicating data is an essential ...
Most methods for programming loosely-coupled systems are based on message-passing. Recently, however...
Programming efficient distributed, concurrent systems requires new abstractions that go beyond tradi...
Concurrent linearizable access to shared objects can be prohibitively expensive in a high contention...
The advent of heterogeneous many-core systems has increased the spectrum of achievable performance ...
This dataset contains the source code that is used for the evaluation described in the Euro-Par 2018...
This paper proposes a novel View-based Consistency model for Distributed Shared Memory. A view is a ...
The semantics of concurrent data structures is usually given by a sequential specification and a con...
The semantics of concurrent data structures is usually given by a sequential specification and a con...
The semantics of concurrent data structures is usually given by a sequential specification and a con...
paradigm in parallel and distributed environments. However, DSM often suffers from performance probl...
A problem with running distributed shared memory applications in heterogeneous environments is that ...
For more than fifteen years, researchers have tried to support global optimizations in a usable sema...
Increased programmability for concurrent applications in distributed systems requires automatic supp...
Proving the linearizability of highly concurrent data structures, such as those using optimistic con...
International audienceIn large scale systems such as the Internet, replicating data is an essential ...
Most methods for programming loosely-coupled systems are based on message-passing. Recently, however...
Programming efficient distributed, concurrent systems requires new abstractions that go beyond tradi...