David Beazley <d...@dabeaz.com> added the comment: I'm not trying to be a pain here, but do you have any explanation as to why, with fair scheduling, the observed execution time of multiple CPU-bound threads is substantially worse than with unfair scheduling?
>From your own benchmarks, consider this result (Fair scheduling) Treaded, balanced execution: fast A: 0.973000 (0 left) fast C: 0.992000 (0 left) fast B: 1.013000 (0 left) Versus this result with unfair scheduling: Treaded, balanced execution: fast A: 0.362000 (0 left) fast B: 0.464000 (0 left) fast C: 0.549000 (0 left) If I'm reading this right, it takes the three threads with fair locking almost twice as long to complete (1.01s) as the three threads with unfair locking (0.55s) . If so, why would I want fair locking? Wouldn't I want the solution that offers the fastest overall execution time? ---------- _______________________________________ Python tracker <rep...@bugs.python.org> <http://bugs.python.org/issue8299> _______________________________________ _______________________________________________ Python-bugs-list mailing list Unsubscribe: http://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
