Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Semaphore #1088

Closed
elizarov opened this issue Apr 12, 2019 · 0 comments
Closed

Semaphore #1088

elizarov opened this issue Apr 12, 2019 · 0 comments
Assignees
@ndkoval
Labels
enhancement

Comments

@elizarov
Copy link
Contributor

elizarov commented Apr 12, 2019 •
edited
Loading

It is occasionally useful to have semaphore to limit concurrency. This is related to #172 as it serve as an alternative (more low-level) way and is also mentioned in discussion on RW mutex in #94
ndkoval added a commit that referenced this issue Apr 15, 2019
@ndkoval
Add Semaphore
ac144ef 
Fixes #1088
@ndkoval ndkoval mentioned this issue Apr 15, 2019
Merged
ndkoval added a commit that referenced this issue Apr 24, 2019
@ndkoval
Add Semaphore.
90d92ca 
In addition, a `SegmentQueue` data structure, which emulates an infinite array with fast removing from the middle, is introduced for storing suspended acquirers in the semaphore algorithm.

Fixes #1088
elizarov pushed a commit that referenced this issue Apr 26, 2019
@ndkoval @elizarov
Add Semaphore.
3c15b6f 
In addition, a `SegmentQueue` data structure, which emulates an infinite array with fast removing from the middle, is introduced for storing suspended acquirers in the semaphore algorithm.

Fixes #1088
@fvasco fvasco mentioned this issue Apr 28, 2019
Closed
ndkoval added a commit that referenced this issue Apr 29, 2019
@ndkoval
Add Semaphore.
04825a8 
In addition, a `SegmentQueue` data structure, which emulates an infinite array with fast removing from the middle, is introduced for storing suspended acquirers in the semaphore algorithm.

Fixes #1088
ndkoval added a commit that referenced this issue Jun 4, 2019
@ndkoval
Add fast Semaphore.
28ca3b2 
In addition, the `SegmentQueue` data structure, which emulates an infinite array with fast removing from the middle, is introduced for storing suspended acquirers in semaphore/mutex/channel algorithms.

Fixes #1088
elizarov pushed a commit that referenced this issue Jun 6, 2019
@ndkoval @elizarov
Add fast Semaphore.
59b338b 
In addition, the `SegmentQueue` data structure, which emulates an infinite array with fast removing from the middle, is introduced for storing suspended acquirers in semaphore/mutex/channel algorithms.

Fixes #1088
elizarov pushed a commit that referenced this issue Jun 6, 2019
@ndkoval @elizarov
Add fast Semaphore.
5aff68a 
In addition, the `SegmentQueue` data structure, which emulates an infinite array with fast removing from the middle, is introduced for storing suspended acquirers in semaphore/mutex/channel algorithms.

Fixes #1088
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@ndkoval ndkoval

Labels
enhancement
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@elizarov @ndkoval