Readers–writers problem

Readers–writers problem

Common

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

In computer science, the readers–writers problems are examples of a common computing problem in concurrency. There are at least three variations of the problems, which deal with situations in which many concurrent threads of execution try to access the same shared resource at one time.

Excerpt from the Wikipedia article “Readers–writers problem”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Open free boosters and add Readers–writers problem to your collection.

Play for free

Related cards