6 ms·
Unladen Swallow 2009Q3 Released with LLVM optimized Python
- mbrubeck 17y ago"2009Q3 uses up to 930% less memory than the 2009Q2 release." Does that math make sense in some way I'm not seeing?
- sparky 17y agoIt's unconventional, but 9.3x less memory can be seen in some sense as 1/9.3=10.7 percent as much memory. Not defending it, just trying to interpret :P
- sp332 17y agoYou can't have 9.3x less memory, either. You can have (1/9.3)x as much memory, or they could just say 10% as much or 90% less.
- iclelland 17y agoActually, it's 10.3x less memory (they've subtracted 1), so it's using 9.7% as much memory as the previous release. I would have said that 90.3% less than before, but maybe that's just me
- wisesage5001 17y agoFrom their benchmarks rietveld: $ ./perf.py -r -b rietveld --args "-j always," --track_memory ../q2/python ../q3/python Mem max: 575116.000 -> 55952.000: 927.87% smaller This 930% basically means that 2009Q3 can use as little as ~1/10 of the memory of 2009Q2.
- ErrantX 17y agoI never checked but I assumed it meant that the memory savings of Q3 compared to the savings of Q2 increased 930%
- simonw 17y agoIs it noticably faster than regular Python yet?
- sparky 17y agoTheir first release (2009Q1) consisted mostly of patches to mainlines CPython, which improved performance for everybody by roughly 10%. They've added about 10-15% performance on each of the last 2 releases in Unladen Swallow-specific code, but it's unclear (to me) how CPython performance has evolved over the last 6 months. They haven't compared explicitly since 2009Q1, which may or may not be revealing. From the release notes: Lowlights: * LLVM's JIT and other infrastructure needed more work than was expected. As a result, we did not have time to improve performance as much as we would have liked. * Memory usage is still 2-3x that of Python 2.6.1. However, there is more overhead that can be eliminated for the 2009Q4 release. The last 2 releases have been mostly building up infrastructure; hopefully most of that is behind them and they can work on getting the 5x performance they're after.
- bobbyi 17y agoDo you know whether those Q1 changes have actually been merged into CPython? Will they be coming in 2.7?
- kingkilr 17y agoYes, they have.
- bobbyi 17y agoI don't see mention of them in the changelog: http://docs.python.org/dev/whatsnew/2.7.html http://docs.python.org/dev/whatsnew/2.7.html
- kingkilr 17y agoNot all of them have been backported, but basically anything that says it's been contributed by Collin Winter or Jeffrey Yaskinn is something that's been backported.
- cool-RR 17y agoFirstly let me say I think this is a wonderful project and one of the most important Python projects I know. Something I noticed though, in the Project Plan page: http://code.google.com/p/unladen-swallow/wiki/ProjectPlan#2009_Q3_and_Beyond http://code.google.com/p/unladen-swallow/wiki/ProjectPlan#20... They state that one of the goals for "2009Q3 and beyond" is "to remove the GIL and fix the state of multithreading in Python." Which I think is an awesome and ambitious goal that I would find very useful as will many others. So I hoped the GIL thing would fall into the "2009Q3", but apparently it's in the "beyond" category. Anyway, they need to update that project plan.
- kingkilr 17y agoIf you head over to python-ideas there's actually some really good discussion about removing the GIL right now. Someone has proposed using CAS operations (which I know nothing about) to remove the fine grained locking that is needed under the refcounting GC without the GIL. In addition Antoine Pitrou has been working on a patch to make the GIL more performant on POSIX systems.
- sb 17y agojfyi: CAS is the abbreviation of Compare-And-Swap, which are dedicated native machine instructions that offer atomicity and therefore simplify locking.
- oz 17y agoThanks, I was wondering what Column Address Strobe had to do with interpreters
- cool-RR 17y agoFunny, I was wondering how a Computer Algebra System could help.
- scott_s 17y agoHmm. It doesn't really "simplify" locking. In does in the simple case of: lock(); ++value; unlock(); Where a lock is used to protect a single memory location, and the critical section is straight-line code. But when the critical section is more involved, CAS based algorithms become considerably more complicated. CAS based algorithms which do not require mutual exclusion are called "lock-free algorithms," and reasoning about them is hard. The wiki for it is a good start: http://en.wikipedia.org/wiki/Non-blocking_synchronization http://en.wikipedia.org/wiki/Non-blocking_synchronization And I'm going to go ahead and plug the work I've done in the area: http://people.cs.vt.edu/~scschnei/streamflow/ http://people.cs.vt.edu/~scschnei/streamflow/
- clopey 17y agoHas anyone got this working on Windows?
- deleted 17y ago[deleted]
- maksimka 17y agoWhat's the plan for Unladen Swallow to support py3k?