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.

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

investigate wait-free IO buffer handling #117

Open
spacejam opened this Issue Sep 6, 2017 · 2 comments

Comments

Projects
None yet
2 participants
@spacejam
Owner

spacejam commented Sep 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:

@spacejam spacejam added this to the performance milestone Sep 6, 2017

@jeehoonkang

This comment has been minimized.

Show comment
Hide comment
@jeehoonkang

jeehoonkang Sep 6, 2017

Contributor

I guess you may also be interested in A wait-free queue as fast as fetch-and-add :)

Contributor

jeehoonkang commented Sep 6, 2017

I guess you may also be interested in A wait-free queue as fast as fetch-and-add :)

@spacejam

This comment has been minimized.

Show comment
Hide comment
@spacejam

spacejam Sep 6, 2017

Owner

@jeehoonkang ahh very cool! I'll definitely check that out :)

Owner

spacejam commented Sep 6, 2017

@jeehoonkang ahh very cool! I'll definitely check that out :)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment