-
Notifications
You must be signed in to change notification settings - Fork 5
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
Publish benchmark results #52
Comments
Thank you for the suggestion. At the moment, there isn't a dedicated webpage for benchmark results. However, you can refer to published papers that provide representative benchmark results for various reclamation schemes and data structures. I'd like to highlight two recent papers below: the first includes workloads involving reference counting schemes (e.g., CIRC and CDRC), and the second covers major manual schemes (e.g., EBR and HP). Please see the Experiment and Appendix sections.
We agree that a public website with official benchmark results is necessary. We are working on it and aim to publish the website by the end of this year. |
@powergee Question: May I consider https://github.com/kaist-cp/circ as a SotA algorithm/implementation? |
In the context of deferred reference counting schemes for unmanaged languages, I believe CIRC is the state-of-the-art, outperforming CDRC (the previous state-of-the-art) across overall workloads (see CIRC-EBR vs. CDRC-EBR in the second paper). |
Thank you for your response. From the user’s perspective, the most important and relevant point is that circ is the SotA, and the rest serves as reference material for study purposes. Summarizing benchmark results and publishing a web version would take time, so if you’re pressed for time, simply adding one line to the README like “Our current recommendation: https://github.com/kaist-cp/circ” along with a brief summary of how much faster it is compared to |
I’m curious about the details of this benchmark. Instead of running the benchmarks myself, it would be helpful if the benchmark results were published on a page (such as GitHub Pages or the KAIST-CP server) for easy access. If the results are already available and I’ve missed them, please let me know.
The text was updated successfully, but these errors were encountered: