BigDataBench: a Big Data Benchmark Suite from Internet Services
Not on the map. Why?
Abstract (arXiv)
As architecture, systems, and data management communities pay greater attention to innovative big data systems and architectures, the pressure of benchmarking and evaluating these systems rises. Considering the broad use of big data systems, big data benchmarks must include diversity of data and workloads. Most of the state-of-the-art big data benchmarking efforts target evaluating specific types of applications or system software stacks, and hence they are not qualified for serving the purposes mentioned above. This paper presents our joint research efforts on this issue with several industrial partners. Our big data benchmark suite BigDataBench not only covers broad application scenarios, but also includes diverse and representative data sets. BigDataBench is publicly available from http://prof.ict.ac.cn/BigDataBench . Also, we comprehensively characterize 19 big data workloads included in BigDataBench with varying data inputs. On a typical state-of-practice processor, Intel Xeon E5645, we have the following observations: First, in comparison with the traditional benchmarks: including PARSEC, HPCC, and SPECCPU, big data applications have very low operation intensity; Second, the volume of data input has non-negligible impact on micro-architecture characteristics, which may impose challenges for simulation-based big data architecture research; Last but not least, corroborating the observations in CloudSuite and DCBench (which use smaller data inputs), we find that the numbers of L1 instruction cache misses per 1000 instructions of the big data applications are higher than in the traditional benchmarks; also, we find that L3 caches are effective for the big data applications, corroborating the observation in DCBench.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 6 Jan 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 2; 2024: 2; 2025: 1; 2026: 1.
8 papers.
- 2024Building AI Agents for Autonomous Clouds: Challenges and Design Principlescited by 19
- 2021GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebracited by 10
- 2023Stress Testing Chain-of-Thought Prompting for Large Language Modelscited by 2
- 2023Does AI for science need another ImageNet Or totally different benchmarks? A case study of machine learning force fieldscited by 1
- 2025AutoStreamPipe: LLM Assisted Automatic Generation of Data Stream Processing Pipelinescited by 1
- 2022Benchmarking Apache Spark and Hadoop MapReduce on Big Data Classificationcited by 0
- 2024Enriching the Machine Learning Workloads in BigBenchcited by 0
- 2026Machine Learning-Driven Intelligent Memory System Design: From On-Chip Caches to Storagecited by 0
- 2026Machine Learning-Driven Intelligent Memory System Design: From On-Chip Caches to Storage15 Mar 2026
- 2025AutoStreamPipe: LLM Assisted Automatic Generation of Data Stream Processing Pipelines27 Oct 2025
- 2024Building AI Agents for Autonomous Clouds: Challenges and Design Principles16 Jul 2024
- 2024Enriching the Machine Learning Workloads in BigBench16 Jun 2024
- 2023Stress Testing Chain-of-Thought Prompting for Large Language Models28 Sep 2023
- 2023Does AI for science need another ImageNet Or totally different benchmarks? A case study of machine learning force fields11 Aug 2023
- 2022Benchmarking Apache Spark and Hadoop MapReduce on Big Data Classification21 Sep 2022
- 2021GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra5 Mar 2021