As the level of parallelism in manycore processors keeps increasing, providing efficient mechanisms for thread syn-chronization in concurrent programs is becoming a ma-jor concern. On cache-coherent shared-memory processors, synchronization efficiency is ultimately limited by the per-formance of the underlying cache coherence protocol. This paper studies how hardware support for message passing can improve synchronization performance. Considering the ubiquitous problem of mutual exclusion, we adapt two state-of-the-art solutions used on shared-memory processors, namely the server approach and the combining approach, to leverage the potential of hardware message passing. We propose HYBCOMB, a novel combining algorithm that uses both message ...
Shared memory is widely regarded as a more intuitive model than message passing for the development ...
This paper proposes a set of efficient primitives for process synchronization in multiprocessors. T...
AbstreetThis paper proposes a set of efficient primitives for process synchronization in muitiproces...
International audienceAs the level of parallelism in manycore processors keeps increasing, providing...
As the level of parallelism in manycore processors keeps increasing, providing efficient mechanisms ...
Current and emerging high-performance parallel computer architectures generally implement one of two...
Current and emerging high-performance parallel computer architectures generally implement one of two...
Shared memory is the most popular parallel programming model for multi-core processors, while messag...
On the road to computer systems able to support the requirements of exascale applications, Chip Mult...
This paper discusses some of the issues involved in implementing a shared-address space programming ...
The quest to improve performance forces designers to explore finer-grained multiprocessor machines. ...
Shared memory multiprocessors are considered among the easiest parallel computers to program. Howeve...
Shared memory multiprocessors are considered among the easiest parallel computers to program. Howeve...
On the road to computer systems able to support the requirements of exascale applications, Chip Mult...
Shared-memory and message-passing are two op- posite models to develop parallel computations. The sh...
Shared memory is widely regarded as a more intuitive model than message passing for the development ...
This paper proposes a set of efficient primitives for process synchronization in multiprocessors. T...
AbstreetThis paper proposes a set of efficient primitives for process synchronization in muitiproces...
International audienceAs the level of parallelism in manycore processors keeps increasing, providing...
As the level of parallelism in manycore processors keeps increasing, providing efficient mechanisms ...
Current and emerging high-performance parallel computer architectures generally implement one of two...
Current and emerging high-performance parallel computer architectures generally implement one of two...
Shared memory is the most popular parallel programming model for multi-core processors, while messag...
On the road to computer systems able to support the requirements of exascale applications, Chip Mult...
This paper discusses some of the issues involved in implementing a shared-address space programming ...
The quest to improve performance forces designers to explore finer-grained multiprocessor machines. ...
Shared memory multiprocessors are considered among the easiest parallel computers to program. Howeve...
Shared memory multiprocessors are considered among the easiest parallel computers to program. Howeve...
On the road to computer systems able to support the requirements of exascale applications, Chip Mult...
Shared-memory and message-passing are two op- posite models to develop parallel computations. The sh...
Shared memory is widely regarded as a more intuitive model than message passing for the development ...
This paper proposes a set of efficient primitives for process synchronization in multiprocessors. T...
AbstreetThis paper proposes a set of efficient primitives for process synchronization in muitiproces...