Add experiment: Count the time for the each steal #10
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Esta medición es activada a través de una bandera booleana.
Cambia de linea actualización de indice del head utilizado en la estructura de datos. Si el hilo ladrón no encontraba algo que robar y no se actualizaba la estructura concurrente, este índice seguía avanzando hasta que causara un IndexOutOfBoundsException.
Merged
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Add an experiment to count the time done by each call to the steal method. This could be done using a flag to activate variables to keep to count of the time.
Once this is done, calculate the movil average, min and max of time in every execution for each algorithm of idempotent and of the work-stealing non-concurrent.