Compare-and-swap
- Compare-and-swap
-
Compare-and-swap est une instruction atomique utilisée dans les systèmes multiprocesseurs ou multi-cœurs utilisant une mémoire partagée. Elle compare la valeur stockée à une adresse mémoire donnée à l'un de ses arguments et, en cas d'égalité, écrit une nouvelle valeur à cette adresse. Selon les implémentations, elle signale si l'écriture a réussi soit en renvoyant une valeur booléenne, soit en renvoyant la valeur lue en mémoire.
Wikimedia Foundation.
2010.
Contenu soumis à la licence CC-BY-SA. Source : Article Compare-and-swap de Wikipédia en français (auteurs)
Regardez d'autres dictionnaires:
Compare-and-swap — (CAS) (engl. für „Vergleichen und Tauschen“) Instruktionen werden in der Informatik verwendet, um Locking und Synchronisationsoperationen zu implementieren. Eine Speicherstelle wird mit einem vorgegebenen Wert verglichen, und bei Übereinstimmung… … Deutsch Wikipedia
Compare-and-swap — In computer science, the compare and swap (CAS) CPU instruction is a special instruction that atomically compares the contents of a memory location to a given value and, only if they are the same, modifies the contents of that memory location to… … Wikipedia
Double compare-and-swap — (DCAS or CAS2) is an atomic primitive proposed to support certain concurrent programming techniques. DCAS takes two not necessarily contiguous memory locations and writes new values into them only if they match pre supplied expected values; as… … Wikipedia
Double Compare And Swap — (DCAS or CAS2) is an atomic primitive proposed to support certain concurrent programming techniques. DCAS takes two memory locations and writes new values into them only if they match pre supplied expected values; as such, it is an extension of… … Wikipedia
Lock-free and wait-free algorithms — In contrast to algorithms that protect access to shared data with locks, lock free and wait free algorithms are specially designed to allow multiple threads to read and write shared data concurrently without corrupting it. Lock free refers to the … Wikipedia
Test-and-set — In computer science, the test and set instruction is an instruction used to both test and (conditionally) write to a memory location as part of a single atomic (i.e. non interruptible) operation. This means setting a value, but first performing… … Wikipedia
Fetch-and-add — In computer science, the fetch and add CPU instruction is a special instruction that atomically modifies the contents of a memory location. It is used to implement Mutual exclusion and concurrent algorithms in multiprocessor systems.In… … Wikipedia
Fetch-and-add — ist ein Fachbegriff der Informatik, welcher ein Verfahren zur atomaren Veränderung eines Speicherbereichs beschreibt. Inhaltsverzeichnis 1 Arbeitsweise 2 Implementierung 3 Abgrenzung zu anderen Verfahren … Deutsch Wikipedia
Interest rate cap and floor — Interest rate c An interest rate cap is a derivative in which the buyer receives payments at the end of each period in which the interest rate exceeds the agreed strike price. An example of a cap would be an agreement to receive a payment for… … Wikipedia
Federal takeover of Fannie Mae and Freddie Mac — Fannie Mae headquarters at 3900 Wisconsin Avenue, NW in Washington, D.C. The federal takeover of Fannie Mae and Freddie Mac refers to the placing into conservatorship of government sponsored enterprises Fannie Mae and Freddie Mac by the U.S.… … Wikipedia
