Completion Probabilities and Parallel Restart Strategies under an Imposed Deadline.
Let A be any fixed cut-off restart algorithm running in parallel on multiple processors. If the algorithm is only allowed to run for up to time D, then it is no longer guaranteed that a result can be found. In this case, the probability of finding a solution within the time D becomes a measure for t...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Public Library of Science (PLoS)
2016-01-01
|
| Series: | PLoS ONE |
| Online Access: | http://europepmc.org/articles/PMC5061357?pdf=render |