sharkdp/fd

scatter search targets of threads to optimize search across multiple devices

Open

#559 建立於 2020年4月6日

在 GitHub 查看
 (9 留言) (0 反應) (0 負責人)Rust (42,984 star) (1,059 fork)batch import
feature-requesthelp wantedperformance

描述

when searching across multiple devices, cpu utilization is rarely the bottleneck but rather io is.

an option to scatter the search targets of threads would speed up search massively when searching in /media/ for example across multiple external harddrives.

they may share a data link but its their latency and responsiveness that is the bottleneck. and can be exercised in parallel.

貢獻者指南

技術棧
rust
領域
cliperformance
議題類型
feature
難度面向新貢獻者的預計實作難度，1 表示很小改動，5 表示專家級工作。
3
預計時間有經驗貢獻者完成調查、實作、測試並準備 pull request 的粗略時間範圍。
1-2 days
活動狀態議題目前的可參與程度：新鮮、活躍、陳舊、阻塞或等待維護者輸入。
stale
清晰度議題是否清楚說明預期改動、驗收標準和下一步。
needs investigation
前置要求
Rustasync I/O
新手友善度1-100 的估計分數，表示該議題對首次貢獻者的友善程度。
30
研究方向
The issue proposes scattering search targets across threads to improve I/O parallelism when searching multiple drives. To implement, investigate the current threading model in the fd codebase, likely in src/worker.rs or similar. Consider using async I/O or a thread pool for I/O bound tasks. The discussion in the issue may provide additional context; look for comments suggesting design alternatives.