International audienceThis article presents several independent optimizations of operations on monitors. They do not involve the low-level mutual exclusion mechanisms but rather their integration with and usage within higher-level constructs of the lan- guage. The paper reports acceleration of Hop, the Web pro- gramming language for which these optimizations have been created. The paper shows that other languages such as C and Java would also benefit from these optimizations.Cet article présente trois techniques pour utiliser plus efficacement les moniteurs dans les langages de programmation
This paper presents Cologne, a declarative optimization platform that enables constraint optimizatio...
International audiencePortability of performance has been the underlying assumption for the vast maj...
A priori, locking seems easy: To protect shared data from concurrent accesses, it is sufficient to l...
International audienceThis article presents several independent optimizations of operations on monit...
International audienceA plethora of optimized mutex lock algorithms have been designed over the past...
Abstract Language-supported synchronization is a source of serious performance problems in Java prog...
Software solutions for mutual exclusion developed over a 30‐year period, starting with complex ad ho...
Summary In this article, we present mutable locks, a synchronization construct with the same semanti...
International audienceThe traditional approach to multitasking synchronization has been to use Mutex...
This paper presents new starvation-free hardware-assisted and software-only algorithms for the N-thr...
EjFcient synchronization primitives are essential for achieving high performance in he-grain, shared...
Journal ArticleShared memory programs guarantee the correctness of concurrent accesses to shared dat...
Helping is the most common mechanism to guarantee lock-freedom in many concurrent data structures. A...
International audienceNUMA multicore machines are pervasive and many multithreaded applications are ...
International audienceThis paper investigate a mutual exclusion algorithm on distributed systems. We...
This paper presents Cologne, a declarative optimization platform that enables constraint optimizatio...
International audiencePortability of performance has been the underlying assumption for the vast maj...
A priori, locking seems easy: To protect shared data from concurrent accesses, it is sufficient to l...
International audienceThis article presents several independent optimizations of operations on monit...
International audienceA plethora of optimized mutex lock algorithms have been designed over the past...
Abstract Language-supported synchronization is a source of serious performance problems in Java prog...
Software solutions for mutual exclusion developed over a 30‐year period, starting with complex ad ho...
Summary In this article, we present mutable locks, a synchronization construct with the same semanti...
International audienceThe traditional approach to multitasking synchronization has been to use Mutex...
This paper presents new starvation-free hardware-assisted and software-only algorithms for the N-thr...
EjFcient synchronization primitives are essential for achieving high performance in he-grain, shared...
Journal ArticleShared memory programs guarantee the correctness of concurrent accesses to shared dat...
Helping is the most common mechanism to guarantee lock-freedom in many concurrent data structures. A...
International audienceNUMA multicore machines are pervasive and many multithreaded applications are ...
International audienceThis paper investigate a mutual exclusion algorithm on distributed systems. We...
This paper presents Cologne, a declarative optimization platform that enables constraint optimizatio...
International audiencePortability of performance has been the underlying assumption for the vast maj...
A priori, locking seems easy: To protect shared data from concurrent accesses, it is sufficient to l...