Join GitHub today
GitHub is home to over 28 million developers working together to host and review code, manage projects, and build software together.
Sign upinvestigate wait-free IO buffer handling #117
Comments
spacejam
added this to the performance milestone
Sep 6, 2017
This comment has been minimized.
Show comment
Hide comment
This comment has been minimized.
Show comment
Hide comment
jeehoonkang
Sep 6, 2017
Contributor
I guess you may also be interested in A wait-free queue as fast as fetch-and-add :)
|
I guess you may also be interested in A wait-free queue as fast as fetch-and-add :) |
This comment has been minimized.
Show comment
Hide comment
This comment has been minimized.
Show comment
Hide comment
|
@jeehoonkang ahh very cool! I'll definitely check that out :) |
spacejam
added
the
performance
label
Sep 13, 2017
spacejam
added
the
experiment
label
Jan 4, 2018
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
spacejam commentedSep 6, 2017
Reserving a slot in an IO buffer is way too contentious right now, and we're spinning so much that a mutex would likely outperform our current approach. This is a great opportunity to evaluate the feasibility of wait-free algorithms. We may be able to attempt the "fast-path" first with a normal lock-free algorithm, falling back on a bounded-time wait-free backup to get the best of both worlds. Maybe not :) Let's find out!
reading list: