Skip to content

Max cost as a function of Time, Memory and Parallelism
Compare
Choose a tag to compare
@jdconley jdconley released this 13 Oct 17:36
· 13 commits to master since this release
1.1.0
b7f99a8
  • Include "hashCost" (TimeCost * MemoryCost * Parallelism) on the Timing result
  • Updated max cost based selector to use hashCost as first sort dimension, followed by compute time
  • No longer throwing an error if maxTimeMs is too low, instead returning the fastest timing
Assets 3
Loading