[SERVER-65255] Refactor the FifoTicketHolder to accept other queue implementations Created: 05/Apr/22 Updated: 06/Dec/22 Resolved: 15/Jun/22 |
|
| Status: | Closed |
| Project: | Core Server |
| Component/s: | None |
| Affects Version/s: | None |
| Fix Version/s: | None |
| Type: | Improvement | Priority: | Major - P3 |
| Reporter: | Jordi Olivares Provencio | Assignee: | Backlog - Storage Execution Team |
| Resolution: | Won't Do | Votes: | 0 |
| Labels: | None | ||
| Remaining Estimate: | Not Specified | ||
| Time Spent: | Not Specified | ||
| Original Estimate: | Not Specified | ||
| Assigned Teams: |
Storage Execution
|
| Participants: |
| Description |
|
The FifoTicketHolder currently only works with a hard-coded queue. As part of the project we want to explore different queueing policies which will need different implementations of the queue. Conceptually this would mean having an abstract queue with two methods dequeue, enqueue which offer some atomic guarantees in the operations. |
| Comments |
| Comment by Jordi Olivares Provencio [ 15/Jun/22 ] |
|
Focus has been put on identifying when a system is overloaded and scheduling instead of the specific queue implementation to use |