2010
DOI: 10.1109/l-ca.2010.14
|View full text |Cite
|
Sign up to set email alerts
|

ParMiBench - An Open-Source Benchmark for Embedded Multiprocessor Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
26
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 85 publications
(26 citation statements)
references
References 3 publications
0
26
0
Order By: Relevance
“…We use 39 diverse workloads from several benchmarking suites: MiBench [20], which is a suite of representative embedded workloads; LMbench [21], which contains microbenchmarks for activating and testing specific microarchitectural behaviours, such as memory reads at a specific level of cache; Roy Longbottom [22], which contains many multi-threaded workloads that make heavy use of the NEON SIMD processing unit and OpenMP; ParMiBench [23], which is a multi-threaded version of MiBench; and, ALPBench [24], which contains complex, parallel multimedia workloads.…”
Section: Methodsmentioning
confidence: 99%
“…We use 39 diverse workloads from several benchmarking suites: MiBench [20], which is a suite of representative embedded workloads; LMbench [21], which contains microbenchmarks for activating and testing specific microarchitectural behaviours, such as memory reads at a specific level of cache; Roy Longbottom [22], which contains many multi-threaded workloads that make heavy use of the NEON SIMD processing unit and OpenMP; ParMiBench [23], which is a multi-threaded version of MiBench; and, ALPBench [24], which contains complex, parallel multimedia workloads.…”
Section: Methodsmentioning
confidence: 99%
“…As an alternative, all the task's data must be replicated, as the parent task can not neither have its data modified nor be blocked until its child finishes. Table III presents two benchmarks of the ParMiBench Suite [16]. These benchmarks were ported to HellfireOS, and as the overhead is being measured here, tasks were configured as best effort.…”
Section: A Implementation and Validation Methodologymentioning
confidence: 99%
“…We simulate six SPLASH-2 [22] benchmarks, six PAR-SEC [3] benchmarks, four Parallel-MI-Bench [7], a TravellingSalesman-Problem (tsp) benchmark, a Depth-First-Search (dfs) benchmark, a Matrix-Multiply (matmul) benchmark, and two graph benchmarks (connected-components & community-detection) [1] using the Graphite multicore simulator. The graph benchmarks model social networking based applications.…”
Section: Application Benchmarksmentioning
confidence: 99%
“…So, we explore a mechanism that tracks the locality information for only a few cores, and classifies a new core as a private or remote sharer based on a majority vote of the modes of the tracked cores. Figure 13 plots the completion time and energy of the benchmarks with the Limited k classifier when k is varied as (1,3,5,7,64). k = 64 corresponds to the Complete classifier.…”
Section: Limited Locality Trackingmentioning
confidence: 99%