mutual exclusion
11Mutual Life Insurance Co. of New York v. The Rank Organisation Ltd — Mutual Life Insurance Co. of New York v. The Rank Organisation Ltd. [1985] BCLC 11 is a UK company law case dealing with oppression (or unfair prejudice) under s.20 Companies Act 1948 (now s.994 Companies Act 2006). Goulding J delivered the… …
12Mutual Life Insurance Co of New York v The Rank Organisation Ltd — Mutual Life Insurance Co. of New York v The Rank Organisation Ltd. [1985] BCLC 11 is a UK company law case dealing with oppression (or unfair prejudice) under s.20 Companies Act 1948 (now s.994 Companies Act 2006). Goulding J delivered the… …
13Cierre de exclusión mutua — En ciencias de la computación, los cierres de exclusión mutua o candados son un mecanismo de sincronización que limita el acceso a un recurso compartido por varios procesos o hilos en un ambiente de ejecución concurrente, permitiendo así la… …
14взаимное исключение — mutual exclusion взаимное исключение. Подавление размножения первым по времени проникновения в клетку фагом второго фага при повторном заражении (суперинфекции); В.и. может иметь место лишь при заражениях неродственными фагами (мутантными… …
15Monitor (synchronization) — In concurrent programming, a monitor is an object or module intended to be used safely by more than one thread. The defining characteristic of a monitor is that its methods are executed with mutual exclusion. That is, at each point in time, at… …
16Dekker's algorithm — is the first known correct solution to the mutual exclusion problem in concurrent programming. The solution is attributed to Dutch mathematician Th. J. Dekker by Edsger W. Dijkstra in his manuscript on cooperating sequential processes.[1] It… …
17Communications protocol — For other senses of this word, see Protocol. A communications protocol is a system of digital message formats and rules for exchanging those messages in or between computing systems and in telecommunications. A protocol may have a formal… …
18Deadlock — This article is about the computer science concept. For other uses, see Deadlock (disambiguation). A deadlock is a situation where in two or more competing actions are each waiting for the other to finish, and thus neither ever does. It is often… …
19Peterson's algorithm — is a concurrent programming algorithm for mutual exclusion that allows two processes to share a single use resource without conflict, using only shared memory for communication. It was formulated by Gary Peterson in 1981 at the University of… …
20Lamport's bakery algorithm — is a computer algorithm devised by computer scientist Dr. Leslie Lamport, which is intended to improve the safety in the usage of shared resources among multiple threads by means of mutual exclusion. Nature of the problem In computer science, it… …
