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.

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

Better time resolution for cheap functions #7

Closed
yuyichao opened this issue May 14, 2016 · 1 comment
Closed

Better time resolution for cheap functions #7

yuyichao opened this issue May 14, 2016 · 1 comment

Comments

@yuyichao
Copy link
Contributor

Right now the resolution of the result seems to be limited to 1ns. This should be enough for expensive benchmarks but could be improved with averaging and may not be enough for benchmarking cheap operations that only takes a few ns.

I encounter these situations mainly when benchmarking low level operations. E.g. in JuliaLang/julia#16174, where the optimized version of g2 takes only 1.2ns per loop. It would be nice if I don't have to write my own loops for these.

@jrevels
Copy link
Member

jrevels commented Jan 31, 2017

This was closed by #23 a long time ago

@jrevels jrevels closed this as completed Jan 31, 2017
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging a pull request may close this issue.

2 participants