From 96625d165778cb81d4141d55bb5392c311a4b3fc Mon Sep 17 00:00:00 2001 From: Abdulaziz Ghuloum Date: Tue, 25 Dec 2007 05:03:41 -0500 Subject: [PATCH] benchmarks were getting stale, many were not runnable. all updated. a fresh benchmark run was taken. --- benchmarks/benchall.ss | 4 +- benchmarks/rnrs-benchmarks.ss | 7 +- benchmarks/rnrs-benchmarks/browse.ss | 1 + benchmarks/rnrs-benchmarks/cat.ss | 6 +- benchmarks/rnrs-benchmarks/compiler.ss | 6 +- benchmarks/rnrs-benchmarks/destruc.ss | 1 + benchmarks/rnrs-benchmarks/fft.ss | 2 +- benchmarks/rnrs-benchmarks/gcbench.ss | 2 +- benchmarks/rnrs-benchmarks/gcold.ss | 2 +- benchmarks/rnrs-benchmarks/matrix.ss | 2 +- benchmarks/rnrs-benchmarks/maze.ss | 2 +- benchmarks/rnrs-benchmarks/mazefun.ss | 2 +- benchmarks/rnrs-benchmarks/mbrot.ss | 2 +- benchmarks/rnrs-benchmarks/nbody.ss | 1 + benchmarks/rnrs-benchmarks/paraffins.ss | 2 +- benchmarks/rnrs-benchmarks/parsing.ss | 2 +- benchmarks/rnrs-benchmarks/perm9.ss | 2 +- benchmarks/rnrs-benchmarks/pi.ss | 2 +- benchmarks/rnrs-benchmarks/primes.ss | 2 +- benchmarks/rnrs-benchmarks/quicksort.ss | 6 +- benchmarks/rnrs-benchmarks/ray.ss | 2 +- benchmarks/rnrs-benchmarks/scheme.ss | 5 +- benchmarks/rnrs-benchmarks/slatex.ss | 1 + benchmarks/rnrs-benchmarks/string.ss | 2 +- benchmarks/rnrs-benchmarks/tail.ss | 6 +- benchmarks/rnrs-benchmarks/trav1.ss | 2 +- benchmarks/rnrs-benchmarks/trav2.ss | 2 +- benchmarks/timelog | 493 ++++++++++++++++++------ 28 files changed, 428 insertions(+), 141 deletions(-) diff --git a/benchmarks/benchall.ss b/benchmarks/benchall.ss index 2d17542..d079b63 100755 --- a/benchmarks/benchall.ss +++ b/benchmarks/benchall.ss @@ -17,11 +17,11 @@ (for-each (lambda (x) - (fprintf (standard-error-port) "running ~s\n" x) + (fprintf (current-error-port) "running ~s\n" x) (for-each (lambda (_) (unless (zero? (system (format cmd x))) - (fprintf (standard-error-port) "ERROR: ~s failed\n" x))) + (fprintf (current-error-port) "ERROR: ~s failed\n" x))) (make-list 5))) all-benchmarks) diff --git a/benchmarks/rnrs-benchmarks.ss b/benchmarks/rnrs-benchmarks.ss index 371de14..df30a4c 100644 --- a/benchmarks/rnrs-benchmarks.ss +++ b/benchmarks/rnrs-benchmarks.ss @@ -68,7 +68,12 @@ (define call-with-output-file/truncate (lambda (file-name proc) - (call-with-output-file file-name proc 'truncate))) + (let ([p (open-file-output-port + file-name + (file-options no-fail) + 'block + (native-transcoder))]) + (call-with-port p proc)))) (define-syntax include-source (lambda (x) diff --git a/benchmarks/rnrs-benchmarks/browse.ss b/benchmarks/rnrs-benchmarks/browse.ss index 78173cb..e071da9 100644 --- a/benchmarks/rnrs-benchmarks/browse.ss +++ b/benchmarks/rnrs-benchmarks/browse.ss @@ -4,6 +4,7 @@ (library (rnrs-benchmarks browse) (export main) (import (rnrs) + (rnrs r5rs) (rnrs mutable-pairs) (rnrs-benchmarks)) diff --git a/benchmarks/rnrs-benchmarks/cat.ss b/benchmarks/rnrs-benchmarks/cat.ss index 0be61fd..a557683 100644 --- a/benchmarks/rnrs-benchmarks/cat.ss +++ b/benchmarks/rnrs-benchmarks/cat.ss @@ -17,7 +17,11 @@ (define (go) (set! inport (open-input-file "bib")) - (set! outport (open-output-file "foo")) + (set! outport + (open-file-output-port "foo" + (file-options no-fail) + 'block + (native-transcoder))) (catport inport) (close-input-port inport)) diff --git a/benchmarks/rnrs-benchmarks/compiler.ss b/benchmarks/rnrs-benchmarks/compiler.ss index 54e4ab1..506fadc 100644 --- a/benchmarks/rnrs-benchmarks/compiler.ss +++ b/benchmarks/rnrs-benchmarks/compiler.ss @@ -2,7 +2,11 @@ ;(define char->integer char->ascii) (library (rnrs-benchmarks compiler) (export main) - (import (rnrs) (rnrs mutable-pairs) (rnrs-benchmarks)) + (import (rnrs) + (rnrs r5rs) + (rnrs mutable-pairs) + (rnrs mutable-strings) + (rnrs-benchmarks)) (define open-input-file* open-input-file) (define (pp-expression expr port) (write expr port) (newline port)) diff --git a/benchmarks/rnrs-benchmarks/destruc.ss b/benchmarks/rnrs-benchmarks/destruc.ss index 8f92b97..83d7441 100644 --- a/benchmarks/rnrs-benchmarks/destruc.ss +++ b/benchmarks/rnrs-benchmarks/destruc.ss @@ -4,6 +4,7 @@ (export main) (import (rnrs) (rnrs mutable-pairs) + (rnrs r5rs) (rnrs-benchmarks)) (define (append-to-tail! x y) diff --git a/benchmarks/rnrs-benchmarks/fft.ss b/benchmarks/rnrs-benchmarks/fft.ss index ebdcd53..f024254 100644 --- a/benchmarks/rnrs-benchmarks/fft.ss +++ b/benchmarks/rnrs-benchmarks/fft.ss @@ -2,7 +2,7 @@ (library (rnrs-benchmarks fft) (export main) - (import (rnrs) (rnrs arithmetic flonums) (rnrs-benchmarks)) + (import (rnrs) (rnrs r5rs) (rnrs arithmetic flonums) (rnrs-benchmarks)) ;(define flsin sin) diff --git a/benchmarks/rnrs-benchmarks/gcbench.ss b/benchmarks/rnrs-benchmarks/gcbench.ss index 7939428..88dac1e 100644 --- a/benchmarks/rnrs-benchmarks/gcbench.ss +++ b/benchmarks/rnrs-benchmarks/gcbench.ss @@ -35,7 +35,7 @@ (library (rnrs-benchmarks gcbench) (export main) - (import (rnrs) (rnrs arithmetic flonums) (rnrs-benchmarks)) + (import (rnrs) (rnrs r5rs) (rnrs arithmetic flonums) (rnrs-benchmarks)) (define (run-benchmark2 name thunk) (display name) diff --git a/benchmarks/rnrs-benchmarks/gcold.ss b/benchmarks/rnrs-benchmarks/gcold.ss index e0995a4..9031370 100644 --- a/benchmarks/rnrs-benchmarks/gcold.ss +++ b/benchmarks/rnrs-benchmarks/gcold.ss @@ -10,7 +10,7 @@ (library (rnrs-benchmarks gcold) (export main) - (import (rnrs) (rnrs-benchmarks)) + (import (rnrs) (rnrs r5rs) (rnrs-benchmarks)) (define (newRandom) (letrec ((random14 diff --git a/benchmarks/rnrs-benchmarks/matrix.ss b/benchmarks/rnrs-benchmarks/matrix.ss index e9f3d50..e07cf8c 100644 --- a/benchmarks/rnrs-benchmarks/matrix.ss +++ b/benchmarks/rnrs-benchmarks/matrix.ss @@ -2,7 +2,7 @@ (library (rnrs-benchmarks matrix) (export main) - (import (rnrs) (rnrs mutable-pairs) (rnrs-benchmarks)) + (import (rnrs) (rnrs r5rs) (rnrs mutable-pairs) (rnrs-benchmarks)) ; Chez-Scheme compatibility stuff: (define (chez-box x) (cons x '())) diff --git a/benchmarks/rnrs-benchmarks/maze.ss b/benchmarks/rnrs-benchmarks/maze.ss index c562993..a79eb04 100644 --- a/benchmarks/rnrs-benchmarks/maze.ss +++ b/benchmarks/rnrs-benchmarks/maze.ss @@ -12,7 +12,7 @@ (library (rnrs-benchmarks maze) (export main) - (import (rnrs) (rnrs mutable-pairs) (rnrs-benchmarks)) + (import (rnrs) (rnrs r5rs) (rnrs mutable-pairs) (rnrs-benchmarks)) (define (random-state n) (cons n #f)) diff --git a/benchmarks/rnrs-benchmarks/mazefun.ss b/benchmarks/rnrs-benchmarks/mazefun.ss index 5cf56ce..b9aef22 100644 --- a/benchmarks/rnrs-benchmarks/mazefun.ss +++ b/benchmarks/rnrs-benchmarks/mazefun.ss @@ -3,7 +3,7 @@ (library (rnrs-benchmarks mazefun) (export main) - (import (rnrs) (rnrs-benchmarks)) + (import (rnrs) (rnrs r5rs) (rnrs-benchmarks)) (define foldr (lambda (f base lst) diff --git a/benchmarks/rnrs-benchmarks/mbrot.ss b/benchmarks/rnrs-benchmarks/mbrot.ss index 576c422..4c3d2f3 100644 --- a/benchmarks/rnrs-benchmarks/mbrot.ss +++ b/benchmarks/rnrs-benchmarks/mbrot.ss @@ -2,7 +2,7 @@ (library (rnrs-benchmarks mbrot) (export main) - (import (rnrs) (rnrs arithmetic flonums) (rnrs-benchmarks)) + (import (rnrs) (rnrs r5rs) (rnrs arithmetic flonums) (rnrs-benchmarks)) (define (count r i step x y) diff --git a/benchmarks/rnrs-benchmarks/nbody.ss b/benchmarks/rnrs-benchmarks/nbody.ss index 1023a41..4b9524c 100644 --- a/benchmarks/rnrs-benchmarks/nbody.ss +++ b/benchmarks/rnrs-benchmarks/nbody.ss @@ -9,6 +9,7 @@ (import (rnrs) (rnrs arithmetic flonums) + (rnrs r5rs) (rnrs mutable-pairs) (rnrs-benchmarks)) diff --git a/benchmarks/rnrs-benchmarks/paraffins.ss b/benchmarks/rnrs-benchmarks/paraffins.ss index 25decec..51af094 100644 --- a/benchmarks/rnrs-benchmarks/paraffins.ss +++ b/benchmarks/rnrs-benchmarks/paraffins.ss @@ -2,7 +2,7 @@ (library (rnrs-benchmarks paraffins) (export main) - (import (rnrs) (rnrs-benchmarks)) + (import (rnrs) (rnrs r5rs) (rnrs-benchmarks)) (define (gen n) (let* ((n/2 (quotient n 2)) diff --git a/benchmarks/rnrs-benchmarks/parsing.ss b/benchmarks/rnrs-benchmarks/parsing.ss index dac880d..d7eb336 100644 --- a/benchmarks/rnrs-benchmarks/parsing.ss +++ b/benchmarks/rnrs-benchmarks/parsing.ss @@ -22,7 +22,7 @@ (library (rnrs-benchmarks parsing) (export main) - (import (rnrs) (rnrs-benchmarks)) + (import (rnrs) (rnrs mutable-strings) (rnrs-benchmarks)) (define (parsing-benchmark . rest) (let* ((n (if (null? rest) 1000 (car rest))) diff --git a/benchmarks/rnrs-benchmarks/perm9.ss b/benchmarks/rnrs-benchmarks/perm9.ss index a97cf83..9dd8ac2 100644 --- a/benchmarks/rnrs-benchmarks/perm9.ss +++ b/benchmarks/rnrs-benchmarks/perm9.ss @@ -35,7 +35,7 @@ (library (rnrs-benchmarks perm9) (export main) - (import (rnrs) (rnrs-benchmarks)) + (import (rnrs) (rnrs r5rs) (rnrs-benchmarks)) ; Procedure P_n generates a grey code of all perms of n elements ; on top of stack ending with reversal of starting sequence diff --git a/benchmarks/rnrs-benchmarks/pi.ss b/benchmarks/rnrs-benchmarks/pi.ss index c512a5f..86b961e 100644 --- a/benchmarks/rnrs-benchmarks/pi.ss +++ b/benchmarks/rnrs-benchmarks/pi.ss @@ -4,7 +4,7 @@ (library (rnrs-benchmarks pi) (export main) - (import (rnrs) (rnrs-benchmarks)) + (import (rnrs) (rnrs r5rs) (rnrs-benchmarks)) ; Utilities. diff --git a/benchmarks/rnrs-benchmarks/primes.ss b/benchmarks/rnrs-benchmarks/primes.ss index 4808d9c..17c4e77 100644 --- a/benchmarks/rnrs-benchmarks/primes.ss +++ b/benchmarks/rnrs-benchmarks/primes.ss @@ -2,7 +2,7 @@ (library (rnrs-benchmarks primes) (export main) - (import (rnrs) (rnrs-benchmarks)) + (import (rnrs) (rnrs r5rs) (rnrs-benchmarks)) (define (interval-list m n) (if (> m n) diff --git a/benchmarks/rnrs-benchmarks/quicksort.ss b/benchmarks/rnrs-benchmarks/quicksort.ss index 3bc0720..be9e189 100644 --- a/benchmarks/rnrs-benchmarks/quicksort.ss +++ b/benchmarks/rnrs-benchmarks/quicksort.ss @@ -3,7 +3,11 @@ (library (rnrs-benchmarks quicksort) (export main) - (import (except (rnrs) partition) (rnrs mutable-pairs) (rnrs-benchmarks)) + (import + (except (rnrs) partition) + (rnrs r5rs) + (rnrs mutable-pairs) + (rnrs-benchmarks)) (define (quick-1 v less?) diff --git a/benchmarks/rnrs-benchmarks/ray.ss b/benchmarks/rnrs-benchmarks/ray.ss index 86d6e41..fc4a85f 100644 --- a/benchmarks/rnrs-benchmarks/ray.ss +++ b/benchmarks/rnrs-benchmarks/ray.ss @@ -3,7 +3,7 @@ (library (rnrs-benchmarks ray) (export main) - (import (rnrs) (rnrs arithmetic flonums) (rnrs-benchmarks)) + (import (rnrs) (rnrs r5rs) (rnrs arithmetic flonums) (rnrs-benchmarks)) (define (make-point x y z) (vector x y z)) diff --git a/benchmarks/rnrs-benchmarks/scheme.ss b/benchmarks/rnrs-benchmarks/scheme.ss index 445e597..e2526de 100644 --- a/benchmarks/rnrs-benchmarks/scheme.ss +++ b/benchmarks/rnrs-benchmarks/scheme.ss @@ -4,7 +4,10 @@ (library (rnrs-benchmarks scheme) (export main) - (import (rnrs) (rnrs mutable-pairs) (rnrs-benchmarks)) + (import (rnrs) (rnrs r5rs) + (rnrs mutable-pairs) + (rnrs mutable-strings) + (rnrs-benchmarks)) (define (scheme-eval expr) (let ((code (scheme-comp expr scheme-global-environment))) diff --git a/benchmarks/rnrs-benchmarks/slatex.ss b/benchmarks/rnrs-benchmarks/slatex.ss index 0c1ab40..17c28c7 100644 --- a/benchmarks/rnrs-benchmarks/slatex.ss +++ b/benchmarks/rnrs-benchmarks/slatex.ss @@ -10,6 +10,7 @@ (rnrs) (rnrs unicode) (rnrs mutable-pairs) + (rnrs mutable-strings) (rnrs io simple) (rnrs-benchmarks)) diff --git a/benchmarks/rnrs-benchmarks/string.ss b/benchmarks/rnrs-benchmarks/string.ss index d5a190a..ea78ea7 100644 --- a/benchmarks/rnrs-benchmarks/string.ss +++ b/benchmarks/rnrs-benchmarks/string.ss @@ -2,7 +2,7 @@ (library (rnrs-benchmarks string) (export main) - (import (rnrs) (rnrs-benchmarks)) + (import (rnrs) (rnrs r5rs) (rnrs-benchmarks)) (define s "abcdef") diff --git a/benchmarks/rnrs-benchmarks/tail.ss b/benchmarks/rnrs-benchmarks/tail.ss index 313e918..4cf0c71 100644 --- a/benchmarks/rnrs-benchmarks/tail.ss +++ b/benchmarks/rnrs-benchmarks/tail.ss @@ -29,7 +29,11 @@ (define (go) (set! inport (open-input-file "bib")) - (set! outport (open-output-file "foo")) + (set! outport + (open-file-output-port "foo" + (file-options no-fail) + 'block + (native-transcoder))) (tail-r inport) (close-input-port inport)) diff --git a/benchmarks/rnrs-benchmarks/trav1.ss b/benchmarks/rnrs-benchmarks/trav1.ss index f54cde5..bf9d022 100644 --- a/benchmarks/rnrs-benchmarks/trav1.ss +++ b/benchmarks/rnrs-benchmarks/trav1.ss @@ -2,7 +2,7 @@ (library (rnrs-benchmarks trav1) (export main) - (import (rnrs) (rnrs mutable-pairs) (rnrs-benchmarks)) + (import (rnrs) (rnrs r5rs) (rnrs mutable-pairs) (rnrs-benchmarks)) (define (make-node) (vector 'node '() '() (snb) #f #f #f #f #f #f #f)) diff --git a/benchmarks/rnrs-benchmarks/trav2.ss b/benchmarks/rnrs-benchmarks/trav2.ss index 8b977ea..81fc21f 100644 --- a/benchmarks/rnrs-benchmarks/trav2.ss +++ b/benchmarks/rnrs-benchmarks/trav2.ss @@ -2,7 +2,7 @@ (library (rnrs-benchmarks trav2) (export main) - (import (rnrs) (rnrs mutable-pairs) (rnrs-benchmarks)) + (import (rnrs) (rnrs r5rs) (rnrs mutable-pairs) (rnrs-benchmarks)) (define (make-node) (vector 'node '() '() (snb) #f #f #f #f #f #f #f)) diff --git a/benchmarks/timelog b/benchmarks/timelog index eff5a6b..aa53731 100644 --- a/benchmarks/timelog +++ b/benchmarks/timelog @@ -36589,120 +36589,379 @@ running stats for wc (15): 2036 ms elapsed cpu time, including 0 ms collecting 2036 ms elapsed real time, including 0 ms collecting 194208 bytes allocated -NOW: 2007-11-23 20:24:27 -running stats for compile-ack: - 1 collection - 51 ms elapsed cpu time, including 33 ms collecting - 81 ms elapsed real time, including 33 ms collecting - 1370184 bytes allocated -running stats for ack (20): - no collections - 1346 ms elapsed cpu time, including 0 ms collecting - 1348 ms elapsed real time, including 0 ms collecting - 24 bytes allocated -running stats for compile-ack: - 1 collection - 47 ms elapsed cpu time, including 34 ms collecting - 48 ms elapsed real time, including 34 ms collecting - 1370184 bytes allocated -running stats for ack (20): - no collections - 1346 ms elapsed cpu time, including 0 ms collecting - 1348 ms elapsed real time, including 0 ms collecting - 24 bytes allocated -running stats for compile-ack: - 1 collection - 46 ms elapsed cpu time, including 33 ms collecting - 47 ms elapsed real time, including 33 ms collecting - 1370184 bytes allocated -running stats for ack (20): - no collections - 1345 ms elapsed cpu time, including 0 ms collecting - 1346 ms elapsed real time, including 0 ms collecting - 24 bytes allocated -running stats for compile-ack: - 1 collection - 46 ms elapsed cpu time, including 33 ms collecting - 47 ms elapsed real time, including 33 ms collecting - 1370184 bytes allocated -running stats for compile-ack: - 1 collection - 48 ms elapsed cpu time, including 34 ms collecting - 50 ms elapsed real time, including 35 ms collecting - 1370184 bytes allocated -running stats for ack (20): - no collections - 1348 ms elapsed cpu time, including 0 ms collecting - 1351 ms elapsed real time, including 0 ms collecting - 24 bytes allocated -running stats for compile-array1: - 1 collection - 52 ms elapsed cpu time, including 33 ms collecting - 87 ms elapsed real time, including 34 ms collecting - 1722224 bytes allocated -running stats for array1 (2): - 80 collections - 1739 ms elapsed cpu time, including 479 ms collecting - 1749 ms elapsed real time, including 482 ms collecting - 320011240 bytes allocated -running stats for compile-array1: - 1 collection - 48 ms elapsed cpu time, including 32 ms collecting - 48 ms elapsed real time, including 33 ms collecting - 1722224 bytes allocated -running stats for array1 (2): - 80 collections - 1737 ms elapsed cpu time, including 476 ms collecting - 1747 ms elapsed real time, including 480 ms collecting - 320011240 bytes allocated -running stats for compile-array1: - 1 collection - 48 ms elapsed cpu time, including 31 ms collecting - 48 ms elapsed real time, including 32 ms collecting - 1722224 bytes allocated -NOW: 2007-11-28 22:35:27 -running stats for compile-ack: - 1 collection - 55 ms elapsed cpu time, including 35 ms collecting - 91 ms elapsed real time, including 41 ms collecting - 1370184 bytes allocated -running stats for ack (20): - no collections - 1609 ms elapsed cpu time, including 0 ms collecting - 1612 ms elapsed real time, including 0 ms collecting - 24 bytes allocated -running stats for compile-ack: - 1 collection - 53 ms elapsed cpu time, including 37 ms collecting - 53 ms elapsed real time, including 37 ms collecting - 1370184 bytes allocated -running stats for ack (20): - no collections - 1614 ms elapsed cpu time, including 0 ms collecting - 1621 ms elapsed real time, including 0 ms collecting - 24 bytes allocated -running stats for compile-ack: - 1 collection - 53 ms elapsed cpu time, including 37 ms collecting - 54 ms elapsed real time, including 37 ms collecting - 1370184 bytes allocated -running stats for ack (20): - no collections - 1615 ms elapsed cpu time, including 0 ms collecting - 1621 ms elapsed real time, including 0 ms collecting - 24 bytes allocated -running stats for compile-ack: - 1 collection - 54 ms elapsed cpu time, including 37 ms collecting - 55 ms elapsed real time, including 38 ms collecting - 1370184 bytes allocated -running stats for ack (20): - no collections - 1615 ms elapsed cpu time, including 0 ms collecting - 1622 ms elapsed real time, including 0 ms collecting - 24 bytes allocated -running stats for compile-ack: - 1 collection - 53 ms elapsed cpu time, including 37 ms collecting - 54 ms elapsed real time, including 38 ms collecting - 1370184 bytes allocated +NOW: 2007-12-25 04:45:50 +The garbage collector should touch about 32 megabytes of heap storage. +The use of more or less memory will skew the results. +Garbage Collector Test + Stretching memory with a binary tree of depth 18 + Total memory available= ???????? bytes Free memory= ???????? bytes +GCBench: Main + Creating a long-lived binary tree of depth 16 + Creating a long-lived array of 524284 inexact reals + Total memory available= ???????? bytes Free memory= ???????? bytes +Creating 33824 trees of depth 4 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 8256 trees of depth 6 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 2052 trees of depth 8 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 512 trees of depth 10 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 128 trees of depth 12 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 32 trees of depth 14 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 8 trees of depth 16 +GCBench: Top down construction +GCBench: Bottom up construction + Total memory available= ???????? bytes Free memory= ???????? bytes +Garbage Collector Test + Stretching memory with a binary tree of depth 18 + Total memory available= ???????? bytes Free memory= ???????? bytes +GCBench: Main + Creating a long-lived binary tree of depth 16 + Creating a long-lived array of 524284 inexact reals + Total memory available= ???????? bytes Free memory= ???????? bytes +Creating 33824 trees of depth 4 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 8256 trees of depth 6 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 2052 trees of depth 8 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 512 trees of depth 10 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 128 trees of depth 12 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 32 trees of depth 14 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 8 trees of depth 16 +GCBench: Top down construction +GCBench: Bottom up construction + Total memory available= ???????? bytes Free memory= ???????? bytes +The garbage collector should touch about 32 megabytes of heap storage. +The use of more or less memory will skew the results. +Garbage Collector Test + Stretching memory with a binary tree of depth 18 + Total memory available= ???????? bytes Free memory= ???????? bytes +GCBench: Main + Creating a long-lived binary tree of depth 16 + Creating a long-lived array of 524284 inexact reals + Total memory available= ???????? bytes Free memory= ???????? bytes +Creating 33824 trees of depth 4 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 8256 trees of depth 6 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 2052 trees of depth 8 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 512 trees of depth 10 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 128 trees of depth 12 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 32 trees of depth 14 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 8 trees of depth 16 +GCBench: Top down construction +GCBench: Bottom up construction + Total memory available= ???????? bytes Free memory= ???????? bytes +Garbage Collector Test + Stretching memory with a binary tree of depth 18 + Total memory available= ???????? bytes Free memory= ???????? bytes +GCBench: Main + Creating a long-lived binary tree of depth 16 + Creating a long-lived array of 524284 inexact reals + Total memory available= ???????? bytes Free memory= ???????? bytes +Creating 33824 trees of depth 4 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 8256 trees of depth 6 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 2052 trees of depth 8 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 512 trees of depth 10 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 128 trees of depth 12 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 32 trees of depth 14 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 8 trees of depth 16 +GCBench: Top down construction +GCBench: Bottom up construction + Total memory available= ???????? bytes Free memory= ???????? bytes +The garbage collector should touch about 32 megabytes of heap storage. +The use of more or less memory will skew the results. +Garbage Collector Test + Stretching memory with a binary tree of depth 18 + Total memory available= ???????? bytes Free memory= ???????? bytes +GCBench: Main + Creating a long-lived binary tree of depth 16 + Creating a long-lived array of 524284 inexact reals + Total memory available= ???????? bytes Free memory= ???????? bytes +Creating 33824 trees of depth 4 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 8256 trees of depth 6 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 2052 trees of depth 8 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 512 trees of depth 10 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 128 trees of depth 12 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 32 trees of depth 14 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 8 trees of depth 16 +GCBench: Top down construction +GCBench: Bottom up construction + Total memory available= ???????? bytes Free memory= ???????? bytes +Garbage Collector Test + Stretching memory with a binary tree of depth 18 + Total memory available= ???????? bytes Free memory= ???????? bytes +GCBench: Main + Creating a long-lived binary tree of depth 16 + Creating a long-lived array of 524284 inexact reals + Total memory available= ???????? bytes Free memory= ???????? bytes +Creating 33824 trees of depth 4 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 8256 trees of depth 6 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 2052 trees of depth 8 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 512 trees of depth 10 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 128 trees of depth 12 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 32 trees of depth 14 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 8 trees of depth 16 +GCBench: Top down construction +GCBench: Bottom up construction + Total memory available= ???????? bytes Free memory= ???????? bytes +The garbage collector should touch about 32 megabytes of heap storage. +The use of more or less memory will skew the results. +Garbage Collector Test + Stretching memory with a binary tree of depth 18 + Total memory available= ???????? bytes Free memory= ???????? bytes +GCBench: Main + Creating a long-lived binary tree of depth 16 + Creating a long-lived array of 524284 inexact reals + Total memory available= ???????? bytes Free memory= ???????? bytes +Creating 33824 trees of depth 4 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 8256 trees of depth 6 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 2052 trees of depth 8 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 512 trees of depth 10 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 128 trees of depth 12 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 32 trees of depth 14 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 8 trees of depth 16 +GCBench: Top down construction +GCBench: Bottom up construction + Total memory available= ???????? bytes Free memory= ???????? bytes +Garbage Collector Test + Stretching memory with a binary tree of depth 18 + Total memory available= ???????? bytes Free memory= ???????? bytes +GCBench: Main + Creating a long-lived binary tree of depth 16 + Creating a long-lived array of 524284 inexact reals + Total memory available= ???????? bytes Free memory= ???????? bytes +Creating 33824 trees of depth 4 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 8256 trees of depth 6 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 2052 trees of depth 8 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 512 trees of depth 10 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 128 trees of depth 12 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 32 trees of depth 14 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 8 trees of depth 16 +GCBench: Top down construction +GCBench: Bottom up construction + Total memory available= ???????? bytes Free memory= ???????? bytes +The garbage collector should touch about 32 megabytes of heap storage. +The use of more or less memory will skew the results. +Garbage Collector Test + Stretching memory with a binary tree of depth 18 + Total memory available= ???????? bytes Free memory= ???????? bytes +GCBench: Main + Creating a long-lived binary tree of depth 16 + Creating a long-lived array of 524284 inexact reals + Total memory available= ???????? bytes Free memory= ???????? bytes +Creating 33824 trees of depth 4 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 8256 trees of depth 6 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 2052 trees of depth 8 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 512 trees of depth 10 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 128 trees of depth 12 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 32 trees of depth 14 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 8 trees of depth 16 +GCBench: Top down construction +GCBench: Bottom up construction + Total memory available= ???????? bytes Free memory= ???????? bytes +Garbage Collector Test + Stretching memory with a binary tree of depth 18 + Total memory available= ???????? bytes Free memory= ???????? bytes +GCBench: Main + Creating a long-lived binary tree of depth 16 + Creating a long-lived array of 524284 inexact reals + Total memory available= ???????? bytes Free memory= ???????? bytes +Creating 33824 trees of depth 4 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 8256 trees of depth 6 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 2052 trees of depth 8 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 512 trees of depth 10 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 128 trees of depth 12 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 32 trees of depth 14 +GCBench: Top down construction +GCBench: Bottom up construction +Creating 8 trees of depth 16 +GCBench: Top down construction +GCBench: Bottom up construction + Total memory available= ???????? bytes Free memory= ???????? bytes +25 megabytes +0 work units per step. +promotion ratio is 1:10 +pointer mutation rate is 10 +600 steps +Allocating 76 trees. + (24902160 bytes) + (1245108 nodes) +Initialization complete... +Allocated 600 Mb of young gen garbage + (actually allocated 6e2 megabytes) +Promoted 6e1 Mb + (actually promoted 59.86 megabytes) +Mutated 6000 pointers +25 megabytes +0 work units per step. +promotion ratio is 1:10 +pointer mutation rate is 10 +600 steps +Allocating 76 trees. + (24902160 bytes) + (1245108 nodes) +Initialization complete... +Allocated 600 Mb of young gen garbage + (actually allocated 6e2 megabytes) +Promoted 6e1 Mb + (actually promoted 59.86 megabytes) +Mutated 6000 pointers +25 megabytes +0 work units per step. +promotion ratio is 1:10 +pointer mutation rate is 10 +600 steps +Allocating 76 trees. + (24902160 bytes) + (1245108 nodes) +Initialization complete... +Allocated 600 Mb of young gen garbage + (actually allocated 6e2 megabytes) +Promoted 6e1 Mb + (actually promoted 59.86 megabytes) +Mutated 6000 pointers +25 megabytes +0 work units per step. +promotion ratio is 1:10 +pointer mutation rate is 10 +600 steps +Allocating 76 trees. + (24902160 bytes) + (1245108 nodes) +Initialization complete... +Allocated 600 Mb of young gen garbage + (actually allocated 6e2 megabytes) +Promoted 6e1 Mb + (actually promoted 59.86 megabytes) +Mutated 6000 pointers +25 megabytes +0 work units per step. +promotion ratio is 1:10 +pointer mutation rate is 10 +600 steps +Allocating 76 trees. + (24902160 bytes) + (1245108 nodes) +Initialization complete... +Allocated 600 Mb of young gen garbage + (actually allocated 6e2 megabytes) +Promoted 6e1 Mb + (actually promoted 59.86 megabytes) +Mutated 6000 pointers +15794.97500000012 +15794.97500000012 +15794.97500000012 +15794.97500000012 +15794.97500000012