OUT-OF-DATE! Read http://shootout.alioth.debian.org/      

- all benchmarks - n-body fannkuch (deprecated) meteor-contest fasta spectral-norm reverse-complement mandelbrot k-nucleotide regex-dna pidigits chameneos-redux thread-ring binary-trees hello-world sum-file nsieve nsieve-bits partial-sums recursive - all languages - BASIC FreeBASIC C GNU gcc C++ GNU g++ CAL Clean D Digital Mars Eiffel SmartEiffel Forth bigForth Forth GNU GForth Groovy Icon Io Lisaac Mercury Nice Oberon-2 OO2C Pike Prolog SWI Prolog YAP Rebol SML MLton SML SML/NJ Tcl Zonnon Mono

÷ BASIC FreeBASIC C GNU gcc C++ GNU g++ CAL Clean D Digital Mars Eiffel SmartEiffel Forth bigForth Forth GNU GForth Groovy Icon Io Lisaac Mercury Nice Oberon-2 OO2C Pike Prolog SWI Prolog YAP Rebol SML MLton SML SML/NJ Tcl Zonnon Mono

 Step 1 : Are the CAL programs faster? At a glance.

This chart shows 3 comparisons - Time-used, Memory-used and Code-used ~ speed and size.

Each chart bar shows, for one unidentified benchmark, how much the fastest CAL program used compared to the fastest Zonnon Mono program.

Look at speed another way - look at a box plot of Time-used data.

 Step 2 : Are the CAL programs faster? Approximately.

This table shows 3 comparisons - Time-used, Memory-used and Code-used ~ speed and size.

Each table row shows, for one named benchmark, how much the fastest CAL program used compared to the fastest Zonnon Mono program.

CAL used what fraction? used how many times more?
Benchmark	Time	Memory	Code
n-body	1/2	3×	2×
nsieve	±	2×	2×

CAL used what fraction? used how many times more?
Time-used	|-	|---	25%	median	75%	---|	-|
(CPU secs)	1/2	1/2	1/2	±	±	±	±

± read the measurements and then read the program source code.

 Step 3 : Are the CAL programs faster? Measurements.

This table shows 5 measurements - CPU Time, Elapsed Time, Memory, Code and ≈ CPU Load ~ speed and size.

For each named benchmark, measurements of the fastest CAL program are shown for comparison against measurements of the fastest Zonnon Mono program.

Program Source Code	CPU secs	Elapsed secs	Memory KB	Code B	≈ CPU Load
n-body
CAL	20.93		14,364	2356
Zonnon Mono	34.61		5,168	1524
nsieve
CAL	2.56		17,784	751
Zonnon Mono	2.32		9,744	368
k-nucleotide
CAL	1.37		19,396	1688
	No program
reverse-complement
CAL	0.55		13,620	1643
	No program
mandelbrot
CAL	0.39		12,480	931
	No program
recursive
CAL	0.54		12,840	665
Zonnon Mono	Failed
fasta
CAL	0.87		13,144	1983
	No program
pidigits
CAL	1.66		18,460	751
	No program
binary-trees
CAL	0.67		14,784	736
	No program
regex-dna
CAL	3.25		32,072	1334
	No program
nsieve-bits
CAL	1.42		12,896	991
	No program
spectral-norm
CAL	0.77		12,724	907
	No program
partial-sums
CAL	0.56		13,660	699
Zonnon Mono	Failed

 Step 4 : Are there other CAL programs for these benchmarks?

Remember - those are just the fastest CAL and Zonnon Mono programs measured on this OS/machine. Check if there are other implementations of these benchmark programs for CAL.

BASIC FreeBASIC C GNU gcc C++ GNU g++ CAL Clean D Digital Mars Eiffel SmartEiffel Forth bigForth Forth GNU GForth Groovy Icon Io Lisaac Mercury Nice Oberon-2 OO2C Pike Prolog SWI Prolog YAP Rebol SML MLton SML SML/NJ Tcl Zonnon Mono

Maybe one of those other CAL programs is fastest on a different OS/machine.

 Step 5 : Are there other faster programs for these benchmarks?

Remember - those are just the fastest CAL and Zonnon Mono programs measured on this OS/machine. Check if there are faster implementations of these benchmark programs for other programming languages.

n-body fannkuch (deprecated) meteor-contest fasta spectral-norm reverse-complement mandelbrot k-nucleotide regex-dna pidigits chameneos-redux thread-ring binary-trees hello-world sum-file nsieve nsieve-bits partial-sums recursive

Maybe one of those other programs is fastest on a different OS/machine.

 CAL : lazy functional programming for jvm 

1.7.0

Home Page: Open Quark Framework featuring the CAL Language
The Java framework for lazy functional programming.

Download: Download

  Home   Conclusions   License   Help