From: Nikodemus S. <de...@us...> - 2008-03-03 19:34:23
|
Update of /cvsroot/sbcl/sbcl In directory sc8-pr-cvs8.sourceforge.net:/tmp/cvs-serv18072 Modified Files: version.lisp-expr Log Message: 1.0.15.12: better scaling in the PCL cache * When the cache reaches its maximum size, and entries need to be dropped, drop a random 50% of them, instead of the more deterministic set "ones that don't fit": this avoids getting stuck in a "add A dropping B, add B dropping A, ..." cycle which eats up ginormous amounts of time. Additionally, dropping 50% seems to be the best ratio -- experimentally, at least -- but it would be nice to have a proper analysis... Note: there is a point (possibly even before our current maximum cache size) where the allowed probe-depth grows so large that a tree would work better then a table. It would be good to gracefully replace the table based cache with a tree when it grows so large. Index: version.lisp-expr =================================================================== RCS file: /cvsroot/sbcl/sbcl/version.lisp-expr,v retrieving revision 1.3882 retrieving revision 1.3883 diff -u -d -r1.3882 -r1.3883 --- version.lisp-expr 3 Mar 2008 15:13:04 -0000 1.3882 +++ version.lisp-expr 3 Mar 2008 19:34:18 -0000 1.3883 @@ -17,4 +17,4 @@ ;;; checkins which aren't released. (And occasionally for internal ;;; versions, especially for internal versions off the main CVS ;;; branch, it gets hairier, e.g. "0.pre7.14.flaky4.13".) -"1.0.15.11" +"1.0.15.12" |