CFRAC - BSA++ VAR AS

The continued fraction factorization method (CFRAC) is an integer factorization algorithm. It is a general-purpose algorithm, meaning that it is suitable for factoring any integer n, not depending on special form or properties. It was described by D. H. Lehmer and R. E. Powers in 1931, and developed as a computer algorithm by Michael A. Morrison and John Brillhart in 1975. Implementation used was the same published with allocator Hoard.

Inputs and trace's reports

We collect 5 traces of CFRAC's allocation when invocated with these inputs (in order of complexity):
  1. 23533 => report input 1
  2. 1000000001930000000057 => report input 2
  3. 327905606740421458831903 => report input 3
  4. 4175764634412486014593803028771 => report input 4
  5. 41757646344123832613190542166099121 => report input 5
You can find all MallocLab's traces for CFRAC here.

Allocator's configurations

  1. BSA++ VAR AS 115 => BSA++ with AS, popularity index threshold >= 15, variance popularity threshold 115
  2. BSA++ VAR AS 230 => BSA++ with AS, popularity index threshold >= 15, variance popularity threshold 230
  3. BSA++ VAR AS 345 => BSA++ with AS, popularity index threshold >= 15, variance popularity threshold 345
  4. BSA++ VAR AS 460 => BSA++ with AS, popularity index threshold >= 15, variance popularity threshold 460
  5. BSA++ VAR AS 575 => BSA++ with AS, popularity index threshold >= 15, variance popularity threshold 575
  6. BSA++ VAR AS 690 => BSA++ with AS, popularity index threshold >= 15, variance popularity threshold 690
  7. BSA++ VAR AS 805 => BSA++ with AS, popularity index threshold >= 15, variance popularity threshold 805
  8. BSA++ VAR AS 920 => BSA++ with AS, popularity index threshold >= 15, variance popularity threshold 920

Time

Space

Return to the program's overview Return to the main page