-
Notifications
You must be signed in to change notification settings - Fork 103
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
enumeration peformance #169
Comments
Hi Martin, I wasn't able to use the exact same code structure due to imbedding compatibility, Since the latest code completely uses recur enum, that is something we can now do. Also, -march=native might make some difference. -- Marc On July 26, 2016 12:03:53 PM GMT+02:00, Martin Albrecht notifications@github.com wrote:
-- sent from phone |
Thanks for explaining. Compiling with
I guess for the rest we leave this ticket open as a reminder that we should revisit enumeration at some point. |
BTW, the new enum code is now parrallelized, right ? Can we have this option on the command line ? |
No, it's not parallelised yet. |
No, fplll itself is thread-safe, but so far still has no framework for threads. It should be easy to add with c++11, but a choice for threads and mutexes and specifically a multi-threaded (lockfree) queue is a fplll-wide choice. On August 3, 2016 7:08:57 PM GMT+02:00, "Léo Ducas" notifications@github.com wrote:
Sent from my Android device with K-9 Mail. Please excuse my brevity. |
Running
python ./set_mdc.py
from https://github.com/fplll/strategizer produces an output stating that my system performs about 40 million enumerations per second. With @cr-marcstevens unpublished libenum (on which the new fplll code is based) I used to get something close to 60 million enumerations per second.libenum and old fplll
new fplll
Is that to be expected?
The text was updated successfully, but these errors were encountered: