Prepared v3.0

AmadeusITGroup · Dec 8, 2021 · c181bb2 · c181bb2
1 parent 492b651
commit c181bb2
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 2 deletions.
diff --git a/Readme.md b/Readme.md
@@ -82,7 +82,7 @@ The principle is very similar to SPECint or Coremark integer benchmarks. It is b
 - solving Dijkstra's pearls problem
 - top-k route exploring in small graphs
 
-These algorithms are not specifically representative of a given Amadeus application or functional transaction. Compression/decompression, encoding/decoding, crypto, data structures management, sorting small datasets, buffer building from scattered memory accesses are typical of back-end software though. We do not really care about the absolute throughput of each individual algorithm, but rather about the transactional throughput, each transaction being a sequence involving all the algorithms, each of them run on a small working set.
+These algorithms are not specifically representative of a given Amadeus application or functional transaction. Compression/decompression, encoding/decoding, crypto, data structures management, sorting small datasets, buffer building from scattered memory accesses are typical of back-end software though. The code mostly uses integers, with only few floating point operations. One difference with other benchmarks is we do not really care about the absolute throughput of each individual algorithm, but rather about the transactional throughput. Each transaction (5-10 ms) is defined as a sequence involving all the algorithms, each of them running on a small memory working set.
 
 To check the benchmark is relevant (and the execution time of one algorithm does not dwarf all the other ones), the relative execution time of the various algorithms can be displayed using:
 

diff --git a/main.go b/main.go
@@ -17,7 +17,7 @@ import (
 )
 
 // Version of the program
-const Version = "3.0-dev"
+const Version = "3.0"
 
 // Definition of the command line flags
 var (