25th August 2008, 1 min read If you claim high scalability… 2 thoughts on “If you claim high scalability…” D. Eppstein says: August 25, 2008 at 3:38 pm Their algorithm runs in O(n) time, so to know how long it would take to process 1000 times more data, just multiply by 1000. Is that even true? It ignores memory hierarchy effects. Kevembuangga says: August 26, 2008 at 2:22 am But where is the fun in that? What do you mean? Not trusting a “proof” over only 2000 datapoints?
Their algorithm runs in O(n) time, so to know how long it would take to process 1000 times more data, just multiply by 1000.
Is that even true? It ignores memory hierarchy effects.
But where is the fun in that?
What do you mean?
Not trusting a “proof” over only 2000 datapoints?