linkedin / linkedin/parseq

Time based batching aggregation

Open
#131 0 comments 0 reactions 0 assignees View on GitHub
Dominant language
Java
Stars
1.2k
Forks
268
PR merge metrics
No merged PRs in 30d

Description

Currently batching is using the following heuristic to decide when an aggregation action should be executed: aggregate all outstanding batchable tasks when plan queue is empty and there is no task that can make immediate progress. While this is intended behavior in many situations, sometimes different mechanism is required e.g. time based.
This task is to consider and implement time based batching aggregation.

Contributor guide

No contributing guide indexed for this repository

Research direction

Start by tracing the existing batching aggregation heuristic and the code paths that decide when aggregation runs. Review any related tests and determine the expected timing behavior, triggering conditions, and completion criteria before designing an implementation.

Written by the indexing model from the issue text.

Assessment

Tech stack
java
Domain
backend
Issue type
Feature
Difficulty
5/5
Estimated time
Over a week
Activity status
Stale
Clarity
Needs clarification
Newbie friendliness
25/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.