Peterson — is a common name, and may refer to:;People *Peterson (name);Fictional characters * Minty Peterson, character in EastEnders * Norm Peterson, character on the American TV show Cheers ;Places * Peterson Air Force Base, Colorado, USA * Peterson,… … Wikipedia
Dekker'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… … Wikipedia
Lamport'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… … Wikipedia
Nagle's algorithm — Nagle s algorithm, named after John Nagle, is a means of improving the efficiency of TCP/IP networks by reducing the number of packets that need to be sent over the network. Nagle s document, Congestion Control in IP/TCP Internetworks (RFC 896)… … Wikipedia
BCH code — In coding theory the BCH codes form a class of parameterised error correcting codes which have been the subject of much academic attention in the last fifty years. BCH codes were invented in 1959 by Hocquenghem, and independently in 1960 by Bose… … Wikipedia
List of algorithms — The following is a list of the algorithms described in Wikipedia. See also the list of data structures, list of algorithm general topics and list of terms relating to algorithms and data structures.If you intend to describe a new algorithm,… … 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
Spinlock — In software engineering, a spinlock is a lock where the thread simply waits in a loop ( spins ) repeatedly checking until the lock becomes available. As the thread remains active but isn t performing a useful task, the use of such a lock is a… … Wikipedia
Lock (computer science) — In computer science, a lock is a synchronization mechanism for enforcing limits on access to a resource in an environment where there are many threads of execution. Locks are one way of enforcing concurrency control policies. Contents 1 Types 2… … Wikipedia
Cyclic redundancy check — A cyclic redundancy check (CRC) is an error detecting code designed to detect accidental changes to raw computer data, and is commonly used in digital networks and storage devices such as hard disk drives. Blocks of data entering these systems… … Wikipedia