diff --git a/.jules/bolt.md b/.jules/bolt.md new file mode 100644 index 0000000..c7dc04d --- /dev/null +++ b/.jules/bolt.md @@ -0,0 +1,3 @@ +## 2026-04-05 - Optimize ProcessMemoryScanner concurrency with sliding window +**Learning:** In Swift structured concurrency, when processing high-volume tasks using `withTaskGroup`, static chunking limits throughput due to tail latency (waiting for the slowest task in a chunk). A sliding window with an iterator maintains maximum concurrent execution limits continuously. +**Action:** Always use an iterator-based sliding window in `withTaskGroup` instead of static chunking for processing large collections to avoid tail latency bottlenecks. diff --git a/Sources/Cacheout/Memory/ProcessMemoryScanner.swift b/Sources/Cacheout/Memory/ProcessMemoryScanner.swift index 3f8e728..b653d4a 100644 --- a/Sources/Cacheout/Memory/ProcessMemoryScanner.swift +++ b/Sources/Cacheout/Memory/ProcessMemoryScanner.swift @@ -97,29 +97,35 @@ actor ProcessMemoryScanner { /// /// Returns the collected entries and the count of EPERM failures. private func scanPIDs(_ pids: [pid_t]) async -> (entries: [ProcessEntryDTO], epermCount: Int) { - // Chunk PIDs to cap concurrency at maxConcurrency. - let chunks = stride(from: 0, to: pids.count, by: maxConcurrency).map { - Array(pids[$0..