Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

doc: peering.rst, fix typo #10131

Merged
merged 1 commit into from Jul 15, 2016
Merged

doc: peering.rst, fix typo #10131

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Jump to
Jump to file
Failed to load files.
Diff view
Diff view
2 changes: 1 addition & 1 deletion doc/dev/peering.rst
View file
Open in desktop
Expand Up @@ -145,7 +145,7 @@ history of past maps to generate a set of *past intervals* to
determine which OSDs must be consulted before we can successfully
*peer*. The set of past intervals is bounded by *last epoch started*,
the most recent *past interval* for which we know *peering* completed.
The process by with an OSD discovers a PG exists in the first place is
The process by which an OSD discovers a PG exists in the first place is
by exchanging *PG info* messages, so the OSD always has some lower
bound on *last epoch started*.

Expand Down