Pacman: Tolerating asymmetric data races with unintrusive hardware

Proceedings - International Symposium on High-Performance Computer Architecture

Volumn , Issue , 2012, Pages 349-360

  Qi, Shanxiang ^a   Otsuki, Norimasa ^a   Nogueira, Lois Orosa ^a   Muzahid, Abdullah ^a   Torrellas, Josep ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BASELINE DESIGN; CACHE COHERENCE; CRITICAL SECTIONS; DATA RACES; PARALLEL SOFTWARE; PRODUCTION RUN; SOFTWARE-BASED; SOURCE CODE CHANGES;

COMPUTER ARCHITECTURE; PROGRAM COMPILERS; SUPERCOMPUTERS;

HARDWARE;

EID: 84860320617     PISSN: 15300897     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HPCA.2012.6169039     Document Type: Conference Paper

References (34)

1. L. Baugh, N. Neelakantam, and C. Zilles. Using hardware memory protection to build a high-performance, strongly-atomic hybrid transactional memory. In ISCA, June 2008.
2. B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. CACM, 13(7), 1970.
3. C. Blundell, E. Lewis, and M. Martin. Subtleties of transactional memory atomicity semantics. Comp. Arch. Letters, 5(2), November 2006.
4. L. Ceze, J. Tuck, C. Cascaval, and J. Torrellas. Bulk disambiguation of speculative threads in multiprocessors. In ISCA, June 2006.
5. D. E. Culler, A. Gupta, and J. P. Singh. Parallel Computer Architecture: A Hardware/Software Approach. Morgan Kaufmann Publishers Inc., 1997.
6. L. Dagum and R. Menon. OpenMP: An industry-standard API for shared-memory programming. Comput. Sci. Eng., 1998.
7. D. Engler and K. Ashcraft. RacerX: Effective, static detection of race conditions and deadlocks. In SOSP, October 2003.
8. J. Erickson, M. Musuvathi, S. Burckhardt, and K. Olynyk. Effective data-race detection for the kernel. In OSDI. Slides in usenix.org/event/osdi10/ tech/slides/erickson.pdf, October 2010.
9. M. A. Heinrich. The performance and scalability of distributed shared-memory cache coherence protocols. PhD thesis, Stanford University, CA, USA, 1999.
10. M. Herlihy and J. E. B. Moss. Transactional memory: Architectural support for lock-free data structures. In ISCA, May 1993.
11. S. Lu, J. Tucek, F. Qin, and Y. Zhou. AVIO: Detecting atomicity violations via access interleaving invariants. In ASPLOS, October 2006.
12. B. Lucia, J. Devietti, K. Strauss, and L. Ceze. Atom-Aid: Detecting and surviving atomicity violations. In ISCA, June 2008.
13. E. Lusk, J. Boyle, R. Butler, et al. Portable programs for parallel processors. Holt, Rinehart & Winston, 1988.
14. S. L. Min and J.-D. Choi. An efficient cache-based access anomaly detection scheme. In ASPLOS, April 1991.
15. A. Muzahid, N. Otsuki, and J. Torrellas. AtomTracker: A Comprehensive Approach to Atomic Region Inference and Violation Detection. In MICRO, December 2010.
16. A. Muzahid, D. Suarez, S. Qi, and J. Torrellas. SigRace: Signature-based data race detection. In ISCA, June 2009.
17. M. Naik, A. Aiken, and J. Whaley. Effective static race detection for Java. In PLDI, June 2006.
18. S. Narayanasamy, Z. Wang, J. Tigani, A. Edwards, and B. Calder. Automatically classifying benign and harmful data races using replay analysis. In PLDI, June 2007.
19. M. Prvulovic. CORD: Cost-effective (and nearly overhead-free) order-recording and data race detection. In HPCA, June 2006.
20. M. Prvulovic and J. Torrellas. ReEnact: Using thread-level speculation mechanisms to debug data races in multithreaded codes. In ISCA, June 2003.
21. F. Qin, J. Tucek, J. Sundaresan, and Y. Zhou. Rx: Treating bugs as allergies - a safe method to survive software failures. In SOSP, October 2005.
22. S. Rajamani, G. Ramalingam, V. P. Ranganath, and K. Vaswani. ISOLATOR: Dynamically ensuring isolation in concurrent programs. In ASPLOS, March 2009.
23. P. Ratanaworabhan, M. Burtscher, D. Kirovski, B. Zorn, R. Nagpal, and K. Pattabiraman. Detecting and tolerating asymmetric races. In PPoPP, February 2009.
24. J. Renau, B. Fraguela, J. Tuck,W. Liu, M. Prvulovic, L. Ceze, S. Sarangi, P. Sack, K. Strauss, and P. Montesinos. SESC simulator, January 2005. http://sesc.sourceforge.net.
25. D. Sanchez, L. Yen, M. D. Hill, and K. Sankaralingam. Implementing signatures for transactional memory. In MICRO, December 2007.
26. R. Sasanka, M.-L. Li, S. V. Adve, Y.-K. Chen, and E. Debes. ALP: Efficient support for all levels of parallelism for complex media applications. ACM TACO, 4, March 2007.
27. S. Savage, M. Burrows, G. Nelson, P. Sobalvarro, and T. Anderson. Eraser: A dynamic data race detector for multi-threaded programs. ACM Trans. Comput. Syst., November 1997.
28. K. Veeraraghavan, P. M. Chen, J. Flinn, and S. Narayanasamy. Detecting and surviving data races using complementary schedules. In SOSP, October 2011.
29. J. Wu, H. Cui, and J. Yang. Bypassing races in live applications with execution filters. In OSDI, October 2010.
30. J. Yu and S. Narayanasamy. A case for an interleaving constrained shared-memory multiprocessor. In ISCA, June 2009.
31. J. Yu and S. Narayanasamy. Tolerating Concurrency Bugs Using Transactions as Lifeguards. In MICRO, 2010.
32. W. Zhang, C. Sun, and S. Lu. ConMem: Detecting severe concurrency bugs through an effect-oriented approach. In ASPLOS, March 2010.
33. P. Zhou, F. Qin, W. Liu, Y. Zhou, and J. Torrellas. iWatcher: Efficient architectural support for software debugging. In ISCA, June 2004.
34. P. Zhou, R. Teodorescu, and Y. Zhou. HARD: Hardware-assisted lockset-based race detection. In HPCA, February 2007.