[Python-Dev] Pie-thon benchmarks (original) (raw)
Guido van Rossum guido at python.org
Sun Dec 14 17:27:52 EST 2003
- Previous message: [Python-Dev] Pie-thon benchmarks
- Next message: [Python-Dev] Pie-thon benchmarks
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Regexes were out. As I remember the challenge was pure interpreter speed, so no dependence on IO or external modules. I'll go see if I can dig out the rules. (You might have 'em on disk if you save old presentations -- I'm pretty sure you had 'em up on the projector during the announcement (or if it was me I've lost 'em :))
I was worried I lost it when my laptop died, but I managed to save a copy. The rules for the benchmark are:
Live in front of OSCON audience
Using the same Pentium Linux box
Latest CVS version
Best of three runs
Python 2.3 bytecode
Bytecode transformations OK
To be decided by the Python folks
Bytecode frozen in December 2003
Should run for at least 30 seconds
Output must be verifiably correct
Full builtins OK
No input or files (static data OK)
No use of extension modules
No use of regular expressions
--Guido van Rossum (home page: http://www.python.org/~guido/)
- Previous message: [Python-Dev] Pie-thon benchmarks
- Next message: [Python-Dev] Pie-thon benchmarks
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]