STAMP: Stanford transactional applications for multi-processing

2008 IEEE International Symposium on Workload Characterization, IISWC'08

Volumn , Issue , 2008, Pages 35-46

  Chí, Cao Minh ^a   Chung, JaeWoong ^a   Kozyrakis, Christos ^a   Olukotun, Kunle ^a  

^a Stanford University

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION DOMAINS; BENCHMARK SUITES; DATA SETS; HYBRID SYSTEMS; INPUT PARAMETERS; MICROBENCHMARKS; PERFORMANCE CHARACTERISTICS; SHORT-COMINGS; STANFORD; STILL MISSING; TRANSACTIONAL EXECUTIONS; TRANSACTIONAL MEMORIES;

APPLICATIONS; BENCHMARKING; DATA STORAGE EQUIPMENT; PARALLEL PROGRAMMING;

STORAGE ALLOCATION (COMPUTER);

EID: 56449127224     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IISWC.2008.4636089     Document Type: Conference Paper

References (41)

1. A.-R. Adl-Tabatabai, B. Lewis, et al. Compiler and runtime support for efficient software transactional memory. In PLDI '06: Proceedings of the 2006 ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM Press, New York, NY, USA, 2006.
2. D. A. Bader and K. Madduri. Design and implementation of the hpcs graph analysis benchmark on symmetric multiprocessors. In HiPC '05: 12th International Conference on High Performance Computing. December 2005.
3. W. Baek, C. Cao Minh, et al. The OpenTM transactional application programming interface. In PACT '07: Proceedings of the 16th International Conference on Parallel Architecture and Compilation Techniques, pp. 376-387. IEEE Computer Society, Washington, DC, USA, 2007. ISBN 0-7695-2944-5.
4. C. Bienia, S. Kumar, et al. The parsec benchmark suite: Characterization and architectural implications. Tech. Rep. TR-811-08,, Princeton University, 2008.
5. B. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of ACM, 1970.
6. C. Blundell, J. Devietti, et al. Making the fast case common and the uncommon case simple in unbounded transactional memory. In ISCA '07: Proceedings of the 34th annual international symposium on Computer architecture, pp. 24-34. ACM, New York, NY, USA, 2007. ISBN 978-1-59593-706-3.
7. J. Bobba, N. Goyal, et al. Tokentm: Efficient execution of large transactions with hardware transactional memory. In Proceedings of the 35th Annual International Symposium on Computer Architecture. Jun 2008.
8. C. Cao Minh, M. Trautmann, et al. An effective hybrid transactional memory system with strong isolation guarantees. In Proceedings of the 34th Annual International Symposium on Computer Architecture. June 2007.
9. L. Ceze, J. Tuck, et al. Bulk disambiguation of speculative threads in multiprocessors. In ISCA '06: Proceedings of the 33rd International Symposium on Computer Architecture, pp. 227-238. IEEE Computer Society, Washington, DC, USA, 2006. ISBN 0-7695-2608-X.
10. S. Cherem, T. Chilimbi, et al. Inferring locks for atomic sections. In PLDI '08: Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation, pp. 304-315. ACM, New York, NY, USA, 2008. ISBN 978-1-59593-860-2.
11. D. M. Chickering, D. Heckerman, et al. A Bayesian approach to learning Bayesian networks with local structure. In UAI '97: Proceedings of the 13th Conference on Uncertainty in Artificial Intelligence, pp. 80-89.
12. P. Damron, A. Fedorova, et al. Hybrid transactional memory. In ASPLOS-XII: Proceedings of the 12th international conference on Architectural support for programming languages and operating systems. October 2006.
13. D. Dice, O. Shalev, et al. Transactional locking II. In DISC'06: Proceedings of the 20th International Symposium on Distributed Computing. March 2006.
14. R. Guerraoui, M. Kapalka, et al. STMBench7: a benchmark for software transactional memory. SIGOPS Oper. Syst. Rev., 41(3):315-324, 2007. ISSN 0163-5980.
15. B. Haagdorens, T. Vermeiren, et al. Improving the performance of signature-based network intrusion detection sensors by multi-threading. In WISA '04: Proceedings of the 5th International Workshop on Infomation Security Applications, pp. 188-203. 2004.
16. L. Hammond, V. Wong, et al. Transactional memory coherence and consistency. In Proceedings of the 31st International Symposium on Computer Architecture, pp. 102-113. June 2004.
17. T. Harris and K. Fraser. Language support for lightweight transactions. In OOPSLA '03: Proceedings of the 18th annual ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications, pp. 388-402. ACM Press, 2003. ISBN 1-58113-712-5.
18. T. Harris, M. Plesko, et al. Optimizing memory transactions. In PLDI '06: Proceedings of the 2006 ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM Press, New York, NY, USA, 2006.
19. M. Herlihy, V. Luchangco, et al. Software transactional memory for dynamic-sized data structures. In PODC '03: Proceedings of the twenty-second annual symposium on Principles of distributed computing, pp. 92-101. ACM Press, New York, NY, USA, July 2003. ISBN 1-58113-708-7.
20. M. Herlihy and J. E. B. Moss. Transactional memory: Architectural support for lock-free data structures. In Proceedings of the 20th International Symposium on Computer Architecture, pp. 289-300. 1993.
21. A. Jaleel, M. Mattina, et al. Last level cache (llc) performance of data mining workloads on a cmp - a case study of parallel bioinformatics workloads. High-Performance Computer Architecture, 2006. The Twelfth International Symposium on, pp. 88-98, 11-15 Feb. 2006. ISSN 1530-0897.
22. H. Jin, M. Frumkin, et al. The openmp implementation of nas parallel benchmarks and its performance. Tech. rep.
23. R. M. Karp and M. O. Rabin. Efficient randomized pattern-matching algorithms. IBM J. Res. Dev., 31(2):249-260, 1987. ISSN 0018-8646.
24. M. Kulkarni, K. Pingali, et al. Optimistic parallelism requires abstractions. In PLDI '07: Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation, pp. 211-222. ACM, New York, NY, USA, 2007. ISBN 978-1-59593-633-2.
25. S. Kumar, M. Chu, et al. Hybrid transactional memory. In PPoPP '06: Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming. ACM Press, New York, NY, USA, March 2006.
26. C. Y. Lee. An algorithm for path connections and its applications. IRE Transactions on Electronic Computers, EC-10(3):346-365, Sep. 1961.
27. V. J. Marathe, M. F. Spear, et al. Lowering the overhead of nonblocking software transactional memory. In TRANSACT: First ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing. 2006.
28. A. W. Moore and M. S. Lee. Cached sufficient statistics for efficient machine learning with large datasets. Journal of Artificial Intelligence Research, 8:67-91, 1998.
29. K. E. Moore, J. Bobba, et al. LogTM: Log-Based Transactional Memory. In 12th International Conference on High-Performance Computer Architecture. February 2006.
30. R. Narayanan, B. Ozisikyilmaz, et al. Minebench: A benchmark suite for data mining workloads. Workload Characterization, 2006 IEEE International Symposium on, pp. 182-188, Oct. 2006.
31. C. Perfumo, N. Sonmez, et al. Dissecting transactional executions in haskell. In TRANSACT '07: Second ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing. August 2007.
32. J. Ruppert. A delaunay refinement algorithm for quality 2-dimensional mesh generation. J. Algorithms, 18(3):548-585, 1995.
33. B. Saha, A. Adl-Tabatabai, et al. Architectural support for software transactional memory. In MICRO '06: Proceedings of the International Symposium on Microarchitecture. 2006.
34. B. Saha, A.-R. Adl-Tabatabai, et al. McRT-STM: A high performance software transactional memory system for a multi-core runtime. In PPoPP '06: Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming. ACM Press, New York, NY, USA, March 2006.
35. M. L. Scott, M. F. Spear, et al. Transactions and privatization in delaunay triangulation. In PODC '07: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, pp. 336-337. ACM, New York, NY, USA, 2007. ISBN 978-1-59593-616-5.
36. A. Shriraman, M. F. Spear, et al. An integrated hardware-software approach to flexible transactional memory. In Proceedings of the 34rd Annual International Symposium on Computer Architecture. June 2007.
37. Standard Performance Evaluation Corporation, SPECjbb2000 Benchmark. http://www.spec.org/jbb2000/, 2000.
38. Standard Performance Evaluation Corporation, SPEC OpenMP Benchmark Suite. http://www.spec.org/omp.
39. E. Vallejo, T. Harris, et al. Hybrid transactional memory to accelerate safe lock-based transactions. In TRANSACT '08: Third ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing. February 2008.
40. I. Watson, C. Kirkham, et al. A study of a transactional parallel routing algorithm. In PACT '07: Proceedings of the 16th International Conference on Parallel Architecture and Compilation Techniques (PACT 2007), pp. 388-398. IEEE Computer Society, Washington, DC, USA, 2007. ISBN 0-7695-2944-5.
41. S. C. Woo, M. Ohara, et al. The SPLASH2 Programs: Characterization and Methodological Considerations. In Proceedings of the 22nd International Symposium on Computer Architecture, pp. 24-36. June 1995.