baidu / baidu/bfs

recover problems

Open
#405 0 comments 0 reactions 0 assignees View on GitHub
bug optimization
Dominant language
C++
Stars
2.8k
Forks
551
PR merge metrics
No merged PRs in 30d

Description

- [x] Ns may oom if the recover list is too long
- [ ] When read/write load is heavy, recover process will become slow
- [ ] Blocks need to be recover are store in set, so Ns will always pick the ones with smaller block id
- [x] 突然有一大批需recover的话ns会oom
- [ ] 读写负载高的时候recover会很慢
- [ ] 要恢复的block在set里,每次都是顺序挑,导致一旦负载高,出现timeout check,前面的副本会被恢复N多次

Contributor guide

No contributing guide indexed for this repository

Research direction

No files, tests, or entry points are named. Start by tracing the recovery process and how pending blocks are stored and selected, then reproduce behavior under heavy read/write load and with a large recovery batch. Done means recovery avoids excess memory use, repeated recovery, timeouts, and severe slowdown.

Written by the indexing model from the issue text.

Assessment

Tech stack
cpp
Domain
distributed-systems
Issue type
Bug
Difficulty
4/5
Estimated time
3-5 days
Activity status
Stale
Clarity
Needs clarification
Newbie friendliness
25/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.