CFRAC
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 => Original BSA with page allocation and alternate split side (AS)
- TLSF => Two Level Segregate allocator
- BSA-- => BSA with no split or coalesce and no AS
- BSA++ 10 => BSA++ with no AS, popularity index threshold 10
- BSA++ (npa) 10 => BSA++ with no AS, no page allocatione (npa), popularity index threshold 10
- BSA++ AS 10 => BSA++ with AS, popularity index threshold 10
- BSA++ AVG 10 => BSA++ with no AS, average popularity threshold 10
- BSA++ AVG (npa) 10 => BSA++ with no AS, npa, average popularity threshold 10
- BSA++ AS AVG 10 => BSA++ with AS, npa, average popularity threshold 10
- BSA++ VAR 345 => BSA++ with no AS, popularity index threshold >= 15, variance popularity threshold 345
- BSA++ VAR (npa) 805 => BSA++ with no AS, npa, popularity index threshold >= 15, variance popularity threshold 805
- BSA++ VAR AS 920 => BSA++ with AS, popularity index threshold >= 15, variance popularity threshold 920
Some of these allocators have been tested with different threshold:
In this page we show only the
winner for each type of
allocator's configuration. Read
BSA
or
BSA++
description in order to understand all features listed above.
Time
Space