Compare-and-swap

Applied sciences
Génie informatique
Calcul intensif
Parallélisme (informatique)

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (24)

On the Performance of Delegation over Cache-Coherent Shared Memory

André Schiper, Thomas Ropars, Darko Petrovic

Delegation is a thread synchronization technique where access to shared data is performed through a dedicated server thread. When a client thread requires shared data access, it makes a request to a server and waits for a response. This paper studies deleg ...

2015

On the MAC for Power-Line Communications: Modeling Assumptions and Performance Tradeoffs

Patrick Thiran, Julien Pierre Sacha Herzen, Christina Vlachou

Power-line communications are becoming a key component in home networking. The dominant MAC protocol for high data-rate power-line communications, IEEE 1901, employs a CSMA/CA mechanism similar to the backoff process of 802.11. Existing performance evaluat ...

2014

Concurrent Tries with Efficient Non-Blocking Snapshots

Martin Odersky, Aleksandar Prokopec

We describe a non-blocking concurrent hash trie based on shared-memory single-word compare-and-swap instructions. The hash trie supports standard mutable lock-free operations such as insertion, removal, lookup and their conditional variants. To ensure spac ...

Assoc Computing Machinery2012

BRIEF: Computing a Local Binary Descriptor Very Fast

Pascal Fua, Vincent Lepetit, Christoph Strecha, Michael Calonder, Mustafa Özuysal, Tomasz Piotr Trzcinski

Binary descriptors are becoming increasingly popular as a means to compare feature points very fast and while requiring comparatively small amounts of memory. The typical approach to creating them is to first compute floating-point ones, using an algorithm ...

Institute of Electrical and Electronics Engineers2012

Page 2 sur 2