cameron314 / cameron314/concurrentqueue
worse than locked queue
Nobody has claimed this yet.
- Dominant language
- C++
- Stars
- 12.5k
- Forks
- 1.9k
- PR merge metrics
- No merged PRs in 30d
Description
I tried using this lock free queue in our program, but the performance of the task was even worse.
Our program scenario involves multiple queues, each with a fixed number of elements. After an element is retrieved by wait_dequeue, the program performs other operations and then enqueues the element. The purpose of this is to avoid repeatedly creating objects or to block threads in some scenarios to prevent too many threads from executing a logic at the same time
What I want to know is why the performance of this lock free queue is worse than the locked queue that our program already has
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reproducing the reported scenario with multiple queues containing a fixed number of elements, using wait_dequeue followed by other operations and re-enqueueing. Compare its measurements with the existing locked queue and document the workload, thread counts, and results; done means explaining the observed performance difference or identifying the missing benchmark details.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp
- Domain
- performance
- Issue type
- Bug
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100