- synchronization primitives
- базисные элементы синхронизации (механизмы нижнего уровня, осуществляющие синхронизацию видеоинформации, звуковой информации и данных)
Большой англо-русский и русско-английский словарь. 2001.
synchronization primitives
Смотреть что такое "synchronization primitives" в других словарях:
Synchronization (computer science) — In computer science, synchronization refers to one of two distinct but related concepts: synchronization of processes, and synchronization of data. Process synchronization refers to the idea that multiple processes are to join up or handshake at… … Wikipedia
Non-blocking synchronization — In computer science, non blocking synchronization ensures that threads competing for a shared resource do not have their execution indefinitely postponed by mutual exclusion. Literature up to the turn of the century used non blocking synonymously … Wikipedia
Non-blocking algorithm — In computer science, a non blocking algorithm ensures that threads competing for a shared resource do not have their execution indefinitely postponed by mutual exclusion. A non blocking algorithm is lock free if there is guaranteed system wide… … 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
Memory barrier — Memory barrier, also known as membar or memory fence or fence instruction, is a type of barrier and a class of instruction which causes a central processing unit (CPU) or compiler to enforce an ordering constraint on memory operations issued… … Wikipedia
Thread (computer science) — This article is about the concurrency concept. For the multithreading in hardware, see Multithreading (computer architecture). For the form of code consisting entirely of subroutine calls, see Threaded code. For other uses, see Thread… … Wikipedia
Concurrent computing — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent c … Wikipedia
Mutual exclusion — For the concept, see Mutually exclusive events. mutex redirects here. For the computer program object that negotiates mutual exclusion among threads, see lock (computer science). Mutual exclusion (often abbreviated to mutex) algorithms are used… … Wikipedia
History monoid — In mathematics and computer science, a history monoid is a way of representing the histories of concurrently running computer processes as a collection of strings, each string representing the individual history of a process. The history monoid… … Wikipedia
Modula-3 — Paradigm(s) imperative, structured, modular Appeared in 1980s Designed by DEC and Olivetti … 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
