CFRAC - BSA++ (npa)
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
Allocator's configurations
- BSA++ (npa) 10 => BSA++ with no AS, no page allocatione (npa), popularity index threshold 10
- BSA++ (npa) 30 => BSA++ with no AS, no page allocatione (npa), popularity index threshold 30
- BSA++ (npa) 50 => BSA++ with no AS, no page allocatione (npa), popularity index threshold 50
- BSA++ (npa) 70 => BSA++ with no AS, no page allocatione (npa), popularity index threshold 70
- BSA++ (npa) 90 => BSA++ with no AS, no page allocatione (npa), popularity index threshold 90
Time
Space