Coremark
Encyclopedia
CoreMark is a benchmark
that aims to measure the performance of central processing unit
s (CPU) used in embedded systems. It was developed in 2009 by Shay Gal-On at EEMBC
and is intended to become an industry standard, replacing the antiquated Dhrystone
benchmark. The code is written in C code
and contains implementations of the following algorithms: list processing (find and sort), Matrix (mathematics)
manipulation (common matrix operations), state machine (determine if an input stream contains valid numbers), and CRC
.
To ensure compilers cannot pre-compute the results at compile time every operation in the benchmark to derives a value that is not available at compile time. Furthermore, all code used within the timed portion of the benchmark is part of the benchmark itself (no Library (computing) calls).
.
Major portions of Dhrystone are susceptible to a compiler’s ability to optimize the work away; thus it is more a compiler benchmark then a hardware benchmark. This also makes it very difficult to compare results when different compilers/flags are used.
Library calls are made within the timed portion of Dhrystone. Typically, those library calls consume the majority of the time consumed by the benchmark. Since the library code is not part of the benchmark, it is difficult to compare results if different libraries are used.
Guidelines exist on how to run Dhrystone but since results are not certified or verified, they are not enforced. There is no standardization on how Dhrystone results should be reported, with various formats in use (DMIPS, Dhrystones per second, DMIPS/MHz)
Results are in the following format:
CoreMark 1.0 : N / C [/ P] [/ M]
For example: CoreMark 1.0 : 128 / GCC 4.1.2 -O2 -fprofile-use / Heap in TCRAM / FORK:2
Benchmark (computing)
In computing, a benchmark is the act of running a computer program, a set of programs, or other operations, in order to assess the relative performance of an object, normally by running a number of standard tests and trials against it...
that aims to measure the performance of central processing unit
Central processing unit
The central processing unit is the portion of a computer system that carries out the instructions of a computer program, to perform the basic arithmetical, logical, and input/output operations of the system. The CPU plays a role somewhat analogous to the brain in the computer. The term has been in...
s (CPU) used in embedded systems. It was developed in 2009 by Shay Gal-On at EEMBC
EEMBC
EEMBC, the Embedded Microprocessor Benchmark Consortium, is a non-profit organization formed in 1997 with the aim of developing meaningful performance benchmarks for the hardware and software used in embedded systems...
and is intended to become an industry standard, replacing the antiquated Dhrystone
Dhrystone
Dhrystone is a synthetic computing benchmark program developed in 1984 by Reinhold P. Weicker intended to be representative of system programming. The Dhrystone grew to become representative of general processor performance...
benchmark. The code is written in C code
C (programming language)
C is a general-purpose computer programming language developed between 1969 and 1973 by Dennis Ritchie at the Bell Telephone Laboratories for use with the Unix operating system....
and contains implementations of the following algorithms: list processing (find and sort), Matrix (mathematics)
Matrix (mathematics)
In mathematics, a matrix is a rectangular array of numbers, symbols, or expressions. The individual items in a matrix are called its elements or entries. An example of a matrix with six elements isMatrices of the same size can be added or subtracted element by element...
manipulation (common matrix operations), state machine (determine if an input stream contains valid numbers), and CRC
Cyclic redundancy check
A cyclic redundancy check is an error-detecting code commonly used in digital networks and storage devices to detect accidental changes to raw data...
.
Issues Addressed by CoreMark
The CRC algorithm serves a dual function; it provides a workload commonly seen in embedded applications and ensures correct operation of the CoreMark benchmark, essentially providing a self-checking mechanism. Specifically, to verify correct operation, a 16bit CRC on the data contained in elements of the linked-list.To ensure compilers cannot pre-compute the results at compile time every operation in the benchmark to derives a value that is not available at compile time. Furthermore, all code used within the timed portion of the benchmark is part of the benchmark itself (no Library (computing) calls).
CoreMark vs. Dhrystone
CoreMark draws on the strengths that made Dhrystone so resilient - it is small, portable, easy to understand, free, and displays a single number benchmark score. Unlike Dhrystone, CoreMark has specific run and reporting rules, and was designed to avoid the well understood issues that have been cited with DhrystoneDhrystone
Dhrystone is a synthetic computing benchmark program developed in 1984 by Reinhold P. Weicker intended to be representative of system programming. The Dhrystone grew to become representative of general processor performance...
.
Major portions of Dhrystone are susceptible to a compiler’s ability to optimize the work away; thus it is more a compiler benchmark then a hardware benchmark. This also makes it very difficult to compare results when different compilers/flags are used.
Library calls are made within the timed portion of Dhrystone. Typically, those library calls consume the majority of the time consumed by the benchmark. Since the library code is not part of the benchmark, it is difficult to compare results if different libraries are used.
Guidelines exist on how to run Dhrystone but since results are not certified or verified, they are not enforced. There is no standardization on how Dhrystone results should be reported, with various formats in use (DMIPS, Dhrystones per second, DMIPS/MHz)
Results
CoreMark results can be found on the CoreMark web site, and on processor data sheets.Results are in the following format:
CoreMark 1.0 : N / C [/ P] [/ M]
- N Number of iterations per second with seeds 0,0,0x66,size=2000)
- C Compiler version and flags
- P Parameters such as data and code allocation specifics
- M - Type of Parallel algorithmParallel algorithmIn computer science, a parallel algorithm or concurrent algorithm, as opposed to a traditional sequential algorithm, is an algorithm which can be executed a piece at a time on many different processing devices, and then put back together again at the end to get the correct result.Some algorithms...
execution (if used) and number of contexts
For example: CoreMark 1.0 : 128 / GCC 4.1.2 -O2 -fprofile-use / Heap in TCRAM / FORK:2
See also
- Business Applications Performance Corporation (BAPCo)BAPCo consortiumBAPCo, Business Applications Performance Corporation, is a non-profit consortium with a charter to develop and distribute a set of objective performance benchmarks for personal computers based on popular software applications and operating systems....
- Embedded Microprocessor Benchmark Consortium (EEMBC)EEMBCEEMBC, the Embedded Microprocessor Benchmark Consortium, is a non-profit organization formed in 1997 with the aim of developing meaningful performance benchmarks for the hardware and software used in embedded systems...
- Standard Performance Evaluation CorporationStandard Performance Evaluation CorporationThe Standard Performance Evaluation Corporation is a non-profit organization that aims to "produce, establish, maintain and endorse a standardized set" of performance benchmarks for computers....
(SPEC) - Transaction Processing Performance CouncilTransaction Processing Performance CouncilTransaction Processing Performance Council is a non-profit organization founded in 1988 to define transaction processing and database benchmarks and to disseminate objective, verifiable TPC performance data to the industry...
(TPC)