Semaphore (programming)

Known as: Semaphore (computing), Counting Semaphore, Binary Semaphore 
In computer science, a semaphore is a variable or abstract data type that is used to control access to a common resource by multiple processes in a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2006
2006
Concurrent programs are notorious for containing errors that are difficult to reproduce and diagnose. A common kind of… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
2000
2000
Extended semaphores systems such as in UNIX System V are a powerful extension of Dijkstra’s semaphores. They allow efficient… (More)
  • table I
  • figure 12
  • figure 17
Is this relevant?
Highly Cited
1993
Highly Cited
1993
One common way of constructing hard real-time systems is to use a number of periodic and sporadic tasks assigned static… (More)
  • figure 2
  • figure 1
Is this relevant?
1993
1993
We address a problem arising in debugging parallel programs , detecting race conditions in programs using a single semaphore for… (More)
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Attention is given to the problems that arise during the testing and debugging cycle of concurrent programs because of their… (More)
  • figure 1
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Hélas, il n’y aura plus de livre écrit par W. Richard Stevens, il est décédé en 1999. Mais ses épais ouvrages ont formé des… (More)
Is this relevant?
Highly Cited
1982
Highly Cited
1982
A liveness property asserts that program execution eventually reaches some desirable state. While termination has been studied… (More)
  • figure 3
  • figure 7
  • figure 9
  • figure 10
  • figure 12
Is this relevant?
1982
1982
Most discussions of semaphore primitives m the literature provide only an informal description of their behavtor, rather than a… (More)
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1982
Highly Cited
1982
A technique for solving synchronization problems in distributed programs is described. Use of this technique in environments in… (More)
Is this relevant?
1975
1975
The paper describes the internal structure of a large operating system as a set of cooperating sequential processes. The… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?