BigDataBench:a Big Data Benchmark Suite from Internet Services
As architecture, systems, and data management communities pay greater attention to innovative big data systems and architecture, the pressure of benchmarking and evaluating these systems rises.However, the complexity, diversity, frequently changed workloads, and rapid evolution of big data systems raise great challenges in big data benchmarking.Considering the broad use of big data systems, for the sake of fairness, big data benchmarks must include diversity of data and workloads, which is the prerequisite for evaluating big data systems and architecture.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.Currently, we choose 19 big data benchmarks from dimensions of application scenarios,operations/algorithms, data types, data sources, software stacks, and application types, and they are comprehensive for fairly measuring and evaluating big data systems and architecture.BigDataBench is publicly available from the project home pagehttp://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, which measures the ratio of the total number of instructions divided by the total byte number of memory accesses;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 (L1 I) misses per 1000 instructions (in short, MPKI)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.
big data benchmark
Lei Wang Jianfeng Zhan Chunjie Luo Yuqing Zhu Qiang Yang Yongqiang He Wanling Gao Zhen Jia Yingjie Shi Shujie Zhang Chen Zheng Gang Lu Kent Zhan Xiaona Li Bizhu Qiu
State Key Laboratory of Computer Architecture (Institute of Computing Technology, Chinese Academy of State Key Laboratory of Computer Architecture (Institute of Computing Technology, Chinese Academy of
国际会议
昆明
英文
75-89
2014-05-01（万方平台首次上网日期，不代表论文的发表时间）