here - Stefan-Marr.de

B.1. Benchmark Characterizations
We treat the Slopstone benchmarks as a single kernel benchmark covering
a wider range of aspects with a single result.
The Smopstone benchmarks collections contains kernel benchmarks. It
calculates fractonaccis, which is a similar to a recursive fibonacci, but
uses fractions instead of natural numbers. Furthermore, it generates a
collection of prime numbers, generates and parses streams as well as
strings, creates sets, sorts strings, and has a benchmark called Sorcerer’s
Apprentice, which exercises recursive blocks, integer arithmetic, and collections.
Similar to the Slopstone benchmark, only the overall result is
reported.
Binary Trees This benchmark is used from The Computer Language Benchmark
Game (CLBG) and is an adaptation of Hans Boehm’s GCBench. 2 It allocates
many binary trees. The trees are created and afterwards traversed
once as a consistency check.
LRSTM: The benchmark is executed unchanged in the context of the
STM, which will track all mutations.
AmbientTalkST: The tree factory is represented by a separate actor. It will
create the trees on the request of the main actor, and return a reference
(a far reference in AmbientTalk terminology). Thus, the factory actor
remains the owner and the main actor will send an asynchronous request
for the consistency check, which will be processed by the factor
actor. All overhead should be attributable to this constant number of
asynchronous message sends per created tree.
Chameneos The Chameneos benchmark is used from the CLGB and has been
used by Kaiser and Pradat-Peyre [2003] to study the differences of synchronization
constructs in different languages. It repeatedly performs
symmetrical thread rendezvous requests. It uses Smalltalk processes
and semaphores for the synchronization. Thus, the main aspect measured
is the overhead of scheduling, the synchronization, and notification
operations.
Fannkuch The Fannkuch benchmark is used from the CLBG. It repeatedly
accesses a tiny integer-sequence to generate permutations of it. It has
been used by Anderson and Rettig [1994] to analyze the performance of
Lisp implementations. The CLBG implementation uses a stateful object
2 http://www.hpl.hp.com/personal/Hans_Boehm/gc/gc_bench/applet/GCBench.java
265