⚡ Bolt: Optimize task concurrency with sliding window in ProcessMemoryScanner

[acebytes]

💡 What: Replaced the static chunking approach in ProcessMemoryScanner.scanPIDs with a sliding window withTaskGroup utilizing an iterator.
🎯 Why: Static array chunking introduces tail latency. During execution, the current block of tasks must fully complete before the next block begins, causing the thread pool to partially idle while waiting for the single slowest task in a chunk. A sliding window continually replaces completed tasks, maximizing parallel throughput.
📊 Impact: Increases throughput by eliminating tail latency. proc_pid_rusage system call processing is heavily I/O and kernel-bound. This allows the scanner to maintain exactly maxConcurrency tasks at all times.
🔬 Measurement: N/A (Local testing unavailable on the sandbox).

---

PR created automatically by Jules for task 11378523479788446431 started by @acebytes

[google-labs-jules]

👋 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 @jules. You can find this option in the Pull Request section of your global Jules UI settings. You can always switch back!

New to Jules? Learn more at jules.google/docs.

---

For security, I will only act on instructions from the user who triggered this task.