Merge pull request #78 from Interlisp/fix-run-medley
Don't change LOGINDIR LDEINIT default if already set
This commit is contained in:
Larry Masinter
GitHub
commit
d8d5935a54
@ -1,211 +0,0 @@
|
||||
Running the Benchmarks
|
||||
All the files for doing benchmarks were in this folder.
|
||||
This file would have told you where to find the files you need, and how to run the various benchmarks.dir
|
||||
|
||||
Overall directory layout:
|
||||
Information Gabriel>, this file.
|
||||
Procedures Gabriel>Admin> for overall procedure files, rather than specific test plans or scripts
|
||||
Benchmarks Gabriel>Benchmarks> for lisp source & compiled files containing specific benchmarks
|
||||
Results Gabriel>Results> for the results of benchmark runs.
|
||||
Tools Gabriel>Tools> for general-purpose files like gabriel-timers.
|
||||
Auxiliary Files Gabriel>Aux> for auxiliary files, e.g., the file of FLOATs that gets read in by the floating-point-read benchmark.
|
||||
Interlisp Gabriel>Interlisp> for the old, Interlisp-only versions of the Gabriel benchmarks that were run before Common Lisp existed.
|
||||
The directory in detail:
|
||||
.
|
||||
The Benchmarks you might want to run
|
||||
.
|
||||
Creating a Benchmark
|
||||
1. Load Tools>GABRIEL-TIMERS.LCOM, which defines all the functions you'll need.
|
||||
2. Use the function GABRIEL::DEFINE-TIMER (documented below) to create each benchmark. You'll be assigning the benchmark a name, and you may want to define auxiliary functions for the benchmark (e.g. for cleanup) as well.
|
||||
3. To try out your benchmarks, first compile all the TIMERS definitions and auxiliary functions (I use ^C in SEdit quite nicely), then say to an Exec:
|
||||
GABRIEL::RUN-BENCHMARKS((>>your b/m names here<<))
|
||||
to try them out.
|
||||
4. Save all the timers and functions on a file, MAKEFILE it, and compile it. After you load the compiled file, you'll be able to run the new benchmarks wherever you loaded it.
|
||||
|
||||
(GABRIEL::DEFINE-TIMER
|
||||
(name
|
||||
[(:SETUP single-setup-form)]
|
||||
[(:AFTER-EVERY single-cleanup-form)]
|
||||
[(:AFTER single-cleanup-form)] )
|
||||
"optional documentation string"
|
||||
forms-to-run-for-the-benchmark )
|
||||
|
||||
Defines a benchmark named name, which will run forms-to-run-for-the-benchmark for every iteration of the benchmark. If you specify the :SETUP clause, the single form single-setup-form you supply will be run once before the first iteration of the benchmark. If you specify :AFTER, that single cleanup form will be run after the last iteration of the benchmark has been run; the :AFTER-EVERY cleanup form will be run after each iteration (including the last one).
|
||||
Running Benchmarks
|
||||
1. Load Tools>GABRIEL-TIMERS.LCOM, which defines all the functions you'll need.
|
||||
2. Load the files that contain the benchmarks you want to run. Loading a file of benchmarks adds the names of those benchmarks to the list GABRIEL::*ALL-TIMERS*.
|
||||
3. Use the function GABRIEL:RUN-BENCHMARKS, described below.
|
||||
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
&OPTIONAL (BENCHMARKS GABRIEL::*ALL-TIMERS*)
|
||||
(DRIBBLE-FILE (QUOTE {DSK}GABRIEL.BENCHMARKS))
|
||||
(NUMBER-OF-ITERATIONS GABRIEL::*MINIMUM-TESTS*))
|
||||
|
||||
Runs the benchmarks named in BENCHMARKS, defaulting to the list of all the benchmarks that you've loaded. The timing results are printed in the Exec window, and on the file DRIBBLE-FILE. Each test will be run NUMBER-OF-ITERATIONS times, defaulting to 2.
|
||||
Running the Standard Benchmark Set
|
||||
1. Load the files :
|
||||
Tools>GABRIEL-TIMERS.LCOM
|
||||
{ERIS}<LispCore>Benchmarks>GABRIEL-OTHER.dfasl
|
||||
{ERIS}<LispCore>Benchmarks>GABRIEL-TAK.dfasl
|
||||
{ERIS}<LispCore>Benchmarks>ARITH-BENCHMARKS.dfasl
|
||||
{ERIS}<LispCore>Benchmarks>IO-BENCHMARKS.LCOM
|
||||
2a. If you are running on an 1186, run the following functions:
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*TAK-TIMERS*
|
||||
'Results>Maiko>1186-PAV-TAK.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*IO-BENCHMARKS*
|
||||
'Results>Maiko>1186-IO.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
IL:*ARITH-BENCHMARKS*
|
||||
'Results>Maiko>1186-PAV-ARITH.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*AREFY-BENCHMARKS*
|
||||
'Results>Maiko>1186-PAV-AREFY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*CONSY-BENCHMARKS*
|
||||
'Results>Maiko>1186-PAV-CONSY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*POLY-BENCHMARKS*
|
||||
'Results>Maiko>1186-PAV-POLY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*MISC-BENCHMARKS*
|
||||
'Results>Maiko>1186-PAV-MISC.Results)
|
||||
|
||||
2b. If you are running on a Sun, run the following:
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*TAK-TIMERS*
|
||||
'Results>Maiko>SUN-PAV-TAK.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*MAIKO-IO-BENCHMARKS*
|
||||
'Results>Maiko>SUN-IO.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
IL:*ARITH-BENCHMARKS*
|
||||
'Results>Maiko>SUN-PAV-ARITH.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*AREFY-BENCHMARKS*
|
||||
'Results>Maiko>SUN-PAV-AREFY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*CONSY-BENCHMARKS*
|
||||
'Results>Maiko>SUN-PAV-CONSY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*POLY-BENCHMARKS*
|
||||
'Results>Maiko>SUN-PAV-POLY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*MISC-BENCHMARKS*
|
||||
'Results>Maiko>SUN-PAV-MISC.Results)
|
||||
2c. If you are running on an 1108, run the following:
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*TAK-TIMERS*
|
||||
'Results>Maiko>1108-PAV-TAK.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*MAIKO-IO-BENCHMARKS*
|
||||
'Results>Maiko>1108-IO.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
IL:*ARITH-BENCHMARKS*
|
||||
'Results>Maiko>1108-PAV-ARITH.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*AREFY-BENCHMARKS*
|
||||
'Results>Maiko>1108-PAV-AREFY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*CONSY-BENCHMARKS*
|
||||
'Results>Maiko>1108-PAV-CONSY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*POLY-BENCHMARKS*
|
||||
'Results>Maiko>1108-PAV-POLY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*MISC-BENCHMARKS*
|
||||
'Results>Maiko>1108-PAV-MISC.Results)
|
||||
2d. If you are running on a Dorado, run the following:
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*TAK-TIMERS*
|
||||
'Results>Maiko>1132-PAV-TAK.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*MAIKO-IO-BENCHMARKS*
|
||||
'Results>Maiko>1132-IO.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
IL:*ARITH-BENCHMARKS*
|
||||
'Results>Maiko>1132-PAV-ARITH.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*AREFY-BENCHMARKS*
|
||||
'Results>Maiko>1132-PAV-AREFY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*CONSY-BENCHMARKS*
|
||||
'Results>Maiko>1132-PAV-CONSY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*POLY-BENCHMARKS*
|
||||
'Results>Maiko>1132-PAV-POLY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*MISC-BENCHMARKS*
|
||||
'Results>Maiko>1132-PAV-MISC.Results)
|
||||
3. Load the files:
|
||||
{ERIS}<LispCore>Benchmarks>GABRIEL-OTHER.LCOM
|
||||
{ERIS}<LispCore>Benchmarks>GABRIEL-TAK.LCOM
|
||||
{ERIS}<LispCore>Benchmarks>ARITH-BENCHMARKS.LCOM
|
||||
4a. If you are running on an 1186, run the following functions:
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*TAK-TIMERS*
|
||||
'Results>Maiko>1186-BYTE-TAK.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
IL:*ARITH-BENCHMARKS*
|
||||
'Results>Maiko>1186-BYTE-ARITH.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*AREFY-BENCHMARKS*
|
||||
'Results>Maiko>1186-BYTE-AREFY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*CONSY-BENCHMARKS*
|
||||
'Results>Maiko>1186-BYTE-CONSY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*POLY-BENCHMARKS*
|
||||
'Results>Maiko>1186-BYTE-POLY.Results)
|
||||
|
||||
4b. If you are running on a Sun, run the following:
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*TAK-TIMERS*
|
||||
'Results>Maiko>SUN-BYTE-TAK.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
IL:*ARITH-BENCHMARKS*
|
||||
'Results>Maiko>SUN-BYTE-ARITH.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*AREFY-BENCHMARKS*
|
||||
'Results>Maiko>SUN-BYTE-AREFY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*CONSY-BENCHMARKS*
|
||||
'Results>Maiko>SUN-BYTE-CONSY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*POLY-BENCHMARKS*
|
||||
'Results>Maiko>SUN-BYTE-POLY.Results)
|
||||
4c. If you are running on an 1108, run the following:
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*TAK-TIMERS*
|
||||
'Results>Maiko>1108-BYTE-TAK.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
IL:*ARITH-BENCHMARKS*
|
||||
'Results>Maiko>1108-BYTE-ARITH.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*AREFY-BENCHMARKS*
|
||||
'Results>Maiko>1108-BYTE-AREFY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*CONSY-BENCHMARKS*
|
||||
'Results>Maiko>1108-BYTE-CONSY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*POLY-BENCHMARKS*
|
||||
'Results>Maiko>1108-BYTE-POLY.Results)
|
||||
4d. If you are running on a Dorado, run the following:
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*TAK-TIMERS*
|
||||
'Results>Maiko>1132-BYTE-TAK.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
IL:*ARITH-BENCHMARKS*
|
||||
'Results>Maiko>1132-BYTE-ARITH.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*AREFY-BENCHMARKS*
|
||||
'Results>Maiko>1132-BYTE-AREFY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*CONSY-BENCHMARKS*
|
||||
'Results>Maiko>1132-BYTE-CONSY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*POLY-BENCHMARKS*
|
||||
|
||||
'Results>Maiko>1132-BYTE-POLY.Results)
|
||||
5. SEE each of the .Results files listed above, average the run times (mentally is probably fine), and enter the results in the benchmark log.
|
||||
@ -1,209 +0,0 @@
|
||||
Running the Benchmarks
|
||||
All the files for doing benchmarks are contained on {Eris}<Lispcore>Gabriel>. This file will tell you where to find the files you need, and how to run the various benchmarks.
|
||||
|
||||
Overall directory layout:
|
||||
Information {Eris}<Lispcore>Gabriel>, files named .name, e.g. ª.read-me-firstº , this file.
|
||||
Procedures {Eris}<Lispcore>Gabriel>Admin> for overall procedure files, rather than specific test plans or scripts
|
||||
Benchmarks {Eris}<Lispcore>Gabriel>Benchmarks> for lisp source & compiled files containing specific benchmarks
|
||||
Results {Eris}<Lispcore>Gabriel>Results> for the results of benchmark runs.
|
||||
Tools {Eris}<Lispcore>Gabriel>Tools> for general-purpose files like gabriel-timers.
|
||||
Auxiliary Files {Eris}<Lispcore>Gabriel>Aux> for auxiliary files, e.g., the file of FLOATs that gets read in by the floating-point-read benchmark.
|
||||
Interlisp B/Ms {Eris}<Lispcore>Gabriel>Interlisp> for the old, Interlisp-only versions of the Gabriel benchmarks that were run before Common Lisp existed.
|
||||
The directory in detail:
|
||||
.
|
||||
The Benchmarks you might want to run
|
||||
.
|
||||
Creating a Benchmark
|
||||
1. Load {Eris}<Lispcore>Gabriel>Tools>GABRIEL-TIMERS.LCOM, which defines all the functions you'll need.
|
||||
2. Use the function GABRIEL::DEFINE-TIMER (documented below) to create each benchmark. You'll be assigning the benchmark a name, and you may want to define auxiliary functions for the benchmark (e.g. for cleanup) as well.
|
||||
3. To try out your benchmarks, first compile all the TIMERS definitions and auxiliary functions (I use ^C in SEdit quite nicely), then say to an Exec:
|
||||
GABRIEL::RUN-BENCHMARKS((>>your b/m names here<<))
|
||||
to try them out.
|
||||
4. Save all the timers and functions on a file, MAKEFILE it, and compile it. After you load the compiled file, you'll be able to run the new benchmarks wherever you loaded it.
|
||||
|
||||
(GABRIEL::DEFINE-TIMER
|
||||
(name
|
||||
[(:SETUP single-setup-form)]
|
||||
[(:AFTER-EVERY single-cleanup-form)]
|
||||
[(:AFTER single-cleanup-form)] )
|
||||
"optional documentation string"
|
||||
forms-to-run-for-the-benchmark )
|
||||
|
||||
Defines a benchmark named name, which will run forms-to-run-for-the-benchmark for every iteration of the benchmark. If you specify the :SETUP clause, the single form single-setup-form you supply will be run once before the first iteration of the benchmark. If you specify :AFTER, that single cleanup form will be run after the last iteration of the benchmark has been run; the :AFTER-EVERY cleanup form will be run after each iteration (including the last one).
|
||||
Running Benchmarks
|
||||
1. Load {Eris}<Lispcore>Gabriel>Tools>GABRIEL-TIMERS.LCOM, which defines all the functions you'll need.
|
||||
2. Load the files that contain the benchmarks you want to run. Loading a file of benchmarks adds the names of those benchmarks to the list GABRIEL::*ALL-TIMERS*.
|
||||
3. Use the function GABRIEL:RUN-BENCHMARKS, described below.
|
||||
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
&OPTIONAL (BENCHMARKS GABRIEL::*ALL-TIMERS*)
|
||||
(DRIBBLE-FILE (QUOTE {DSK}GABRIEL.BENCHMARKS))
|
||||
(NUMBER-OF-ITERATIONS GABRIEL::*MINIMUM-TESTS*))
|
||||
|
||||
Runs the benchmarks named in BENCHMARKS, defaulting to the list of all the benchmarks that you've loaded. The timing results are printed in the Exec window, and on the file DRIBBLE-FILE. Each test will be run NUMBER-OF-ITERATIONS times, defaulting to 2.
|
||||
Running the Standard Benchmark Set
|
||||
1. Load the files :
|
||||
{Eris}<Lispcore>Gabriel>Tools>GABRIEL-TIMERS.LCOM
|
||||
{ERIS}<LispCore>Gabriel>Benchmarks>GABRIEL-OTHER.dfasl
|
||||
{ERIS}<LispCore>Gabriel>Benchmarks>GABRIEL-TAK.dfasl
|
||||
{ERIS}<LispCore>Gabriel>Benchmarks>ARITH-BENCHMARKS.dfasl
|
||||
{ERIS}<LispCore>Gabriel>Benchmarks>IO-BENCHMARKS.LCOM
|
||||
2a. If you are running on an 1186, run the following functions:
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*TAK-TIMERS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1186-PAV-TAK.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*IO-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1186-IO.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
IL:*ARITH-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1186-PAV-ARITH.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*AREFY-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1186-PAV-AREFY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*CONSY-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1186-PAV-CONSY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*POLY-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1186-PAV-POLY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*MISC-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1186-PAV-MISC.Results)
|
||||
|
||||
2b. If you are running on a Sun, run the following:
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*TAK-TIMERS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>SUN-PAV-TAK.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*MAIKO-IO-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>SUN-IO.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
IL:*ARITH-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>SUN-PAV-ARITH.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*AREFY-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>SUN-PAV-AREFY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*CONSY-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>SUN-PAV-CONSY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*POLY-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>SUN-PAV-POLY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*MISC-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>SUN-PAV-MISC.Results)
|
||||
2c. If you are running on an 1108, run the following:
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*TAK-TIMERS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1108-PAV-TAK.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*MAIKO-IO-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1108-IO.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
IL:*ARITH-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1108-PAV-ARITH.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*AREFY-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1108-PAV-AREFY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*CONSY-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1108-PAV-CONSY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*POLY-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1108-PAV-POLY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*MISC-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1108-PAV-MISC.Results)
|
||||
2d. If you are running on a Dorado, run the following:
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*TAK-TIMERS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1132-PAV-TAK.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*MAIKO-IO-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1132-IO.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
IL:*ARITH-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1132-PAV-ARITH.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*AREFY-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1132-PAV-AREFY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*CONSY-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1132-PAV-CONSY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*POLY-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1132-PAV-POLY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*MISC-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1132-PAV-MISC.Results)
|
||||
3. Load the files:
|
||||
{ERIS}<LispCore>Gabriel>Benchmarks>GABRIEL-OTHER.LCOM
|
||||
{ERIS}<LispCore>Gabriel>Benchmarks>GABRIEL-TAK.LCOM
|
||||
{ERIS}<LispCore>Gabriel>Benchmarks>ARITH-BENCHMARKS.LCOM
|
||||
4a. If you are running on an 1186, run the following functions:
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*TAK-TIMERS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1186-BYTE-TAK.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
IL:*ARITH-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1186-BYTE-ARITH.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*AREFY-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1186-BYTE-AREFY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*CONSY-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1186-BYTE-CONSY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*POLY-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1186-BYTE-POLY.Results)
|
||||
|
||||
4b. If you are running on a Sun, run the following:
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*TAK-TIMERS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>SUN-BYTE-TAK.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
IL:*ARITH-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>SUN-BYTE-ARITH.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*AREFY-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>SUN-BYTE-AREFY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*CONSY-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>SUN-BYTE-CONSY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*POLY-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>SUN-BYTE-POLY.Results)
|
||||
4c. If you are running on an 1108, run the following:
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*TAK-TIMERS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1108-BYTE-TAK.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
IL:*ARITH-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1108-BYTE-ARITH.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*AREFY-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1108-BYTE-AREFY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*CONSY-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1108-BYTE-CONSY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*POLY-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1108-BYTE-POLY.Results)
|
||||
4d. If you are running on a Dorado, run the following:
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*TAK-TIMERS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1132-BYTE-TAK.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
IL:*ARITH-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1132-BYTE-ARITH.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*AREFY-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1132-BYTE-AREFY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*CONSY-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1132-BYTE-CONSY.Results)
|
||||
(GABRIEL::RUN-BENCHMARKS
|
||||
GABRIEL::*POLY-BENCHMARKS*
|
||||
'{Eris}<Lispcore>Gabriel>Results>Maiko>1132-BYTE-POLY.Results)
|
||||
5. SEE each of the .Results files listed above, average the run times (mentally is probably fine), and enter the results in the benchmark log.
2 2 2 ; T $ T ; $ T > $ 0 < , , , , MODERN
MODERN
MODERN
MODERN MODERN MODERN MODERN
°
3 % s p M U ” œ
%
h ß — 7 ± !
Z h £ =
"
# 4 9 7 < 8 @ r p t z z x x 4 q u s y y w w 6 r v t z z x x 7 r v t z z x x J 6 ; @ s u { { y 4 r t z z x 6 s u { { y 7 s u { { y Ž 'q ùzº
|
||||
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
@ -1 +0,0 @@
|
||||
Lisp Type: Xerox
Lisp Version: LISPCORE of 12-Mar-87 12:04:37
Software Type: Xerox Lisp
Software Version: 11-Mar-87 23:53:52
Machine Type: Xerox 1186
Machine Version: microcode 87, 7424 pages
Machine Instance: 2856394810
Site: unknown
Features: (:interlisp :xerox :common)
***** puzzle Benchmark ***
Puzzle
Iteration 0 of puzzle
Success in 2005 trials.Timing for : puzzle
Elapsed time = 48.911 seconds
net compute time = 48.911 seconds
Storage allocated:
10 listp, 4 oned-array
Iteration 1 of puzzle
Success in 2005 trials.Timing for : puzzle
Elapsed time = 48.912 seconds
net compute time = 48.912 seconds
Storage allocated:
10 listp, 4 oned-array
***** triang Benchmark ***
Triang
Iteration 0 of triang
Timing for : triang
Elapsed time = 787.551 seconds
reclaim time = 0.907 seconds
net compute time = 786.644 seconds
Storage allocated:
11626 listp
Iteration 1 of triang
Timing for : triang
Elapsed time = 787.524 seconds
reclaim time = 0.892 seconds
net compute time = 786.632 seconds
Storage allocated:
11626 listp
***** fft Benchmark ***
FFT
Iteration 0 of fft
Timing for : fft
Elapsed time = 209.847 seconds
reclaim time = 123.799 seconds
net compute time = 86.048 seconds
Storage allocated:
942640 floatp
Iteration 1 of fft
Timing for : fft
Elapsed time = 209.832 seconds
reclaim time = 123.799 seconds
net compute time = 86.033 seconds
Storage allocated:
942640 floatp
|
||||
@ -1 +0,0 @@
|
||||
Lisp Type: Xerox
Lisp Version: LISPCORE of 12-Mar-87 12:04:37
Software Type: Xerox Lisp
Software Version: 11-Mar-87 23:53:52
Machine Type: Xerox 1186
Machine Version: microcode 87, 7424 pages
Machine Instance: 2856394810
Site: unknown
Features: (:interlisp :xerox :common)
***** deriv Benchmark ***
Deriv
Iteration 0 of deriv
Timing for : deriv
Elapsed time = 83.669 seconds
reclaim time = 54.342 seconds
net compute time = 29.327 seconds
Page faults = 24
Storage allocated:
245000 listp
Iteration 1 of deriv
Timing for : deriv
Elapsed time = 79.776 seconds
reclaim time = 52.129 seconds
net compute time = 27.647 seconds
Storage allocated:
245000 listp
***** dderiv Benchmark ***
DDeriv
Evaluating setup for dderiv
Iteration 0 of dderiv
Timing for : dderiv
Elapsed time = 92.738 seconds
reclaim time = 58.220 seconds
net compute time = 34.518 seconds
Page faults = 4
Storage allocated:
260000 listp
Iteration 1 of dderiv
Timing for : dderiv
Elapsed time = 93.343 seconds
reclaim time = 58.629 seconds
net compute time = 34.714 seconds
Storage allocated:
260000 listp
***** div2-1 Benchmark ***
Div2, Iterative
Iteration 0 of div2-1
Timing for : div2-1
Elapsed time = 37.476 seconds
reclaim time = 25.225 seconds
net compute time = 12.251 seconds
Storage allocated:
120000 listp
Iteration 1 of div2-1
Timing for : div2-1
Elapsed time = 38.242 seconds
reclaim time = 25.526 seconds
net compute time = 12.716 seconds
Storage allocated:
120000 listp
***** div2-2 Benchmark ***
Div2, Recursive
Iteration 0 of div2-2
Timing for : div2-2
Elapsed time = 46.541 seconds
reclaim time = 26.068 seconds
net compute time = 20.473 seconds
Storage allocated:
120000 listp
Iteration 1 of div2-2
Timing for : div2-2
Elapsed time = 46.185 seconds
reclaim time = 25.843 seconds
net compute time = 20.342 seconds
Storage allocated:
120000 listp
***** destru Benchmark ***
Destruct
Iteration 0 of destru
Timing for : destru
Elapsed time = 23.955 seconds
reclaim time = 7.237 seconds
net compute time = 16.718 seconds
Storage allocated:
43105 listp
Iteration 1 of destru
Timing for : destru
Elapsed time = 23.789 seconds
reclaim time = 7.238 seconds
net compute time = 16.551 seconds
Storage allocated:
43105 listp
***** traverse-init Benchmark ***
Traverse, Initialize
Iteration 0 of traverse-init
Timing for : traverse-init
Elapsed time = 80.309 seconds
reclaim time = 1.909 seconds
net compute time = 78.400 seconds
Page faults = 394
Storage allocated:
36796 listp, 100 tnode
Iteration 1 of traverse-init
Timing for : traverse-init
Elapsed time = 122.999 seconds
reclaim time = 1.936 seconds
net compute time = 121.063 seconds
Page faults = 433
Storage allocated:
36853 listp, 100 tnode
***** traverse Benchmark ***
Traverse, Traverse
Iteration 0 of traverse
Timing for : traverse
Elapsed time = 154.940 seconds
net compute time = 154.940 seconds
Iteration 1 of traverse
Timing for : traverse
Elapsed time = 154.939 seconds
net compute time = 154.939 seconds
***** boyer Benchmark ***
Boyer
Evaluating setup for boyer
Iteration 0 of boyer
Timing for : boyer
Elapsed time = 161.438 seconds
SWAP time = 0.105 seconds
reclaim time = 46.146 seconds
net compute time = 115.187 seconds
Page faults = 555
Storage allocated:
226465 listp, 272 compiled-closure
Iteration 1 of boyer
Timing for : boyer
Elapsed time = 156.507 seconds
reclaim time = 46.724 seconds
net compute time = 109.783 seconds
Page faults = 4
Storage allocated:
226464 listp, 272 compiled-closure
***** browse Benchmark ***
Browse
Iteration 0 of browse
Timing for : browse
Elapsed time = 1677.630 seconds
SWAP time = 0.094 seconds
reclaim time = 819.829 seconds
net compute time = 857.707 seconds
Page faults = 75
Storage allocated:
488945 listp, 229002 oned-array
Iteration 1 of browse
Timing for : browse
Elapsed time = 1717.348 seconds
SWAP time = 0.012 seconds
reclaim time = 839.550 seconds
net compute time = 877.786 seconds
Page faults = 69
Storage allocated:
488945 listp, 229002 oned-array
|
||||
@ -1 +0,0 @@
|
||||
Lisp Type: Xerox
Lisp Version: LISPCORE of 12-Mar-87 12:04:37
Software Type: Xerox Lisp
Software Version: 11-Mar-87 23:53:52
Machine Type: Xerox 1186
Machine Version: microcode 87, 7424 pages
Machine Instance: 2856394810
Site: unknown
Features: (:interlisp :xerox :common)
***** deriv Benchmark ***
Deriv
Iteration 0 of deriv
Timing for : deriv
Elapsed time = 87.944 seconds
reclaim time = 58.328 seconds
net compute time = 29.616 seconds
Storage allocated:
245000 listp
Iteration 1 of deriv
Timing for : deriv
Elapsed time = 86.923 seconds
reclaim time = 57.705 seconds
net compute time = 29.218 seconds
Storage allocated:
245000 listp
***** dderiv Benchmark ***
DDeriv
Evaluating setup for dderiv
Iteration 0 of dderiv
Timing for : dderiv
Elapsed time = 99.232 seconds
reclaim time = 62.584 seconds
net compute time = 36.648 seconds
Storage allocated:
260000 listp
Iteration 1 of dderiv
Timing for : dderiv
Elapsed time = 98.432 seconds
reclaim time = 62.347 seconds
net compute time = 36.085 seconds
Storage allocated:
260000 listp
***** div2-1 Benchmark ***
Div2, Iterative
Iteration 0 of div2-1
Timing for : div2-1
Elapsed time = 40.517 seconds
reclaim time = 26.548 seconds
net compute time = 13.969 seconds
Storage allocated:
120000 listp
Iteration 1 of div2-1
Timing for : div2-1
Elapsed time = 41.565 seconds
reclaim time = 27.281 seconds
net compute time = 14.284 seconds
Storage allocated:
120000 listp
***** div2-2 Benchmark ***
Div2, Recursive
Iteration 0 of div2-2
Timing for : div2-2
Elapsed time = 48.682 seconds
reclaim time = 27.368 seconds
net compute time = 21.314 seconds
Storage allocated:
120000 listp
Iteration 1 of div2-2
Timing for : div2-2
Elapsed time = 49.145 seconds
reclaim time = 27.146 seconds
net compute time = 21.999 seconds
Storage allocated:
120000 listp
***** destru Benchmark ***
Destruct
Iteration 0 of destru
Timing for : destru
Elapsed time = 24.180 seconds
reclaim time = 8.483 seconds
net compute time = 15.697 seconds
Storage allocated:
43105 listp
Iteration 1 of destru
Timing for : destru
Elapsed time = 24.216 seconds
reclaim time = 8.448 seconds
net compute time = 15.768 seconds
Storage allocated:
43105 listp
***** traverse-init Benchmark ***
Traverse, Initialize
Iteration 0 of traverse-init
Timing for : traverse-init
Elapsed time = 173.013 seconds
reclaim time = 2.247 seconds
net compute time = 170.766 seconds
Page faults = 9
Storage allocated:
36646 listp, 100 tnode
Iteration 1 of traverse-init
Timing for : traverse-init
Elapsed time = 222.035 seconds
reclaim time = 2.290 seconds
net compute time = 219.745 seconds
Page faults = 368
Storage allocated:
36853 listp, 100 tnode
***** traverse Benchmark ***
Traverse, Traverse
Iteration 0 of traverse
Timing for : traverse
Elapsed time = 155.139 seconds
net compute time = 155.139 seconds
Iteration 1 of traverse
Timing for : traverse
Elapsed time = 155.139 seconds
net compute time = 155.139 seconds
***** boyer Benchmark ***
Boyer
Evaluating setup for boyer
Iteration 0 of boyer
Timing for : boyer
Elapsed time = 170.367 seconds
reclaim time = 54.939 seconds
net compute time = 115.428 seconds
Page faults = 538
Storage allocated:
226464 listp, 272 compiled-closure
Iteration 1 of boyer
Timing for : boyer
Elapsed time = 165.693 seconds
reclaim time = 55.075 seconds
net compute time = 110.618 seconds
Page faults = 2
Storage allocated:
226464 listp, 272 compiled-closure
***** browse Benchmark ***
Browse
Iteration 0 of browse
Timing for : browse
Elapsed time = 2801.953 seconds
reclaim time = 1391.371 seconds
net compute time = 1410.582 seconds
Page faults = 56
Storage allocated:
488945 listp, 229002 oned-array
Iteration 1 of browse
Timing for : browse
Elapsed time = 2831.552 seconds
reclaim time = 1403.618 seconds
net compute time = 1427.934 seconds
Page faults = 48
Storage allocated:
488945 listp, 229002 oned-array
|
||||
@ -1 +0,0 @@
|
||||
Lisp Type: Xerox
Lisp Version: LISPCORE of 12-Mar-87 12:04:37
Software Type: Xerox Lisp
Software Version: 11-Mar-87 23:53:52
Machine Type: Xerox 1186
Machine Version: microcode 87, 7424 pages
Machine Instance: 2856394810
Site: unknown
Features: (:interlisp :xerox :common)
***** browse* Benchmark ***
Browse
Iteration 0 of browse*
Timing for : browse*
Elapsed time = 1016.108 seconds
reclaim time = 491.414 seconds
net compute time = 524.694 seconds
Page faults = 100
Swap writes = 77
Storage allocated:
488945 listp, 2202 oned-array
Iteration 1 of browse*
Timing for : browse*
Elapsed time = 1015.613 seconds
reclaim time = 490.510 seconds
net compute time = 525.103 seconds
Page faults = 77
Swap writes = 70
Storage allocated:
488945 listp, 2202 oned-array
***** traverse-init Benchmark ***
Traverse, Initialize
Iteration 0 of traverse-init
Timing for : traverse-init
Elapsed time = 355.094 seconds
reclaim time = 3.185 seconds
net compute time = 351.909 seconds
Page faults = 388
Swap writes = 214
Storage allocated:
36796 listp, 100 tnode
Iteration 1 of traverse-init
Timing for : traverse-init
Elapsed time = 397.276 seconds
reclaim time = 3.401 seconds
net compute time = 393.875 seconds
Page faults = 429
Swap writes = 204
Storage allocated:
36796 listp, 100 tnode
***** traverse Benchmark ***
Traverse, Traverse
Iteration 0 of traverse
Timing for : traverse
Elapsed time = 154.792 seconds
net compute time = 154.792 seconds
Iteration 1 of traverse
Timing for : traverse
Elapsed time = 154.817 seconds
net compute time = 154.817 seconds
|
||||
@ -1 +0,0 @@
|
||||
Lisp Type: Xerox
Lisp Version: LISPCORE of 12-Mar-87 12:04:37
Software Type: Xerox Lisp
Software Version: 11-Mar-87 23:53:52
Machine Type: Xerox 1186
Machine Version: microcode 87, 7424 pages
Machine Instance: 2856394810
Site: unknown
Features: (:interlisp :xerox :common)
***** browse* Benchmark ***
Browse
Iteration 0 of browse*
Timing for : browse*
Elapsed time = 807.146 seconds
reclaim time = 383.271 seconds
net compute time = 423.875 seconds
Page faults = 56
Storage allocated:
488945 listp, 2202 oned-array
Iteration 1 of browse*
Timing for : browse*
Elapsed time = 818.779 seconds
reclaim time = 387.191 seconds
net compute time = 431.588 seconds
Page faults = 48
Storage allocated:
488945 listp, 2202 oned-array
***** traverse-init Benchmark ***
Traverse, Initialize
Iteration 0 of traverse-init
Timing for : traverse-init
Elapsed time = 261.049 seconds
reclaim time = 2.479 seconds
net compute time = 258.570 seconds
Page faults = 10
Storage allocated:
36796 listp, 100 tnode
Iteration 1 of traverse-init
Timing for : traverse-init
Elapsed time = 309.028 seconds
reclaim time = 2.655 seconds
net compute time = 306.373 seconds
Page faults = 411
Storage allocated:
36796 listp, 100 tnode
***** traverse Benchmark ***
Traverse, Traverse
Iteration 0 of traverse
Timing for : traverse
Elapsed time = 154.839 seconds
net compute time = 154.839 seconds
Iteration 1 of traverse
Timing for : traverse
Elapsed time = 154.837 seconds
net compute time = 154.837 seconds
|
||||
Binary file not shown.
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
Binary file not shown.
Binary file not shown.
@ -1 +0,0 @@
|
||||
Lisp Type: Xerox
Lisp Version: LISPCORE of 12-Mar-87 12:04:37
Software Type: Xerox Lisp
Software Version: 11-Mar-87 23:53:52
Machine Type: Xerox 1186
Machine Version: microcode 87, 7424 pages
Machine Instance: 2856394810
Site: unknown
Features: (:interlisp :xerox :common)
***** ctak Benchmark ***
CTak
Iteration 0 of ctak
Timing for : ctak
Elapsed time = 96.821 seconds
net compute time = 96.821 seconds
Iteration 1 of ctak
Timing for : ctak
Elapsed time = 97.117 seconds
net compute time = 97.117 seconds
***** stak Benchmark ***
STak
Iteration 0 of stak
Timing for : stak
Elapsed time = 4.589 seconds
net compute time = 4.589 seconds
Iteration 1 of stak
Timing for : stak
Elapsed time = 4.589 seconds
net compute time = 4.589 seconds
***** tak Benchmark ***
Tak
Iteration 0 of tak
Timing for : tak
Elapsed time = 1.630 seconds
net compute time = 1.630 seconds
Iteration 1 of tak
Timing for : tak
Elapsed time = 1.630 seconds
net compute time = 1.630 seconds
***** takl Benchmark ***
TakL
Iteration 0 of takl
Timing for : takl
Elapsed time = 13.366 seconds
net compute time = 13.366 seconds
Iteration 1 of takl
Timing for : takl
Elapsed time = 13.365 seconds
net compute time = 13.365 seconds
***** takr Benchmark ***
TakR
Iteration 0 of takr
Timing for : takr
Elapsed time = 1.737 seconds
net compute time = 1.737 seconds
Iteration 1 of takr
Timing for : takr
Elapsed time = 1.736 seconds
net compute time = 1.736 seconds
|
||||
@ -1 +0,0 @@
|
||||
Lisp Type: Xerox
Lisp Version: LISPCORE of 12-Mar-87 12:04:37
Software Type: Xerox Lisp
Software Version: 11-Mar-87 23:53:52
Machine Type: Xerox 1186
Machine Version: microcode 87, 7424 pages
Machine Instance: 2856394810
Site: unknown
Features: (:interlisp :xerox :common)
***** ctak Benchmark ***
CTak
Iteration 0 of ctak
Timing for : ctak
Elapsed time = 55.938 seconds
SWAP time = 0.038 seconds
reclaim time = 6.588 seconds
net compute time = 49.312 seconds
Page faults = 10
Storage allocated:
47707 listp
Iteration 1 of ctak
Timing for : ctak
Elapsed time = 55.667 seconds
reclaim time = 6.366 seconds
net compute time = 49.301 seconds
Storage allocated:
47707 listp
***** stak Benchmark ***
STak
Iteration 0 of stak
Timing for : stak
Elapsed time = 12.693 seconds
net compute time = 12.693 seconds
Iteration 1 of stak
Timing for : stak
Elapsed time = 12.693 seconds
net compute time = 12.693 seconds
***** tak Benchmark ***
Tak
Iteration 0 of tak
Timing for : tak
Elapsed time = 1.789 seconds
net compute time = 1.789 seconds
Iteration 1 of tak
Timing for : tak
Elapsed time = 1.796 seconds
net compute time = 1.796 seconds
***** takl Benchmark ***
TakL
Iteration 0 of takl
Timing for : takl
Elapsed time = 15.524 seconds
net compute time = 15.524 seconds
Iteration 1 of takl
Timing for : takl
Elapsed time = 15.525 seconds
net compute time = 15.525 seconds
***** takr Benchmark ***
TakR
Iteration 0 of takr
Timing for : takr
Elapsed time = 1.838 seconds
net compute time = 1.838 seconds
Iteration 1 of takr
Timing for : takr
Elapsed time = 1.839 seconds
net compute time = 1.839 seconds
|
||||
File diff suppressed because one or more lines are too long
@ -1 +0,0 @@
|
||||
Lisp Type: Xerox
Lisp Version: LISPCORE of 12-Mar-87 12:04:37
Software Type: Xerox Lisp
Software Version: 11-Mar-87 23:53:52
Machine Type: Xerox 1186
Machine Version: microcode 87, 7424 pages
Machine Instance: 2856394810
Site: unknown
Features: (:interlisp :xerox :common)
***** puzzle Benchmark ***
Puzzle
Iteration 0 of puzzle
Success in 2005 trials.Timing for : puzzle
Elapsed time = 47.531 seconds
SWAP time = 1.478 seconds
net compute time = 46.053 seconds
Page faults = 59
Storage allocated:
10 listp, 4 oned-array
Iteration 1 of puzzle
Success in 2005 trials.Timing for : puzzle
Elapsed time = 46.034 seconds
net compute time = 46.034 seconds
Storage allocated:
10 listp, 4 oned-array
***** triang Benchmark ***
Triang
Iteration 0 of triang
Timing for : triang
Elapsed time = 745.004 seconds
SWAP time = 0.009 seconds
reclaim time = 0.799 seconds
net compute time = 744.196 seconds
Page faults = 1
Storage allocated:
11626 listp
Iteration 1 of triang
Timing for : triang
Elapsed time = 744.929 seconds
reclaim time = 0.802 seconds
net compute time = 744.127 seconds
Storage allocated:
11626 listp
***** fft Benchmark ***
FFT
Iteration 0 of fft
Timing for : fft
Elapsed time = 212.251 seconds
SWAP time = 0.690 seconds
reclaim time = 122.149 seconds
net compute time = 89.412 seconds
Page faults = 53
Storage allocated:
942640 floatp
Iteration 1 of fft
Timing for : fft
Elapsed time = 210.515 seconds
reclaim time = 121.406 seconds
net compute time = 89.109 seconds
Storage allocated:
942640 floatp
|
||||
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
Binary file not shown.
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
Binary file not shown.
File diff suppressed because one or more lines are too long
@ -1 +0,0 @@
|
||||
Lisp Type: Xerox Lisp
Lisp Version: Lispcore sysout of 30-May-88 14:50:05
Software Type: Xerox AIE
Software Version: Lispcore sysout of 30-May-88 14:50:05, Make-init dates: 30-May-88 13:52:01, 30-May-88 14:02:15
Machine Type: Xerox 1132
Machine Version: Microcode version: 5682, memory size: 16384
Machine Instance: Amontillado = 12542500312#
Site: Unknown
Features: (:INTERLISP :XEROX :COMMON :IEEE-FLOATING-POINT)
***** CTAK Benchmark ***
CTak
Iteration 0 of CTAK
Timing for : CTAK
Elapsed time = 21.905 seconds
net compute time = 21.905 seconds
Iteration 1 of CTAK
Timing for : CTAK
Elapsed time = 21.904 seconds
net compute time = 21.904 seconds
***** STAK Benchmark ***
STak
Iteration 0 of STAK
Timing for : STAK
Elapsed time = 1.872 seconds
net compute time = 1.872 seconds
Iteration 1 of STAK
Timing for : STAK
Elapsed time = 1.872 seconds
net compute time = 1.872 seconds
***** TAK Benchmark ***
Tak
Iteration 0 of TAK
Timing for : TAK
Elapsed time = 0.514 seconds
net compute time = 0.514 seconds
Iteration 1 of TAK
Timing for : TAK
Elapsed time = 0.515 seconds
net compute time = 0.515 seconds
***** TAKL Benchmark ***
TakL
Iteration 0 of TAKL
Timing for : TAKL
Elapsed time = 3.898 seconds
net compute time = 3.898 seconds
Iteration 1 of TAKL
Timing for : TAKL
Elapsed time = 3.898 seconds
net compute time = 3.898 seconds
***** TAKR Benchmark ***
TakR
Iteration 0 of TAKR
Timing for : TAKR
Elapsed time = 0.703 seconds
net compute time = 0.703 seconds
Iteration 1 of TAKR
Timing for : TAKR
Elapsed time = 0.703 seconds
net compute time = 0.703 seconds
|
||||
@ -1 +0,0 @@
|
||||
Lisp Type: Xerox Lisp
Lisp Version: Lispcore sysout of 28-Jun-88 09:39:24
Software Type: Xerox AIE
Software Version: Lispcore sysout of 28-Jun-88 09:39:24, Make-init dates: 27-Jun-88 17:23:26, 27-Jun-88 17:33:19
Machine Type: Xerox 1132
Machine Version: Microcode version: 5682, memory size: 16384
Machine Instance: Amontillado = 12542500312#
Site: Unknown
Features: (:INTERLISP :XEROX :COMMON :IEEE-FLOATING-POINT)
***** CTAK Benchmark ***
CTak
Iteration 0 of CTAK
Timing for : CTAK
Elapsed time = 21.918 seconds
SWAP time = 0.089 seconds
net compute time = 21.829 seconds
Page faults = 4
Disk operations = 4
Iteration 1 of CTAK
Timing for : CTAK
Elapsed time = 21.826 seconds
net compute time = 21.826 seconds
***** STAK Benchmark ***
STak
Iteration 0 of STAK
Timing for : STAK
Elapsed time = 1.873 seconds
net compute time = 1.873 seconds
Iteration 1 of STAK
Timing for : STAK
Elapsed time = 1.872 seconds
net compute time = 1.872 seconds
***** TAK Benchmark ***
Tak
Iteration 0 of TAK
Timing for : TAK
Elapsed time = 0.514 seconds
net compute time = 0.514 seconds
Iteration 1 of TAK
Timing for : TAK
Elapsed time = 0.513 seconds
net compute time = 0.513 seconds
***** TAKL Benchmark ***
TakL
Iteration 0 of TAKL
Timing for : TAKL
Elapsed time = 3.815 seconds
net compute time = 3.815 seconds
Iteration 1 of TAKL
Timing for : TAKL
Elapsed time = 3.815 seconds
net compute time = 3.815 seconds
***** TAKR Benchmark ***
TakR
Iteration 0 of TAKR
Timing for : TAKR
Elapsed time = 0.917 seconds
SWAP time = 0.229 seconds
net compute time = 0.688 seconds
Page faults = 17
Disk operations = 17
Iteration 1 of TAKR
Timing for : TAKR
Elapsed time = 0.679 seconds
net compute time = 0.679 seconds
|
||||
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
@ -1 +0,0 @@
|
||||
Lisp Type: Xerox Lisp
Lisp Version: Medley sysout of 6-Jun-88 15:12:28
Software Type: Xerox AIE
Software Version: Medley sysout of 6-Jun-88 15:12:28, Make-init dates: 6-Jun-88 13:44:45, 6-Jun-88 13:55:29
Machine Type: Xerox 1186
Machine Version: Microcode version: 111, memory size: 7424
Machine Instance: Shih1186 = 25220200562#
Site: Unknown
Features: (:INTERLISP :XEROX :COMMON :IEEE-FLOATING-POINT)
***** PUZZLE Benchmark ***
Puzzle
Iteration 0 of PUZZLE
Success in 2005 trials.Timing for : PUZZLE
Elapsed time = 46.210 seconds
net compute time = 46.210 seconds
Storage allocated:
10 LISTP, 1 ONED-ARRAY
Iteration 1 of PUZZLE
Success in 2005 trials.Timing for : PUZZLE
Elapsed time = 46.207 seconds
net compute time = 46.207 seconds
Storage allocated:
10 LISTP, 1 ONED-ARRAY
***** TRIANG Benchmark ***
Triang
Iteration 0 of TRIANG
Timing for : TRIANG
Elapsed time = 822.291 seconds
SWAP time = 0.023 seconds
reclaim time = 0.601 seconds
net compute time = 821.667 seconds
Page faults = 71
Storage allocated:
11626 LISTP
Iteration 1 of TRIANG
Timing for : TRIANG
Elapsed time = 821.879 seconds
reclaim time = 0.592 seconds
net compute time = 821.287 seconds
Storage allocated:
11626 LISTP
***** FFT Benchmark ***
FFT
Iteration 0 of FFT
Timing for : FFT
Elapsed time = 248.317 seconds
SWAP time = 0.614 seconds
reclaim time = 137.099 seconds
net compute time = 110.604 seconds
Page faults = 43
Storage allocated:
942640 FLOATP
Iteration 1 of FFT
Timing for : FFT
Elapsed time = 247.126 seconds
reclaim time = 136.751 seconds
net compute time = 110.375 seconds
Storage allocated:
942640 FLOATP
|
||||
File diff suppressed because one or more lines are too long
@ -1 +0,0 @@
|
||||
Lisp Type: Xerox Lisp
Lisp Version: Medley sysout of 6-Jun-88 15:12:28
Software Type: Xerox AIE
Software Version: Medley sysout of 6-Jun-88 15:12:28, Make-init dates: 6-Jun-88 13:44:45, 6-Jun-88 13:55:29
Machine Type: Xerox 1186
Machine Version: Microcode version: 111, memory size: 7424
Machine Instance: Shih1186 = 25220200562#
Site: Unknown
Features: (:INTERLISP :XEROX :COMMON :IEEE-FLOATING-POINT)
***** CTAK Benchmark ***
CTak
Iteration 0 of CTAK
Timing for : CTAK
Elapsed time = 56.758 seconds
net compute time = 56.758 seconds
Iteration 1 of CTAK
Timing for : CTAK
Elapsed time = 56.757 seconds
net compute time = 56.757 seconds
***** STAK Benchmark ***
STak
Iteration 0 of STAK
Timing for : STAK
Elapsed time = 4.481 seconds
net compute time = 4.481 seconds
Iteration 1 of STAK
Timing for : STAK
Elapsed time = 4.482 seconds
net compute time = 4.482 seconds
***** TAK Benchmark ***
Tak
Iteration 0 of TAK
Timing for : TAK
Elapsed time = 1.632 seconds
net compute time = 1.632 seconds
Iteration 1 of TAK
Timing for : TAK
Elapsed time = 1.632 seconds
net compute time = 1.632 seconds
***** TAKL Benchmark ***
TakL
Iteration 0 of TAKL
Timing for : TAKL
Elapsed time = 13.413 seconds
net compute time = 13.413 seconds
Iteration 1 of TAKL
Timing for : TAKL
Elapsed time = 13.413 seconds
net compute time = 13.413 seconds
***** TAKR Benchmark ***
TakR
Iteration 0 of TAKR
Timing for : TAKR
Elapsed time = 1.713 seconds
net compute time = 1.713 seconds
Iteration 1 of TAKR
Timing for : TAKR
Elapsed time = 1.711 seconds
net compute time = 1.711 seconds
|
||||
@ -1 +0,0 @@
|
||||
Lisp Type: Xerox Lisp
Lisp Version: Lispcore sysout of 20-Jun-88 19:23:27
Software Type: Xerox AIE
Software Version: Lispcore sysout of 20-Jun-88 19:23:27, Make-init dates: 20-Jun-88 18:24:36, 20-Jun-88 18:34:47
Machine Type: MAIKO
Machine Version: Microcode version: 266, memory size: 16384
Machine Instance: ACobra = 200004000066660#
Site: Unknown
Features: (:INTERLISP :XEROX :COMMON :IEEE-FLOATING-POINT)
***** PUZZLE Benchmark ***
Puzzle
Iteration 0 of PUZZLE
Success in 2005 trials.Timing for : PUZZLE
Elapsed time = 71.640 seconds
SWAP time = 0.040 seconds
net compute time = 71.600 seconds
Storage allocated:
10 LISTP, 1 ONED-ARRAY
Iteration 1 of PUZZLE
Success in 2005 trials.Timing for : PUZZLE
Elapsed time = 71.640 seconds
SWAP time = 0.080 seconds
net compute time = 71.560 seconds
Storage allocated:
10 LISTP, 1 ONED-ARRAY
***** TRIANG Benchmark ***
Triang
Iteration 0 of TRIANG
Timing for : TRIANG
Elapsed time = 1486.440 seconds
SWAP time = 0.960 seconds
reclaim time = 1.440 seconds
net compute time = 1484.040 seconds
Iteration 1 of TRIANG
Timing for : TRIANG
Elapsed time = 1486.540 seconds
SWAP time = 1.080 seconds
reclaim time = 1.440 seconds
net compute time = 1484.020 seconds
Storage allocated:
11626 LISTP
***** FFT Benchmark ***
FFT
Iteration 0 of FFT
Timing for : FFT
Elapsed time = 343.640 seconds
SWAP time = 1.680 seconds
reclaim time = 234.820 seconds
net compute time = 107.140 seconds
Storage allocated:
942640 FLOATP
Iteration 1 of FFT
Timing for : FFT
Elapsed time = 343.620 seconds
SWAP time = 1.800 seconds
reclaim time = 234.860 seconds
net compute time = 106.960 seconds
Storage allocated:
942640 FLOATP
|
||||
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
@ -1 +0,0 @@
|
||||
Lisp Type: Xerox Lisp
Lisp Version: Lispcore sysout of 20-Jun-88 19:23:27
Software Type: Xerox AIE
Software Version: Lispcore sysout of 20-Jun-88 19:23:27, Make-init dates: 20-Jun-88 18:24:36, 20-Jun-88 18:34:47
Machine Type: MAIKO
Machine Version: Microcode version: 266, memory size: 16384
Machine Instance: ACobra = 200004000066660#
Site: Unknown
Features: (:INTERLISP :XEROX :COMMON :IEEE-FLOATING-POINT)
***** CTAK Benchmark ***
CTak
Iteration 0 of CTAK
Timing for : CTAK
Elapsed time = 96.440 seconds
SWAP time = 0.260 seconds
net compute time = 96.180 seconds
Iteration 1 of CTAK
Timing for : CTAK
Elapsed time = 95.540 seconds
SWAP time = 0.060 seconds
net compute time = 95.480 seconds
***** STAK Benchmark ***
STak
Iteration 0 of STAK
Timing for : STAK
Elapsed time = 11.280 seconds
SWAP time = 0.020 seconds
net compute time = 11.260 seconds
Iteration 1 of STAK
Timing for : STAK
Elapsed time = 11.180 seconds
SWAP time = 0.040 seconds
net compute time = 11.140 seconds
***** TAK Benchmark ***
Tak
Iteration 0 of TAK
Timing for : TAK
Elapsed time = 3.020 seconds
net compute time = 3.020 seconds
Iteration 1 of TAK
Timing for : TAK
Elapsed time = 3.100 seconds
SWAP time = 0.020 seconds
net compute time = 3.080 seconds
***** TAKL Benchmark ***
TakL
Iteration 0 of TAKL
Timing for : TAKL
Elapsed time = 18.980 seconds
SWAP time = 0.040 seconds
net compute time = 18.940 seconds
Iteration 1 of TAKL
Timing for : TAKL
Elapsed time = 18.960 seconds
SWAP time = 0.020 seconds
net compute time = 18.940 seconds
***** TAKR Benchmark ***
TakR
Iteration 0 of TAKR
Timing for : TAKR
Elapsed time = 3.340 seconds
net compute time = 3.340 seconds
Iteration 1 of TAKR
Timing for : TAKR
Elapsed time = 3.340 seconds
net compute time = 3.340 seconds
|
||||
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
@ -1 +0,0 @@
|
||||
Lisp Type: Xerox Lisp
Lisp Version: Lispcore sysout of 3-Aug-88 00:55:00
Software Type: Xerox AIE
Software Version: Lispcore sysout of 3-Aug-88 00:55:00, Make-init dates: 31-Jul-88 18:16:30, 31-Jul-88 18:26:32
Machine Type: mc68020
Machine Version: Microcode version: 349, memory size: 16384
Machine Instance: 1300283a trouser
Site: trouser
Features: (:INTERLISP :XEROX :COMMON :IEEE-FLOATING-POINT)
***** FPRINT Benchmark ***
FPrint
Iteration 0 of FPRINT
Timing for : FPRINT
Elapsed time = 15.840 seconds
SWAP time = 0.560 seconds
net compute time = 15.280 seconds
Page faults = 22
Swap writes = 8
Disk operations = 6
Storage allocated:
22 FIXP, 105 LISTP, 1 STREAM, 31 ONED-ARRAY, 1 PATHNAME
Iteration 1 of FPRINT
Timing for : FPRINT
Elapsed time = 15.020 seconds
SWAP time = 0.420 seconds
net compute time = 14.600 seconds
Page faults = 1
Swap writes = 1
Disk operations = 4
Storage allocated:
19 FIXP, 128 LISTP, 1 STREAM, 44 ONED-ARRAY, 2 PATHNAME
***** FREAD Benchmark ***
FRead
Iteration 0 of FREAD
In IL:\\EOSERROR:
End of file IL:|{DSK}/users/hayata/fprint.tst;2|
12: ^
|
||||
@ -1 +0,0 @@
|
||||
Lisp Type: Xerox Lisp
Lisp Version: Lispcore sysout of 3-Aug-88 00:55:00
Software Type: Xerox AIE
Software Version: Lispcore sysout of 3-Aug-88 00:55:00, Make-init dates: 31-Jul-88 18:16:30, 31-Jul-88 18:26:32
Machine Type: mc68020
Machine Version: Microcode version: 349, memory size: 16384
Machine Instance: 1300283a trouser
Site: trouser
Features: (:INTERLISP :XEROX :COMMON :IEEE-FLOATING-POINT)
***** PUZZLE Benchmark ***
Puzzle
Iteration 0 of PUZZLE
Success in 2005 trials.Timing for : PUZZLE
Elapsed time = 63.360 seconds
SWAP time = 0.140 seconds
net compute time = 63.220 seconds
Page faults = 6
Swap writes = 4
Storage allocated:
1 FIXP, 10 LISTP, 1 ONED-ARRAY
Iteration 1 of PUZZLE
Success in 2005 trials.Timing for : PUZZLE
Elapsed time = 63.180 seconds
SWAP time = 0.040 seconds
net compute time = 63.140 seconds
Storage allocated:
1 FIXP, 10 LISTP, 1 ONED-ARRAY
***** TRIANG Benchmark ***
Triang
Iteration 0 of TRIANG
Timing for : TRIANG
Elapsed time = 1143.400 seconds
SWAP time = 1.980 seconds
reclaim time = 1.500 seconds
net compute time = 1139.920 seconds
Page faults = 1
Storage allocated:
11626 LISTP
Iteration 1 of TRIANG
Timing for : TRIANG
Elapsed time = 1142.600 seconds
SWAP time = 1.300 seconds
reclaim time = 1.520 seconds
net compute time = 1139.780 seconds
Storage allocated:
11626 LISTP
***** FFT Benchmark ***
FFT
Iteration 0 of FFT
Timing for : FFT
Elapsed time = 309.880 seconds
SWAP time = 1.400 seconds
reclaim time = 220.720 seconds
net compute time = 87.760 seconds
Page faults = 2
Swap writes = 2
Storage allocated:
942640 FLOATP
Iteration 1 of FFT
Timing for : FFT
Elapsed time = 310.180 seconds
SWAP time = 1.560 seconds
reclaim time = 220.940 seconds
net compute time = 87.680 seconds
Storage allocated:
942640 FLOATP
|
||||
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
@ -1 +0,0 @@
|
||||
Lisp Type: Xerox Lisp
Lisp Version: Lispcore sysout of 29-Jun-88 20:57:46
Software Type: Xerox AIE
Software Version: Lispcore sysout of 29-Jun-88 20:57:46, Make-init dates: 29-Jun-88 19:12:47, 29-Jun-88 19:22:47
Machine Type: MAIKO
Machine Version: Microcode version: 260, memory size: 16384
Machine Instance: ACobra = 200004000066660#
Site: Unknown
Features: (:INTERLISP :XEROX :COMMON :IEEE-FLOATING-POINT)
***** FLEGALS-SORT-TEST Benchmark ***
Bob Flegal's SORT benchmark; runs on a 3/160 in 10.21s Lucid, 11.04s Franz.
Iteration 0 of FLEGALS-SORT-TEST
Timing for : IL:FLEGALS-SORT-TEST
Elapsed time = 181.100 seconds
SWAP time = 0.220 seconds
reclaim time = 19.360 seconds
net compute time = 161.520 seconds
Storage allocated:
1 COMPILED-CLOSURE
Iteration 1 of FLEGALS-SORT-TEST
Timing for : IL:FLEGALS-SORT-TEST
Elapsed time = 173.200 seconds
SWAP time = 0.080 seconds
reclaim time = 12.080 seconds
net compute time = 161.040 seconds
Storage allocated:
40000 LISTP
|
||||
File diff suppressed because one or more lines are too long
@ -1 +0,0 @@
|
||||
Lisp Type: Envos Medley
Lisp Version: Lispcore 1.0 sysout of 18-Apr-90 10:37:55
Software Type: Envos Medley
Software Version: Lispcore 1.0 sysout of 18-Apr-90 10:37:55, Make-init dates: 17-Apr-90 20:12:20, 17-Apr-90 20:30:18
Machine Type: mc68020cal/lde/lispcore/gabriel/TOOLS/BENCH-1
Machine Version: Emulator created: 9-May-90, memory size: 0
Machine Instance: 31000c9fal/lde/lispcore/gabriel/TOOLS/BENCH-1 pigmyc9fal/lde/lispcore/gabriel/TOOLS/BENCH-1
Site: ENVOS Corporation
Features: (:INTERLISP :XEROX :COMMON :IEEE-FLOATING-POINT)
***** CTAK Benchmark ***
CTak
Iteration 0 of CTAK
Timing for : CTAK
Elapsed time = 82.806 seconds
SWAP time = 0.080 seconds
reclaim time = 5.420 seconds
net compute time = 77.306 seconds
Iteration 1 of CTAK
Timing for : CTAK
Elapsed time = 82.000 seconds
SWAP time = 0.060 seconds
reclaim time = 5.360 seconds
net compute time = 76.580 seconds
***** STAK Benchmark ***
STak
Iteration 0 of STAK
Timing for : STAK
Elapsed time = 15.420 seconds
net compute time = 15.420 seconds
Iteration 1 of STAK
Timing for : STAK
Elapsed time = 15.420 seconds
net compute time = 15.420 seconds
***** TAK Benchmark ***
Tak
Iteration 0 of TAK
Timing for : TAK
Elapsed time = 2.760 seconds
net compute time = 2.760 seconds
Iteration 1 of TAK
Timing for : TAK
Elapsed time = 2.740 seconds
net compute time = 2.740 seconds
***** TAKL Benchmark ***
TakL
Iteration 0 of TAKL
Timing for : TAKL
Elapsed time = 21.400 seconds
SWAP time = 0.020 seconds
net compute time = 21.380 seconds
Iteration 1 of TAKL
Timing for : TAKL
Elapsed time = 21.400 seconds
net compute time = 21.400 seconds
***** TAKR Benchmark ***
TakR
Iteration 0 of TAKR
Timing for : TAKR
Elapsed time = 3.220 seconds
net compute time = 3.220 seconds
Iteration 1 of TAKR
Timing for : TAKR
Elapsed time = 3.200 seconds
net compute time = 3.200 seconds
|
||||
@ -1 +0,0 @@
|
||||
Lisp Type: Envos Medley
Lisp Version: Lispcore 1.0 sysout of 18-Apr-90 10:37:55
Software Type: Envos Medley
Software Version: Lispcore 1.0 sysout of 18-Apr-90 10:37:55, Make-init dates: 17-Apr-90 20:12:20, 17-Apr-90 20:30:18
Machine Type: mc68020cal/lde/lispcore/gabriel/TOOLS/BENCH-1
Machine Version: Emulator created: 9-May-90, memory size: 0
Machine Instance: 31000c9fal/lde/lispcore/gabriel/TOOLS/BENCH-1 pigmyc9fal/lde/lispcore/gabriel/TOOLS/BENCH-1
Site: ENVOS Corporation
Features: (:INTERLISP :XEROX :COMMON :IEEE-FLOATING-POINT)
***** CTAK Benchmark ***
CTak
Iteration 0 of CTAK
Timing for : CTAK
Elapsed time = 82.806 seconds
SWAP time = 0.080 seconds
reclaim time = 5.420 seconds
net compute time = 77.306 seconds
Iteration 1 of CTAK
Timing for : CTAK
Elapsed time = 82.000 seconds
SWAP time = 0.060 seconds
reclaim time = 5.360 seconds
net compute time = 76.580 seconds
***** STAK Benchmark ***
STak
Iteration 0 of STAK
Timing for : STAK
Elapsed time = 15.420 seconds
net compute time = 15.420 seconds
Iteration 1 of STAK
Timing for : STAK
Elapsed time = 15.420 seconds
net compute time = 15.420 seconds
***** TAK Benchmark ***
Tak
Iteration 0 of TAK
Timing for : TAK
Elapsed time = 2.760 seconds
net compute time = 2.760 seconds
Iteration 1 of TAK
Timing for : TAK
Elapsed time = 2.740 seconds
net compute time = 2.740 seconds
***** TAKL Benchmark ***
TakL
Iteration 0 of TAKL
Timing for : TAKL
Elapsed time = 21.400 seconds
SWAP time = 0.020 seconds
net compute time = 21.380 seconds
Iteration 1 of TAKL
Timing for : TAKL
Elapsed time = 21.400 seconds
net compute time = 21.400 seconds
***** TAKR Benchmark ***
TakR
Iteration 0 of TAKR
Timing for : TAKR
Elapsed time = 3.220 seconds
net compute time = 3.220 seconds
Iteration 1 of TAKR
Timing for : TAKR
Elapsed time = 3.200 seconds
net compute time = 3.200 seconds
|
||||
@ -1 +0,0 @@
|
||||
Lisp Type: Xerox Lisp
Lisp Version: Lispcore sysout of 3-Aug-88 00:55:00
Software Type: Xerox AIE
Software Version: Lispcore sysout of 3-Aug-88 00:55:00, Make-init dates: 31-Jul-88 18:16:30, 31-Jul-88 18:26:32
Machine Type: mc68020
Machine Version: Microcode version: 349, memory size: 16384
Machine Instance: 1300283a trouser
Site: trouser
Features: (:INTERLISP :XEROX :COMMON :IEEE-FLOATING-POINT)
***** CTAK Benchmark ***
CTak
Iteration 0 of CTAK
Timing for : CTAK
Elapsed time = 79.160 seconds
SWAP time = 0.080 seconds
reclaim time = 12.960 seconds
net compute time = 66.120 seconds
Page faults = 1
Iteration 1 of CTAK
Timing for : CTAK
Elapsed time = 79.220 seconds
SWAP time = 0.120 seconds
reclaim time = 13.040 seconds
net compute time = 66.060 seconds
***** STAK Benchmark ***
STak
Iteration 0 of STAK
Timing for : STAK
Elapsed time = 10.040 seconds
SWAP time = 0.020 seconds
net compute time = 10.020 seconds
Iteration 1 of STAK
Timing for : STAK
Elapsed time = 10.040 seconds
net compute time = 10.040 seconds
***** TAK Benchmark ***
Tak
Iteration 0 of TAK
Timing for : TAK
Elapsed time = 2.640 seconds
net compute time = 2.640 seconds
Iteration 1 of TAK
Timing for : TAK
Elapsed time = 2.640 seconds
net compute time = 2.640 seconds
***** TAKL Benchmark ***
TakL
Iteration 0 of TAKL
Timing for : TAKL
Elapsed time = 20.320 seconds
net compute time = 20.320 seconds
Iteration 1 of TAKL
Timing for : TAKL
Elapsed time = 20.320 seconds
net compute time = 20.320 seconds
***** TAKR Benchmark ***
TakR
Iteration 0 of TAKR
Timing for : TAKR
Elapsed time = 2.860 seconds
net compute time = 2.860 seconds
Page faults = 1
Iteration 1 of TAKR
Timing for : TAKR
Elapsed time = 2.840 seconds
net compute time = 2.840 seconds
|
||||
@ -1 +0,0 @@
|
||||
Lisp Type: Venue Medley
Lisp Version: Medley3.5 2.0 sysout of 13-Aug-2020 12:39:12
Software Type: Envos Medley
Software Version: Medley3.5 2.0 sysout of 13-Aug-2020 12:39:12, Make-init dates: 10-Apr-2000 01:42:43, 10-Apr-2000 01:46:59
Machine Type: mc68020
Machine Version: Emulator created: 10-Oct-20, memory size: 0
Machine Instance: 7f0101 TV-PC
Site: Unknown
Features: (:INTERLISP :XEROX :COMMON :IEEE-FLOATING-POINT :MEDLEY)
***** CTAK Benchmark ***
CTak
Iteration 0 of CTAK
Breakpoint at CL::TIME-FORMAT.
2/357: ?=
Arg 0 = #<Output Display Stream/143,75520>
Arg 1 = "Timing for ~[~;~:;~:* ~D x~]:~20T ~S~&"
Arg 2 = 1
Arg 3 = CTAK
2/358: eval
Timing for : CTAK
NIL
2/359: ok
Breakpoint at CL::TIME-FORMAT.
2/360: eval
Elapsed time = 0.079 seconds
NIL
2/361: ?=
Arg 0 = #<Output Display Stream/143,75520>
Arg 1 = "~&~A ~20,5T= ~9,3F seconds~&"
Arg 2 = "Elapsed time"
Arg 3 = 0.079
2/362: editf(cl:run-benchmarks)
External symbol RUN-BENCHMARKS not found in package LISP
EDITF -> IL:EDITF ? ...yes
Could not find fns definition for NIL.
Could not find fns definition for
NIL
2/363: eval
Elapsed time = 0.079 seconds
NIL
2/364: evl
EVL is an unbound variable.
2/365: ?=
Arg 0 = #<Output Display Stream/143,75520>
Arg 1 = "~&~A ~20,5T= ~9,3F seconds~&"
Arg 2 = "Elapsed time"
Arg 3 = 0.079
2/366: ub
(CL::TIME-FORMAT)
2/367: undo
No undo info saved for UB.
2/368: redo il:break
(CL::TIME-FORMAT)
2/369: ok
Breakpoint at CL::TIME-FORMAT.
2/370: ?=
Arg 0 = #<Output Display Stream/143,75520>
Arg 1 = "~&~A ~20,5T= ~9,3F seconds~&"
Arg 2 = "reclaim time"
Arg 3 = 0.017
2/371: ib
IB is an unbound variable.
2/372: ub
(CL::TIME-FORMAT)
2/373: ok
reclaim time = 0.017 seconds
net compute time = 0.062 seconds
Storage allocated:
238535 FIXP
Iteration 1 of CTAK
Timing for : CTAK
Elapsed time = 0.091 seconds
reclaim time = 0.007 seconds
net compute time = 0.084 seconds
Storage allocated:
238535 FIXP
***** STAK Benchmark ***
STak
Iteration 0 of STAK
Timing for : STAK
Elapsed time = 0.009 seconds
net compute time = 0.009 seconds
Iteration 1 of STAK
Timing for : STAK
Elapsed time = 0.008 seconds
SWAP time = 0.006 seconds
net compute time = 0.002 seconds
***** TAK Benchmark ***
Tak
Iteration 0 of TAK
Timing for : TAK
Elapsed time = 0.001 seconds
net compute time = 0.001 seconds
Iteration 1 of TAK
Timing for : TAK
Elapsed time = 0.002 seconds
SWAP time = 0.002 seconds
net compute time = 0.0 seconds
***** TAKL Benchmark ***
TakL
Iteration 0 of TAKL
Timing for : TAKL
Elapsed time = 0.013 seconds
net compute time = 0.013 seconds
Iteration 1 of TAKL
Timing for : TAKL
Elapsed time = 0.014 seconds
net compute time = 0.014 seconds
***** TAKR Benchmark ***
TakR
Iteration 0 of TAKR
Timing for : TAKR
Elapsed time = 0.002 seconds
net compute time = 0.002 seconds
Iteration 1 of TAKR
Timing for : TAKR
Elapsed time = 0.002 seconds
net compute time = 0.002 seconds
|
||||
@ -1 +0,0 @@
|
||||
Lisp Type: Venue Medley
Lisp Version: Medley3.5 2.0 sysout of 13-Aug-2020 12:39:12
Software Type: Envos Medley
Software Version: Medley3.5 2.0 sysout of 13-Aug-2020 12:39:12, Make-init dates: 10-Apr-2000 01:42:43, 10-Apr-2000 01:46:59
Machine Type: mc68020
Machine Version: Emulator created: 10-Oct-20, memory size: 0
Machine Instance: 7f0101 TV-PC
Site: Unknown
Features: (:INTERLISP :XEROX :COMMON :IEEE-FLOATING-POINT :MEDLEY)
***** CTAK Benchmark ***
CTak
Iteration 0 of CTAK
Timing for : CTAK
Elapsed time = 0.075 seconds
reclaim time = 0.011 seconds
net compute time = 0.064 seconds
Storage allocated:
238535 FIXP
Iteration 1 of CTAK
Timing for : CTAK
Elapsed time = 0.099 seconds
reclaim time = 0.014 seconds
net compute time = 0.085 seconds
Storage allocated:
238535 FIXP
***** STAK Benchmark ***
STak
Iteration 0 of STAK
Timing for : STAK
Elapsed time = 0.009 seconds
net compute time = 0.009 seconds
Iteration 1 of STAK
Timing for : STAK
Elapsed time = 0.008 seconds
net compute time = 0.008 seconds
***** TAK Benchmark ***
Tak
Iteration 0 of TAK
Timing for : TAK
Elapsed time = 0.002 seconds
net compute time = 0.002 seconds
Iteration 1 of TAK
Timing for : TAK
Elapsed time = 0.002 seconds
net compute time = 0.002 seconds
***** TAKL Benchmark ***
TakL
Iteration 0 of TAKL
Timing for : TAKL
Elapsed time = 0.012 seconds
net compute time = 0.012 seconds
Iteration 1 of TAKL
Timing for : TAKL
Elapsed time = 0.012 seconds
net compute time = 0.012 seconds
***** TAKR Benchmark ***
TakR
Iteration 0 of TAKR
Timing for : TAKR
Elapsed time = 0.002 seconds
net compute time = 0.002 seconds
Iteration 1 of TAKR
Timing for : TAKR
Elapsed time = 0.003 seconds
net compute time = 0.003 seconds
|
||||
@ -1 +0,0 @@
|
||||
Lisp Type: Venue Medley
Lisp Version: Medley3.5 2.0 sysout of 13-Aug-2020 12:39:12
Software Type: Envos Medley
Software Version: Medley3.5 2.0 sysout of 13-Aug-2020 12:39:12, Make-init dates: 10-Apr-2000 01:42:43, 10-Apr-2000 01:46:59
Machine Type: mc68020
Machine Version: Emulator created: 10-Oct-20, memory size: 0
Machine Instance: 7f0101 TV-PC
Site: Unknown
Features: (:INTERLISP :XEROX :COMMON :IEEE-FLOATING-POINT :MEDLEY)
***** CTAK Benchmark ***
CTak
Iteration 0 of CTAK
Breakpoint at CL::TIME-FORMAT.
2/357: ?=
Arg 0 = #<Output Display Stream/143,75520>
Arg 1 = "Timing for ~[~;~:;~:* ~D x~]:~20T ~S~&"
Arg 2 = 1
Arg 3 = CTAK
2/358: eval
Timing for : CTAK
NIL
2/359: ok
Breakpoint at CL::TIME-FORMAT.
2/360: eval
Elapsed time = 0.079 seconds
NIL
2/361: ?=
Arg 0 = #<Output Display Stream/143,75520>
Arg 1 = "~&~A ~20,5T= ~9,3F seconds~&"
Arg 2 = "Elapsed time"
Arg 3 = 0.079
2/362: editf(cl:run-benchmarks)
External symbol RUN-BENCHMARKS not found in package LISP
EDITF -> IL:EDITF ? ...yes
Could not find fns definition for NIL.
Could not find fns definition for
NIL
2/363: eval
Elapsed time = 0.079 seconds
NIL
2/364: evl
EVL is an unbound variable.
2/365: ?=
Arg 0 = #<Output Display Stream/143,75520>
Arg 1 = "~&~A ~20,5T= ~9,3F seconds~&"
Arg 2 = "Elapsed time"
Arg 3 = 0.079
2/366: ub
(CL::TIME-FORMAT)
2/367: undo
No undo info saved for UB.
2/368: redo il:break
(CL::TIME-FORMAT)
2/369: ok
Breakpoint at CL::TIME-FORMAT.
2/370: ?=
Arg 0 = #<Output Display Stream/143,75520>
Arg 1 = "~&~A ~20,5T= ~9,3F seconds~&"
Arg 2 = "reclaim time"
Arg 3 = 0.017
2/371: ib
IB is an unbound variable.
2/372: ub
(CL::TIME-FORMAT)
2/373: ok
reclaim time = 0.017 seconds
net compute time = 0.062 seconds
Storage allocated:
238535 FIXP
Iteration 1 of CTAK
Timing for : CTAK
Elapsed time = 0.091 seconds
reclaim time = 0.007 seconds
net compute time = 0.084 seconds
Storage allocated:
238535 FIXP
***** STAK Benchmark ***
STak
Iteration 0 of STAK
Timing for : STAK
Elapsed time = 0.009 seconds
net compute time = 0.009 seconds
Iteration 1 of STAK
Timing for : STAK
Elapsed time = 0.008 seconds
SWAP time = 0.006 seconds
net compute time = 0.002 seconds
***** TAK Benchmark ***
Tak
Iteration 0 of TAK
Timing for : TAK
Elapsed time = 0.001 seconds
net compute time = 0.001 seconds
Iteration 1 of TAK
Timing for : TAK
Elapsed time = 0.002 seconds
SWAP time = 0.002 seconds
net compute time = 0.0 seconds
***** TAKL Benchmark ***
TakL
Iteration 0 of TAKL
Timing for : TAKL
Elapsed time = 0.013 seconds
net compute time = 0.013 seconds
Iteration 1 of TAKL
Timing for : TAKL
Elapsed time = 0.014 seconds
net compute time = 0.014 seconds
***** TAKR Benchmark ***
TakR
Iteration 0 of TAKR
Timing for : TAKR
Elapsed time = 0.002 seconds
net compute time = 0.002 seconds
Iteration 1 of TAKR
Timing for : TAKR
Elapsed time = 0.002 seconds
net compute time = 0.002 seconds
|
||||
@ -1 +0,0 @@
|
||||
Lisp Type: Venue Medley
Lisp Version: Medley3.5 2.0 sysout of 13-Aug-2020 12:39:12
Software Type: Envos Medley
Software Version: Medley3.5 2.0 sysout of 13-Aug-2020 12:39:12, Make-init dates: 10-Apr-2000 01:42:43, 10-Apr-2000 01:46:59
Machine Type: mc68020
Machine Version: Emulator created: 10-Oct-20, memory size: 0
Machine Instance: 7f0101 TV-PC
Site: Unknown
Features: (:INTERLISP :XEROX :COMMON :IEEE-FLOATING-POINT :MEDLEY)
***** PUZZLE Benchmark ***
Puzzle
Iteration 0 of PUZZLE
Success in 2005 trials.Timing for : PUZZLE
Elapsed time = 0.039 seconds
net compute time = 0.039 seconds
Storage allocated:
1 FIXP, 10 LISTP, 1 ONED-ARRAY
Iteration 1 of PUZZLE
Success in 2005 trials.Timing for : PUZZLE
Elapsed time = 0.041 seconds
net compute time = 0.041 seconds
Storage allocated:
1 FIXP, 10 LISTP, 1 ONED-ARRAY
***** TRIANG Benchmark ***
Triang
Iteration 0 of TRIANG
Timing for : TRIANG
Elapsed time = 0.571 seconds
net compute time = 0.571 seconds
Storage allocated:
11626 LISTP
Iteration 1 of TRIANG
Timing for : TRIANG
Elapsed time = 0.572 seconds
net compute time = 0.572 seconds
***** FFT Benchmark ***
FFT
Iteration 0 of FFT
Timing for : FFT
Elapsed time = 0.074 seconds
SWAP time = 0.010 seconds
reclaim time = 0.038 seconds
net compute time = 0.026 seconds
Storage allocated:
944500 FLOATP
Iteration 1 of FFT
Timing for : FFT
Elapsed time = 0.097 seconds
reclaim time = 0.059 seconds
net compute time = 0.038 seconds
Storage allocated:
944500 FLOATP
|
||||
File diff suppressed because one or more lines are too long
@ -1 +0,0 @@
|
||||
Lisp Type: Venue Medley
Lisp Version: Medley3.5 2.0 sysout of 13-Aug-2020 12:39:12
Software Type: Envos Medley
Software Version: Medley3.5 2.0 sysout of 13-Aug-2020 12:39:12, Make-init dates: 10-Apr-2000 01:42:43, 10-Apr-2000 01:46:59
Machine Type: mc68020
Machine Version: Emulator created: 10-Oct-20, memory size: 0
Machine Instance: 7f0101 TV-PC
Site: Unknown
Features: (:INTERLISP :XEROX :COMMON :IEEE-FLOATING-POINT :MEDLEY)
***** CTAK Benchmark ***
CTak
Iteration 0 of CTAK
Timing for : CTAK
Elapsed time = 0.076 seconds
reclaim time = 0.012 seconds
net compute time = 0.064 seconds
Storage allocated:
238535 FIXP
Iteration 1 of CTAK
Timing for : CTAK
Elapsed time = 0.086 seconds
reclaim time = 0.017 seconds
net compute time = 0.069 seconds
Storage allocated:
238535 FIXP
***** STAK Benchmark ***
STak
Iteration 0 of STAK
Timing for : STAK
Elapsed time = 0.008 seconds
net compute time = 0.008 seconds
Iteration 1 of STAK
Timing for : STAK
Elapsed time = 0.008 seconds
net compute time = 0.008 seconds
***** TAK Benchmark ***
Tak
Iteration 0 of TAK
Timing for : TAK
Elapsed time = 0.002 seconds
net compute time = 0.002 seconds
Iteration 1 of TAK
Timing for : TAK
Elapsed time = 0.002 seconds
net compute time = 0.002 seconds
***** TAKL Benchmark ***
TakL
Iteration 0 of TAKL
Timing for : TAKL
Elapsed time = 0.013 seconds
net compute time = 0.013 seconds
Iteration 1 of TAKL
Timing for : TAKL
Elapsed time = 0.012 seconds
SWAP time = 0.006 seconds
net compute time = 0.006 seconds
***** TAKR Benchmark ***
TakR
Iteration 0 of TAKR
Timing for : TAKR
Elapsed time = 0.001 seconds
net compute time = 0.001 seconds
Iteration 1 of TAKR
Timing for : TAKR
Elapsed time = 0.002 seconds
net compute time = 0.002 seconds
|
||||
@ -1 +0,0 @@
|
||||
Lisp Type: Venue Medley
Lisp Version: Medley3.5 2.0 sysout of 13-Aug-2020 12:39:12
Software Type: Envos Medley
Software Version: Medley3.5 2.0 sysout of 13-Aug-2020 12:39:12, Make-init dates: 10-Apr-2000 01:42:43, 10-Apr-2000 01:46:59
Machine Type: mc68020
Machine Version: Emulator created: 10-Oct-20, memory size: 0
Machine Instance: 7f0101 TV-PC
Site: Unknown
Features: (:INTERLISP :XEROX :COMMON :IEEE-FLOATING-POINT :MEDLEY)
***** DERIV Benchmark ***
Deriv
Iteration 0 of DERIV
Timing for : DERIV
Elapsed time = 0.033 seconds
reclaim time = 0.014 seconds
net compute time = 0.019 seconds
Iteration 1 of DERIV
Timing for : DERIV
Elapsed time = 0.038 seconds
reclaim time = 0.018 seconds
net compute time = 0.020 seconds
Storage allocated:
48392 LISTP
***** DDERIV Benchmark ***
DDeriv
Evaluating setup for DDERIV
Iteration 0 of DDERIV
Timing for : DDERIV
Elapsed time = 0.046 seconds
reclaim time = 0.020 seconds
net compute time = 0.026 seconds
Iteration 1 of DDERIV
Timing for : DDERIV
Elapsed time = 0.047 seconds
reclaim time = 0.021 seconds
net compute time = 0.026 seconds
Storage allocated:
63392 LISTP
***** DIV2-1 Benchmark ***
Div2, Iterative
Iteration 0 of DIV2-1
Timing for : DIV2-1
Elapsed time = 0.008 seconds
net compute time = 0.008 seconds
Iteration 1 of DIV2-1
Timing for : DIV2-1
Elapsed time = 0.008 seconds
net compute time = 0.008 seconds
***** DIV2-2 Benchmark ***
Div2, Recursive
Iteration 0 of DIV2-2
Timing for : DIV2-2
Elapsed time = 0.009 seconds
net compute time = 0.009 seconds
Storage allocated:
54464 LISTP
Iteration 1 of DIV2-2
Timing for : DIV2-2
Elapsed time = 0.010 seconds
net compute time = 0.010 seconds
***** DESTRU Benchmark ***
Destruct
Iteration 0 of DESTRU
Timing for : DESTRU
Elapsed time = 0.016 seconds
reclaim time = 0.003 seconds
net compute time = 0.013 seconds
Iteration 1 of DESTRU
Timing for : DESTRU
Elapsed time = 0.016 seconds
reclaim time = 0.004 seconds
net compute time = 0.012 seconds
Storage allocated:
43105 LISTP
***** BOYER Benchmark ***
Boyer
Evaluating setup for BOYER
Iteration 0 of BOYER
Timing for : BOYER
Elapsed time = 0.071 seconds
reclaim time = 0.020 seconds
net compute time = 0.051 seconds
Storage allocated:
29856 LISTP
Iteration 1 of BOYER
Timing for : BOYER
Elapsed time = 0.072 seconds
reclaim time = 0.018 seconds
net compute time = 0.054 seconds
Storage allocated:
29856 LISTP
***** BROWSE Benchmark ***
Browse
Iteration 0 of BROWSE
Timing for : BROWSE
Elapsed time = 0.340 seconds
reclaim time = 0.124 seconds
net compute time = 0.216 seconds
Storage allocated:
97931 LISTP, 229002 ONED-ARRAY, 1101 NEW-ATOM
Iteration 1 of BROWSE
Timing for : BROWSE
Elapsed time = 0.377 seconds
reclaim time = 0.129 seconds
net compute time = 0.248 seconds
Storage allocated:
163467 LISTP, 229002 ONED-ARRAY, 1101 NEW-ATOM
***** BROWSE* Benchmark ***
Browse
Iteration 0 of BROWSE*
Timing for : BROWSE*
Elapsed time = 0.271 seconds
reclaim time = 0.113 seconds
net compute time = 0.158 seconds
Storage allocated:
97931 LISTP, 2202 ONED-ARRAY, 1101 NEW-ATOM
Iteration 1 of BROWSE*
Timing for : BROWSE*
Elapsed time = 0.248 seconds
reclaim time = 0.101 seconds
net compute time = 0.147 seconds
Storage allocated:
163467 LISTP, 2202 ONED-ARRAY, 1101 NEW-ATOM
***** TRAVERSE-INIT* Benchmark ***
Traverse, Initialize
Iteration 0 of TRAVERSE-INIT*
Timing for : TRAVERSE-INIT*
Elapsed time = 0.063 seconds
net compute time = 0.063 seconds
Storage allocated:
36796 LISTP, 100 TNODE
Evaluating after every function for TRAVERSE-INIT*
Iteration 1 of TRAVERSE-INIT*
Timing for : TRAVERSE-INIT*
Elapsed time = 0.053 seconds
net compute time = 0.053 seconds
Storage allocated:
100 TNODE
Evaluating after every function for TRAVERSE-INIT*
***** TRAVERSE* Benchmark ***
Traverse, Traverse
Evaluating setup for TRAVERSE*
Iteration 0 of TRAVERSE*
Timing for : TRAVERSE*
Elapsed time = 0.114 seconds
net compute time = 0.114 seconds
Iteration 1 of TRAVERSE*
Timing for : TRAVERSE*
Elapsed time = 0.113 seconds
net compute time = 0.113 seconds
Evaluating after function for TRAVERSE*
|
||||
File diff suppressed because one or more lines are too long
@ -1 +0,0 @@
|
||||
Lisp Type: Xerox Lisp
Lisp Version: Medley sysout of 15-Mar-88 18:32:37
Software Type: Xerox AIE
Software Version: Medley sysout of 15-Mar-88 18:32:37, Make-init dates: 15-Mar-88 16:19:01, 15-Mar-88 16:38:25
Machine Type: Xerox 1186
Machine Version: Microcode version: 107, memory size: 7424
Machine Instance: Wills1186 = 25220220072#
Site: Unknown
Features: (:INTERLISP :XEROX :COMMON :IEEE-FLOATING-POINT)
***** PUZZLE Benchmark ***
Puzzle
Iteration 0 of PUZZLE
Success in 2005 trials.Timing for : PUZZLE
Elapsed time = 46.241 seconds
net compute time = 46.270 seconds
Storage allocated:
10 LISTP, 1 ONED-ARRAY
Iteration 1 of PUZZLE
Success in 2005 trials.Timing for : PUZZLE
Elapsed time = 46.279 seconds
net compute time = 46.279 seconds
Storage allocated:
10 LISTP, 1 ONED-ARRAY
***** TRIANG Benchmark ***
Triang
Iteration 0 of TRIANG
Timing for : TRIANG
Elapsed time = 829.979 seconds
reclaim time = 0.565 seconds
net compute time = 829.414 seconds
Page faults = 79
Storage allocated:
11626 LISTP
Iteration 1 of TRIANG
Timing for : TRIANG
Elapsed time = 828.981 seconds
reclaim time = 0.550 seconds
net compute time = 828.431 seconds
Storage allocated:
11626 LISTP
***** FFT Benchmark ***
FFT
Iteration 0 of FFT
Timing for : FFT
Elapsed time = 206.390 seconds
SWAP time = 0.213 seconds
reclaim time = 115.504 seconds
net compute time = 90.673 seconds
Page faults = 31
Storage allocated:
942640 FLOATP
Iteration 1 of FFT
Timing for : FFT
Elapsed time = 205.926 seconds
reclaim time = 115.455 seconds
net compute time = 90.471 seconds
Storage allocated:
942640 FLOATP
|
||||
@ -1 +0,0 @@
|
||||
Lisp Type: Xerox Lisp
Lisp Version: Medley sysout of 15-Mar-88 18:32:37
Software Type: Xerox AIE
Software Version: Medley sysout of 15-Mar-88 18:32:37, Make-init dates: 15-Mar-88 16:19:01, 15-Mar-88 16:38:25
Machine Type: Xerox 1186
Machine Version: Microcode version: 107, memory size: 7424
Machine Instance: Wills1186 = 25220220072#
Site: Unknown
Features: (:INTERLISP :XEROX :COMMON :IEEE-FLOATING-POINT)
***** DERIV Benchmark ***
Deriv
Iteration 0 of DERIV
Timing for : DERIV
Elapsed time = 69.577 seconds
reclaim time = 46.420 seconds
net compute time = 23.157 seconds
Storage allocated:
245000 LISTP
Iteration 1 of DERIV
Timing for : DERIV
Elapsed time = 69.236 seconds
reclaim time = 46.056 seconds
net compute time = 23.180 seconds
Storage allocated:
245000 LISTP
***** DDERIV Benchmark ***
DDeriv
Evaluating setup for DDERIV
Iteration 0 of DDERIV
Timing for : DDERIV
Elapsed time = 82.165 seconds
reclaim time = 51.815 seconds
net compute time = 30.350 seconds
Storage allocated:
260000 LISTP
Iteration 1 of DDERIV
Timing for : DDERIV
Elapsed time = 80.605 seconds
reclaim time = 50.652 seconds
net compute time = 29.953 seconds
Storage allocated:
260000 LISTP
***** DIV2-1 Benchmark ***
Div2, Iterative
Iteration 0 of DIV2-1
Timing for : DIV2-1
Elapsed time = 30.382 seconds
reclaim time = 20.370 seconds
net compute time = 10.012 seconds
Storage allocated:
120000 LISTP
Iteration 1 of DIV2-1
Timing for : DIV2-1
Elapsed time = 30.130 seconds
reclaim time = 20.251 seconds
net compute time = 9.879 seconds
Storage allocated:
120000 LISTP
***** DIV2-2 Benchmark ***
Div2, Recursive
Iteration 0 of DIV2-2
Timing for : DIV2-2
Elapsed time = 34.071 seconds
reclaim time = 20.934 seconds
net compute time = 13.137 seconds
Storage allocated:
120000 LISTP
Iteration 1 of DIV2-2
Timing for : DIV2-2
Elapsed time = 34.371 seconds
reclaim time = 21.338 seconds
net compute time = 13.033 seconds
Storage allocated:
120000 LISTP
***** DESTRU Benchmark ***
Destruct
Iteration 0 of DESTRU
Timing for : DESTRU
Elapsed time = 21.845 seconds
reclaim time = 5.860 seconds
net compute time = 15.985 seconds
Storage allocated:
43105 LISTP
Iteration 1 of DESTRU
Timing for : DESTRU
Elapsed time = 22.247 seconds
reclaim time = 6.057 seconds
net compute time = 16.190 seconds
Storage allocated:
43105 LISTP
***** TRAVERSE-INIT Benchmark ***
Traverse, Initialize
Iteration 0 of TRAVERSE-INIT
Timing for : TRAVERSE-INIT
Elapsed time = 77.801 seconds
reclaim time = 1.174 seconds
net compute time = 76.627 seconds
Page faults = 342
Storage allocated:
36796 LISTP, 100 TNODE
Iteration 1 of TRAVERSE-INIT
Timing for : TRAVERSE-INIT
Elapsed time = 120.992 seconds
reclaim time = 1.321 seconds
net compute time = 119.671 seconds
Page faults = 433
Storage allocated:
36796 LISTP, 100 TNODE
***** TRAVERSE Benchmark ***
Traverse, Traverse
Iteration 0 of TRAVERSE
Timing for : TRAVERSE
Elapsed time = 142.926 seconds
net compute time = 142.926 seconds
Iteration 1 of TRAVERSE
Timing for : TRAVERSE
Elapsed time = 142.926 seconds
net compute time = 142.926 seconds
***** BOYER Benchmark ***
Boyer
Evaluating setup for BOYER
Iteration 0 of BOYER
Timing for : BOYER
Elapsed time = 139.292 seconds
reclaim time = 40.000 seconds
net compute time = 99.292 seconds
Page faults = 557
Storage allocated:
226464 LISTP
Iteration 1 of BOYER
Timing for : BOYER
Elapsed time = 133.852 seconds
reclaim time = 40.084 seconds
net compute time = 93.768 seconds
Storage allocated:
226464 LISTP
***** BROWSE Benchmark ***
Browse
Iteration 0 of BROWSE
Timing for : BROWSE
Elapsed time = 1649.867 seconds
SWAP time = 0.120 seconds
reclaim time = 795.324 seconds
net compute time = 854.423 seconds
Page faults = 99
Storage allocated:
491147 LISTP, 229002 ONED-ARRAY
Iteration 1 of BROWSE
Timing for : BROWSE
Elapsed time = 1677.013 seconds
reclaim time = 809.323 seconds
net compute time = 867.690 seconds
Page faults = 50
Storage allocated:
491147 LISTP, 229002 ONED-ARRAY
|
||||
@ -1 +0,0 @@
|
||||
Lisp Type: Xerox Lisp
Lisp Version: Medley sysout of 15-Mar-88 18:32:37
Software Type: Xerox AIE
Software Version: Medley sysout of 15-Mar-88 18:32:37, Make-init dates: 15-Mar-88 16:19:01, 15-Mar-88 16:38:25
Machine Type: Xerox 1186
Machine Version: Microcode version: 107, memory size: 7424
Machine Instance: Wills1186 = 25220220072#
Site: Unknown
Features: (:INTERLISP :XEROX :COMMON :IEEE-FLOATING-POINT)
***** FPRINT Benchmark ***
FPrint
Iteration 0 of FPRINT
Timing for : FPRINT
Elapsed time = 12.856 seconds
SWAP time = 0.078 seconds
reclaim time = 0.336 seconds
net compute time = 12.442 seconds
Page faults = 3
Storage allocated:
182 FIXP, 456 LISTP, 2 VMEMPAGEP, 1 STREAM, 72 ONED-ARRAY, 1 PATHNAME, 49 PageGroup, 1 FileDescriptor, 1 \BTREEBUF
Iteration 1 of FPRINT
Timing for : FPRINT
Elapsed time = 12.819 seconds
reclaim time = 0.334 seconds
net compute time = 12.485 seconds
Storage allocated:
170 FIXP, 502 LISTP, 1 VMEMPAGEP, 1 STREAM, 96 ONED-ARRAY, 2 PATHNAME, 50 PageGroup, 1 FileDescriptor
***** FREAD Benchmark ***
FRead
Iteration 0 of FREAD
Timing for : FREAD
Elapsed time = 11.733 seconds
reclaim time = 0.600 seconds
net compute time = 11.133 seconds
Storage allocated:
107 FIXP, 6241 LISTP, 1 VMEMPAGEP, 1 STREAM, 87 ONED-ARRAY, 2 PATHNAME, 37 PageGroup, 1 FileDescriptor
Iteration 1 of FREAD
Timing for : FREAD
Elapsed time = 11.773 seconds
reclaim time = 0.643 seconds
net compute time = 11.130 seconds
Storage allocated:
107 FIXP, 6241 LISTP, 1 VMEMPAGEP, 1 STREAM, 87 ONED-ARRAY, 2 PATHNAME, 37 PageGroup, 1 FileDescriptor
***** TPRINT Benchmark ***
TPrint
Evaluating setup for TPRINT
Iteration 0 of TPRINT
Timing for : TPRINT
Elapsed time = 27.110 seconds
net compute time = 27.110 seconds
Storage allocated:
4 LISTP
Evaluating after every function for TPRINT
Iteration 1 of TPRINT
Timing for : TPRINT
Elapsed time = 27.120 seconds
net compute time = 27.120 seconds
Storage allocated:
4 LISTP
Evaluating after every function for TPRINT
Evaluating after function for TPRINT
|
||||
@ -1 +0,0 @@
|
||||
Lisp Type: Xerox Lisp
Lisp Version: Medley sysout of 15-Mar-88 18:32:37
Software Type: Xerox AIE
Software Version: Medley sysout of 15-Mar-88 18:32:37, Make-init dates: 15-Mar-88 16:19:01, 15-Mar-88 16:38:25
Machine Type: Xerox 1186
Machine Version: Microcode version: 107, memory size: 7424
Machine Instance: Wills1186 = 25220220072#
Site: Unknown
Features: (:INTERLISP :XEROX :COMMON :IEEE-FLOATING-POINT)
***** TAK Benchmark ***
Tak
Iteration 0 of TAK
Timing for : TAK
Elapsed time = 1.631 seconds
net compute time = 1.631 seconds
Iteration 1 of TAK
Timing for : TAK
Elapsed time = 1.641 seconds
net compute time = 1.641 seconds
***** TAKR Benchmark ***
TakR
Iteration 0 of TAKR
Timing for : TAKR
Elapsed time = 1.721 seconds
net compute time = 1.721 seconds
Iteration 1 of TAKR
Timing for : TAKR
Elapsed time = 1.719 seconds
net compute time = 1.719 seconds
***** STAK Benchmark ***
STak
Iteration 0 of STAK
Timing for : STAK
Elapsed time = 4.591 seconds
net compute time = 4.591 seconds
Iteration 1 of STAK
Timing for : STAK
Elapsed time = 4.599 seconds
net compute time = 4.599 seconds
***** TAKL Benchmark ***
TakL
Iteration 0 of TAKL
Timing for : TAKL
Elapsed time = 13.350 seconds
net compute time = 13.350 seconds
Iteration 1 of TAKL
Timing for : TAKL
Elapsed time = 13.358 seconds
net compute time = 13.358 seconds
***** CTAK Benchmark ***
CTak
Iteration 0 of CTAK
Timing for : CTAK
Elapsed time = 82.491 seconds
net compute time = 82.491 seconds
Iteration 1 of CTAK
Timing for : CTAK
Elapsed time = 82.498 seconds
net compute time = 82.498 seconds
|
||||
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
File diff suppressed because one or more lines are too long
Binary file not shown.
File diff suppressed because one or more lines are too long
File diff suppressed because one or more lines are too long
@ -1 +0,0 @@
|
||||
(DEFINE-FILE-INFO READTABLE "XCL" PACKAGE "INTERLISP")
(FILECREATED "29-Jun-88 18:01:48" "{ERIS}<LispCore>Gabriel>Benchmarks>ARITH-BENCHMARKS.;1" 3828
|changes| |to:| (GABRIEL::TIMERS GENERIC-DIV-FLOAT GENERIC-TIMES-FLOAT GENERIC-SUB-FLOAT
GENERIC-ADD-FLOAT FLOAT-SINE FLOAT-DIV FLOAT-TIMES FLOAT-SUB NULL-LOOP
FLOAT-ADD)
(VARS ARITH-BENCHMARKSCOMS)
(VARIABLES PI/6 *ARITH-BENCHMARKS*))
(PRETTYCOMPRINT ARITH-BENCHMARKSCOMS)
(RPAQQ ARITH-BENCHMARKSCOMS (
(* |;;| "Pure arithmetic benchmarks.")
(COMS
(* |;;|
"The null loop of 10K times thru, to factor out loop overhead.")
(GABRIEL::TIMERS NULL-LOOP))
(COMS
(* |;;| "Pure floating point benchmarks")
(GABRIEL::TIMERS FLOAT-ADD FLOAT-DIV FLOAT-SUB FLOAT-TIMES)
(* |;;| "Transcendental function benchmarks ")
(GABRIEL::TIMERS FLOAT-SINE))
(GABRIEL::TIMERS GENERIC-ADD-FLOAT GENERIC-DIV-FLOAT
GENERIC-SUB-FLOAT GENERIC-TIMES-FLOAT)
(VARIABLES PI/6 *ARITH-BENCHMARKS*)))
(* |;;| "Pure arithmetic benchmarks.")
(* |;;| "The null loop of 10K times thru, to factor out loop overhead.")
(GABRIEL::DEFINE-TIMER (NULL-LOOP) "Null loop, 1000 times thru"
(LET (X)
(FOR I FROM 1 |to| 10000 |do| (SETQ X 1))))
(* |;;| "Pure floating point benchmarks")
(GABRIEL::DEFINE-TIMER (FLOAT-ADD) "1000 Floating-point additions"
(LET ((X 0.0))
(FOR I FROM 1 TO 10000 DO (SETQ X (FPLUS X 1.0)))))
(GABRIEL::DEFINE-TIMER (FLOAT-DIV) "1000 Floating-point divisions"
(LET ((X 5400.0))
(FOR I FROM 1 TO 10000 DO (SETQ X (FQUOTIENT X 1.0013562)))))
(GABRIEL::DEFINE-TIMER (FLOAT-SUB) "1000 Floating-point subtractions"
(LET ((X 0.0))
(FOR I FROM 1 TO 10000 DO (SETQ X (FMINUS X 1.0)))))
(GABRIEL::DEFINE-TIMER (FLOAT-TIMES) "1000 Floating-point multiplications"
(LET ((X 1.0))
(FOR I FROM 1 TO 10000 DO (SETQ X (FTIMES X 1.0013562)))))
(* |;;| "Transcendental function benchmarks ")
(GABRIEL::DEFINE-TIMER (FLOAT-SINE) "10000 calls to CL:SIN(pi/6)"
(LET (X)
(FOR I FROM 1 TO 10000 DO (SETQ X (CL:SIN PI/6)))))
(GABRIEL::DEFINE-TIMER (GENERIC-ADD-FLOAT) "10000 Generic + with float args"
(LET ((X 0.0))
(FOR I FROM 1 TO 10000 DO (SETQ X (+ X 1.0)))))
(GABRIEL::DEFINE-TIMER (GENERIC-DIV-FLOAT) "10000 Generic / with float args"
(LET ((X 5400.0))
(FOR I FROM 1 TO 10000 DO (SETQ X (/ X 1.0013562)))))
(GABRIEL::DEFINE-TIMER (GENERIC-SUB-FLOAT) "10000 Generic - with float args"
(LET ((X 0.0))
(FOR I FROM 1 TO 10000 DO (SETQ X (- X 1.0)))))
(GABRIEL::DEFINE-TIMER (GENERIC-TIMES-FLOAT) "10000 Generic * with float args"
(LET ((X 1.0))
(FOR I FROM 1 TO 10000 DO (SETQ X (CL:* X 1.0013562)))))
(CL:DEFVAR PI/6 (FQUOTIENT 3.1415927 6))
(CL:DEFVAR *ARITH-BENCHMARKS* '(NULL-LOOP FLOAT-ADD FLOAT-SUB FLOAT-TIMES FLOAT-DIV
GENERIC-ADD-FLOAT GENERIC-SUB-FLOAT GENERIC-TIMES-FLOAT
GENERIC-DIV-FLOAT FLOAT-SINE))
(DECLARE\: DONTCOPY
(FILEMAP (NIL)))
STOP
|
||||
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
File diff suppressed because one or more lines are too long
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
File diff suppressed because one or more lines are too long
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
File diff suppressed because one or more lines are too long
Binary file not shown.
Binary file not shown.
Binary file not shown.
File diff suppressed because one or more lines are too long
Binary file not shown.
Binary file not shown.
Some files were not shown because too many files have changed in this diff Show More
Loading…
x
Reference in New Issue
Block a user