in reply to Re^8: Hockey Sticks
in thread Hockey Sticks
routinely attracts trolls
I won't ask you to define troll in this instance, but I do have a question.
Has anyone performed even rudimentary benchmarking of the various implementations of P6?
I'm still attracted to (what I remember of) the P6 syntax, but for the type of applications I mostly write -- generally cpu-bound -- cool syntax isn't sufficient justification for taking a 10x or even 5x performance hit over P5.
A simple benchmark -- as a minimalistic start I'd suggest: a) a non-trick, non-caching implementation of Ackermann; b) Stirling's series; c) the string handling benchmark from here; -- would give a somewhat real-world measurement of how the implementations are progressing from that point of view against P5, each other, and against themselves over time.
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
P6 benchmarks (was Re^10: Hockey Sticks)
by raiph (Deacon) on Jul 12, 2012 at 21:04 UTC | |
by BrowserUk (Patriarch) on Jul 12, 2012 at 21:31 UTC | |
by raiph (Deacon) on Jul 12, 2012 at 23:59 UTC |