each one. Programs may exhibit parallelism only, concurrency only, both parallelism and concurrency, neither. Multi-threading and multi-processing (shared...

livelocks in parallel programs". Semantics of Concurrent Computation. Lecture Notes in Computer Science. Vol. 70. pp. 172–190. doi:10.1007/BFb0022469...

multitasking or multithreaded environment. Concurrency (computer science) – Computing using multiple concurrent threads of execution, devising algorithms...

up concurrency, concurrent, or concurrence in Wiktionary, the free dictionary. Concurrent means happening at the same time. Concurrency, concurrent, or...

In computer science, a semaphore is a variable or abstract data type used to control access to a common resource by multiple threads and avoid critical...

In computer science, resource starvation is a problem encountered in concurrent computing where a process is perpetually denied necessary resources to...

Presentation about concurrency patterns GopherCon Rethinking Classical Concurrency Patterns slides GoWiki: Learn Concurrency Recordings about concurrency patterns...

Evolving OpenMP in an Age of Extreme Parallelism. Lecture Notes in Computer Science. Springer Berlin Heidelberg. pp. 42–52. doi:10.1007/978-3-642-02303-3_4...

In computer science, synchronization is the task of coordinating multiple processes to join up or handshake at a certain point, in order to reach an agreement...

reverted and the results are ignored. The objective is to provide more concurrency if extra resources are available. This approach is employed in a variety...

technology and computer science, especially in the fields of computer programming, operating systems, multiprocessors, and databases, concurrency control ensures...

Call collision Concurrency control Deadlock Hazard (logic) Linearizability Racetrack problem Symlink race Synchronization (computer science) Time of check...

architecture, mainly in the form of multi-core processors. In computer science, parallelism and concurrency are two different things: a parallel program uses multiple...

model in computer science is a mathematical model of concurrent computation that treats an actor as the basic building block of concurrent computation...

In Computer Science, in the field of databases, non-lock concurrency control is a concurrency control method used in relational databases without using...

In computer science, the dining philosophers problem is an example problem often used in concurrent algorithm design to illustrate synchronization issues...

A chord is a concurrency construct available in Polyphonic C♯ and Cω inspired by the join pattern of the join-calculus. A chord is a function body that...

This is a list of academic conferences in computer science. Only conferences with separate articles are included; within each field, the conferences are...

A routing algorithm decides the path followed by a packet from the source to destination routers in a network. An important aspect to be considered while...

value, routines using these instructions are immune to the ABA problem. Computer programming portal Readers–writers problem Dechev, Damian; Pirkelbauer...

In computer science, concurrency semantics is a way to give meaning to concurrent systems in a mathematically rigorous way. Concurrency semantics is often...

In computer science, a lock or mutex (from mutual exclusion) is a synchronization primitive that prevents state from being modified or accessed by multiple...

In computer science, the sleeping barber problem is a classic inter-process communication and synchronization problem that illustrates the complexities...

semantics; Concurrency semantics is a catch-all term for any formal semantics that describes concurrent computations. Historically important concurrent formalisms...

Retrieved 2008-02-17. Buhr, Peter A. (September 11, 1995). "Are Safe Concurrency Libraries Possible?" (PDF). Communications of the ACM. Retrieved 2015-05-12...

Winskel, G.; Nielsen, M. "Models for Concurrency" (PDF). Handbook of Logic and the Foundations of Computer Science. Vol. 4. OUP. pp. 1–148. Archived from...

reachability problem for 5-dimensional vector addition systems". Theoretical Computer Science. 8 (2): 135–159. doi:10.1016/0304-3975(79)90041-0. hdl:1813/6102. Czerwiński...

In computer science, the readers–writers problems are examples of a common computing problem in concurrency. There are at least three variations of the...

Model Checking". Quantitative Evaluation of Systems. Lecture Notes in Computer Science. Vol. 8657. pp. 170–173. doi:10.1007/978-3-319-10696-0_13. ISBN 978-3-319-10695-3...

In computer science, a timestamp-based concurrency control algorithm is a optimistic concurrency control method. It is used in some databases to safely...