JuliaDynamics / JuliaDynamics/ConcurrentSim.jl
Rank priority function in StorePutKey
Nobody has claimed this yet.
- Dominant language
- Julia
- Stars
- 198
- Forks
- 40
- Avg merge
- 21h 40m
- Merged PRs (30d)
- 2
Description
Hi @BenLauwens,
How much work would it take for the priory of a Put object to be dynamic? This would allow implementing age based scheduling policies in a queue with preemption (https://ziv.codes/pdf/sigmetrics2018-scully.pdf). This way, the priority would be a function where the priority changes over time. Since we only track time at event boundaries, I'm thinking this approach may not be possible. Let me know what you think.
Thanks
Contributor guide
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 locating StorePutKey and the Put object, then trace how queue priority is evaluated at event boundaries. Review the linked scheduling paper and determine whether a time-dependent priority can support age-based preemption with the existing event model. Done means the feasibility and required scope are established, including how dynamic priorities would be evaluated.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- julia
- Domain
- backend
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100