oasisprotocol / oasisprotocol/oasis-core
Read/write set-aware transaction scheduler algorithm
Nobody has claimed this yet.
- Dominant language
- Go
- Stars
- 369
- Forks
- 151
- Avg merge
- 1d 3h
- Merged PRs (30d)
- 6
Description
The transaction scheduler needs a scheduling algorithm which takes read/write sets into account when scheduling into multiple compute committees.
Note that there is already a greedy commutative batching algorithm implemented in Git history, so it probably just needs to be ported to the new transaction scheduler algorithm interface.
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 with the transaction scheduler algorithm interface and inspect the greedy commutative batching algorithm in Git history. Determine how its read/write-set handling should be ported for scheduling across multiple compute committees, then verify that the resulting schedules respect those sets.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- go
- Domain
- blockchain, distributed-systems
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100