TimelyDataflow / TimelyDataflow/timely-dataflow
Flow control
Nobody has claimed this yet.
- Dominant language
- Rust
- Stars
- 3.6k
- Forks
- 293
- Avg merge
- 14h 46m
- Merged PRs (30d)
- 4
Description
I've been thinking about how to put a cap on max memory usage. I read your Faucet paper -- that looks really cool and relatively simple to implement.
Is there an example implementation of a batcher/probe I can refer to? I want to try to implement it.
More generally, do you think it's useful to expose Faucet as an operator (is that possible?) in the library itself? Or should that be separate?
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 reviewing the Faucet paper and the library's existing batcher and probe concepts. The issue asks whether to provide an example implementation and expose Faucet as an operator, but it names no files, tests, or concrete completion criteria.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- rust
- Domain
- distributed-systems
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100