Framework: SLA-aware scheduling
Open
Nobody has claimed this yet.
- Dominant language
- Python
- Stars
- 21
- Forks
- 4
- Avg merge
- 2d 7h
- Merged PRs (30d)
- 28
Description
From the 2026 Q3 roadmap.
Today: Relative cost heuristic; throughput only.
Goal: Settable SLO targets and goodput reporting.
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
The issue names no files, tests, or entry points; begin with the linked 2026 Q3 roadmap issue (#9) and trace the current relative-cost and throughput scheduling design. Done means the scheduler supports settable SLO targets and reports goodput, with the expected behavior defined before implementation.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- python
- Domain
- backend, distributed-systems, performance
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Quiet
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100