⚡ Bolt: Sliding window concurrency for process scanning#96
⚡ Bolt: Sliding window concurrency for process scanning#96
Conversation
Replaced the static chunking in `ProcessMemoryScanner.scanPIDs` with a sliding window approach using an iterator inside `withTaskGroup`. This continuous task spawning prevents tail latency and maximizes throughput. Co-authored-by: acebytes <2820910+acebytes@users.noreply.github.com>
|
👋 Jules, reporting for duty! I'm here to lend a hand with this pull request. When you start a review, I'll add a 👀 emoji to each comment to let you know I've read it. I'll focus on feedback directed at me and will do my best to stay out of conversations between you and other bots or reviewers to keep the noise down. I'll push a commit with your requested changes shortly after. Please note there might be a delay between these steps, but rest assured I'm on the job! For more direct control, you can switch me to Reactive Mode. When this mode is on, I will only act on comments where you specifically mention me with New to Jules? Learn more at jules.google/docs. For security, I will only act on instructions from the user who triggered this task. |
💡 What
Replaced static chunking in
ProcessMemoryScanner.scanPIDswith a sliding window approach.🎯 Why
In Swift structured concurrency, static chunking inside a
withTaskGroup(waiting for an entire batch to finish before starting the next) introduces tail latency. If one task in the chunk takes longer, no new tasks are started until it finishes. A sliding window with an iterator maintains the maximum concurrent execution limit continuously.📊 Impact
Improves throughput for process scanning by eliminating idle waiting periods, ensuring that exactly
maxConcurrencytasks are running as long as there are PIDs left to process.🔬 Measurement
Run
ProcessMemoryScanner.scanon a system with a large number of processes and observe the total execution time, which should be lower and more consistent.PR created automatically by Jules for task 7920344016744599189 started by @acebytes