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
Improve find-available.py by using multiprocessing library #49
Comments
I've been meaning to take a look at this. It sounds like a fun problem.
…On Mar 24, 2017 9:51 AM, "Will Foster" ***@***.***> wrote:
Currently bin/find-available.py does some heavy lifting of combinatorial
math to parse all machine schedules and return the first available
start/end dates and machines that are available based on the # of days and
# of machines and optionally the type of machines required.
It can sometimes take upwards of 15-20minutes to run. This is an RFE to
investigate and implement the Python processed-based threading interface
<https://docs.python.org/2/library/multiprocessing.html> to hopefully
dramatically increase the run times.
—
You are receiving this because you are subscribed to this thread.
Reply to this email directly, view it on GitHub
<#49>, or mute the
thread
<https://github.com/notifications/unsubscribe-auth/ASxq2c57Vc1gI2WFAbAnvdqj-WyGccqxks5ro8pkgaJpZM4MoR_H>
.
|
Hi @geekodour we'd love for more people to help us improve QUADs. What part of the setup are you having issues with? You can install it on a test machine or VM for example via: You can quickly setup a fully-functional QUADS sandbox with this script here: Our getting started docs are here: If you have problems with any of the above just let us know or ping |
Thankyou @sadsfae ! I am able to run quads nicely now. |
Hey @geekodour that's great news. I have created an issue for you to work on this here: One note: we don't do pull requests, we instead use Gerrit / Jenkins CI workflow. Take a look here to see how we accept patches and merging: https://github.com/redhat-performance/quads#contributing Once you submit a patchset it will run through our CI system and will show up here for review: https://review.gerrithub.io/#/q/project:redhat-performance/quads Typically Gerrit is better at code review and conversation once we've filed the issue on Github and you get used to it. |
Moving to a threaded model. I think there is still room here. This is a first stab. https://gist.github.com/jtaleric/436de1da825a3267621f62cbc3e05807 Change-Id: I419455bcdc8c59f41e1a953b14f19fd201d081e2
A merged improvement for this has been submitted here: |
This changes our previously used 08:00 UTC as a start time for provisioning to 22:00 UTC. related-to: #49 Change-Id: I8e5350ef737c3633199e5cbb501bb45a07106471
Currently
bin/find-available.py
does some heavy lifting of combinatorial math to parse all machine schedules and return the first available start/end dates and machines that are available based on the # of days and # of machines and optionally the type of machines required.It can sometimes take upwards of 15-20minutes to run. This is an RFE to investigate and implement the Python processed-based threading interface to hopefully dramatically reduce the run times.
The text was updated successfully, but these errors were encountered: