Better Retry-After times for async aggregation
Nobody has claimed this yet.
- Dominant language
- Rust
- Stars
- 70
- Forks
- 16
- Avg merge
- 4h 36m
- Merged PRs (30d)
- 30
Description
PR #3630 implements async aggregation on the helper, but does not set the Retry-After header when responding with "processing". Doing so could help reduce polling overhead, if we can come up with a good estimate of asynchronous processing time. We could start with configuration, and suggest a small multiple of the aggregation job driver poll time, or we could do some self-monitoring of processing latency.
Contributor guide
No contributing guide indexed for this repository
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 reading PR #3630 and the async aggregation helper's processing response. Compare the configuration-based estimate with self-monitoring of processing latency, including the aggregation job driver poll time; done means agreeing on an approach and setting an appropriate Retry-After header.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- rust
- Domain
- api, distributed-systems
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 30/100