search

anagainaru / iSBatch

Code to compute the optimal request time for applications submitted for execution using HPC batch schedulers
Other
0 stars 1 forks source link

[Possible bug] Sequence cost #89

Closed anagainaru closed 4 years ago

anagainaru commented 4 years ago

For truncnorm log with limited sequence at 2 submissions and Threshold based algorithm

Request sequence: [(13.203597933611121, 1), (0.13568750878573965, 0)]
Cost: 21.211713975375876

Request sequence: [(13.203597933611121, 0), (13.33928544239686, 0)]
Cost: 21.2381211712431

Difference between the sum and the max submission is 6.5e-16

anagainaru commented 4 years ago

The difference is correct. The second reservation pays the same or lower cost for submission (wait time) and lower price for the cpu time.