Brief announcement: The problem based benchmark suite

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2012, Pages 68-70

  Shuny, Julian ^a   Blellochy, Guy E ^a   Fineman, Jeremy T ^b   Gibbonsz, Phillip B ^c   Kyrolay, Aapo ^a   Simhadriy, Harsha Vardhan ^a   Tangwongsany, Kanat ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b GEORGETOWN UNIVERSITY   (United States)

^c INTEL CORPORATION   (United States)

Author keywords

Algorithm performance; Benchmarking; Parallel algorithms

Indexed keywords

ALGORITHM PERFORMANCE; ALGORITHMIC APPROACH; BENCH-MARK PROBLEMS; BENCHMARK SUITES; BREADTH-FIRST SEARCH; COMPARISON SORT; CONVEX HULL; DELAUNAY TRIANGULATION; FILE FORMATS; FOLLOWING PROBLEM; INPUT AND OUTPUTS; K-NEAREST NEIGHBORS; MACHINE ARCHITECTURES; MAXIMAL INDEPENDENT SET; MAXIMAL MATCHINGS; MINIMUM SPANNING FORESTS; MULTI CORE; PROBLEM SPECIFICATION; PROBLEM-BASED; RAY CASTING; RUNTIMES; SEQUENTIAL IMPLEMENTATION; STANDARD FORMAT; SUFFIX ARRAYS; TEST CODE;

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES; PARALLEL PROGRAMMING; PROBLEM ORIENTED LANGUAGES; SPECIFICATIONS;

BENCHMARKING;

EID: 84864142371     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2312005.2312018     Document Type: Conference Paper

References (19)

1. L. Akoglu and C. Faloutsos. RTG: A recursive realistic graph generator using random typing. Data Min. Knowl. Discov., 19(2), 2009.
2. K. Albayraktaroglu, A. Jaleel, X. Wu, M. Franklin, B. Jacob, C.-W. Tseng, and D. Yeung. BioBench: A benchmark suite of bioinformatics applications. In IEEE ISPASS, 2005.
3. K. Asanovic, R. Bodik, B. C. Catanzaro, J. J. Gebis, P. Husbands, K. Keutzer, D. A. Patterson, W. L. Plishker, J. Shalf, S. W. Williams, and K. A. Yelick. The landscape of parallel computing research: A view from Berkeley. Technical Report UCB/EECS-2006-183, EECS Department, UC Berkeley, 2006.
4. D. H. Bailey, E. Barszcz, J. T. Barton, D. S. Browning, R. L. Carter, L. Dagum, R. Fatoohi, P. O. Frederickson, T. A. Lasinski, R. Schreiber, H. D. Simon, V. Venkatakrishnan, and S. Weeratunga. The NAS parallel benchmarks - summary and preliminary results. In ACM/IEEE Supercomputing, 1991.
5. C. Bienia, S. Kumar, J. P. Singh, and K. Li. The PARSEC benchmark suite: Characterization and architectural implications. In ACM PACT, 2008.
6. S. M. Blackburn et al. The DaCapo benchmarks: Java benchmarking development and analysis. In ACM OOPSLA, 2006.
7. G. E. Blelloch, J. T. Fineman, P. B. Gibbons, and J. Shun. Internally deterministic parallel algorithms can be fast. In ACM PPoPP, 2012.
8. C. Cao Minh, J. Chung, C. Kozyrakis, and K. Olukotun. STAMP: Stanford transactional applications for multi-processing. In IISWC '08, September 2008.
9. B. Fulgham. The computer language benchmarks game. http://shootout. alioth.debian.org/, 2009.
10. H. H. Hoos and T. Stützle. SATLIB: An online resource for research on SAT. In I. P. Gent, H. v. Maaren, and T. Walsh, editors, SAT 2000. IOS Press, 2000.
11. A. Jaleel, M. Mattina, and B. Jacob. Last-level cache (LLC) performance of data-mining workloads on a CMP - A case study of parallel bioinformatics workloads. In IEEE HPCA, 2006.
12. C. Lee, M. Potkonjak, and W. H. Mangione-Smith. MediaBench: A tool for evaluating and synthesizing multimedia and communications systems. In IEEE/ACM MICRO, 1997.
13. M.-L. Li, R. Sasanka, S. V. Adve, Y.-K. Chen, and E. Debes. The ALPBench benchmark suite for complex multimedia applications. In IEEE IISWC, 2005.
14. P. Luszczek, D. Bailey, J. Dongarra, J. Kepner, R. Lucas, R. Rabenseifner, and D. Takahashi. The HPC challenge (HPCC) benchmark suite. In ACM/IEEE SC06 Conference Tutorial, 2006.
15. R. Narayanan, B. Ozisikyilmaz, J. Zambreno, G. Memik, and A. N. Choudhary. MineBench: A benchmark suite for data mining workloads. In IEEE IISWC, 2006.
16. K. Pingali, D. Nguyen, M. Kulkarni, M. Burtscher, M. A. Hassaan, R. Kaleem, T.-H. Lee, A. Lenharth, R. Manevich, M. Méndez-Lojo, D. Prountzos, and X. Sui. The tao of parallelism in algorithms. In ACM PLDI, 2011.
17. L. A. Smith, J. M. Bull, and J. Obdrzalek. A parallel Java Grande benchmark suite. In ACM/IEEE SC2001, 2001.
18. S. K. Venkata, I. Ahn, D. Jeon, A. Gupta, C. Louie, S. Garcia, S. Belongie, and M. B. Taylor. SD-VBS: The San Diego vision benchmark suite. In IEEE IISWC, 2009.
19. S. C. Woo, M. Ohara, E. Torrie, J. P. Singh, and A. Gupta. The SPLASH-2 programs: Characterization and methodological considerations. In ACM ISCA, 1995