Tuesday, August 30, 2016

Randomly accessing n items in DRAM is O(n) in theory, but can behave more like O(n log n) in practice far beyond the limits of the cache heirarchy

http://ift.tt/1iQqRWI

Submitted August 30, 2016 at 02:28AM by corysama http://ift.tt/2bSm78n Check me out at http://ift.tt/1RyFBcs !
Posted by at
Labels: , , , ,

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)