期刊文献+

An Efficient and Flexible Deterministic Framework for Multithreaded Programs 被引量:1

An Efficient and Flexible Deterministic Framework for Multithreaded Programs
原文传递
导出
摘要 Determinism is very useful to multithreaded programs in debugging, testing, etc. Many deterministic ap- proaches have been proposed, such as deterministic multithreading (DMT) and deterministic replay. However, these sys- tems either are inefficient or target a single purpose, which is not flexible. In this paper, we propose an efficient and flexible deterministic framework for multithreaded programs. Our framework implements determinism in two steps: relaxed determinism and strong determinism. Relaxed determinism solves data races eificiently by using a proper weak memory consistency model. After that, we implement strong determinism by solving lock contentions deterministically. Since we can apply different approaches for these two steps independently, our framework provides a spectrum of deterministic choices, including nondeterministic system (fast), weak deterministic system (fast and conditionally deterministic), DMT system, and deternfinistic replay system. Our evaluation shows that the DMT configuration of this framework could even outperform a state-of-the-art DMT system. Determinism is very useful to multithreaded programs in debugging, testing, etc. Many deterministic ap- proaches have been proposed, such as deterministic multithreading (DMT) and deterministic replay. However, these sys- tems either are inefficient or target a single purpose, which is not flexible. In this paper, we propose an efficient and flexible deterministic framework for multithreaded programs. Our framework implements determinism in two steps: relaxed determinism and strong determinism. Relaxed determinism solves data races eificiently by using a proper weak memory consistency model. After that, we implement strong determinism by solving lock contentions deterministically. Since we can apply different approaches for these two steps independently, our framework provides a spectrum of deterministic choices, including nondeterministic system (fast), weak deterministic system (fast and conditionally deterministic), DMT system, and deternfinistic replay system. Our evaluation shows that the DMT configuration of this framework could even outperform a state-of-the-art DMT system.
出处 《Journal of Computer Science & Technology》 SCIE EI CSCD 2015年第1期42-56,共15页 计算机科学技术学报(英文版)
基金 The work was supported by the National Natural Science Foundation of China under Grant Nos. 61272142, 61103082, 61402492, 61170261, 61103193, the National High Technology Research and Development 863 Program of China under Grant Nos. 2012AA01A301, 2012AA010901, and the Program for New Century Excellent Talents in University of China.
关键词 DETERMINISM MULTITHREADING FRAMEWORK FLEXIBLE determinism, multithreading, framework, flexible
  • 相关文献

参考文献36

  • 1Lee E A. The problem with threads. Computer, 2006, 39(5):33-42.
  • 2Olszewski M, Ansel J, Amarasinghe S. Kendo: Efficient deterministic multithreading in software. In Proc, the 14th ASPLOS, March 2009, pp.97-108.
  • 3Devietti J, Lucia B, Ceze L, Oskin M. DMP: Deterministic shared memory multiprocessing. In Proc, the 14th ASPLOS, March 2009, pp.85-96.
  • 4Aviram A, Weng S C, Hu S, Ford B. Efficient systemenforced deterministic parallelism. In Proc. the 9th OSDI, October 2010, pp.193-206.
  • 5Veeraraghavan K, Lee D, Wester B, Ouyang J, Chen P M, Flinn J, Narayanasamy S. DoublePlay: Parallelizing sequential logging and replay. ACM Transactions on Computer Systems, 2012, 30(1):3:1-3:24.
  • 6Bergan T, Anderson 0, Devietti J, Ceze L, Grossman D. CoreDet: A compiler and runtime system for deterministic multithreaded execution. In Proc. the 15th ASPLOS, March 2010, pp.53-64.
  • 7Bergan T, Hunt N, Ceze L, Gribble S D. Deterministic process groups in DOS. In Proc. the 9th OSDI, October 2010, pp.177-191.
  • 8Hunt N, Bergan T, Ceze L, Gribble S D. DDOS: Taming nondeterminism in distributed systems. In Proc. the 18th ASPLOS, March 2013, pp.499-508.
  • 9Bergan T, Devietti J, Hunt N, Ceze L. The deterministic execution hammer: How well does it actually pound nails? In Proc. the 2nd Workshop on Determinism and Correctness in Parallel Programming, March 2011, pp.56-63.
  • 10Lu K, Zhou X, Bergan T, Wang X. Efficient deterministic multithreading without global barriers. In Proc. the 19th PPoPP, February 2014, pp.287-300.

同被引文献32

  • 1Rixner S, Daily W, Kapasi U, et al. Memory access scheduling [C] //Proc of the 27th Annual Int Syrup on Computer Architecture. New York: ACM, 2000:128-138.
  • 2Uhlig R, Mudge T. Trace-driven memory simulation: A survey[J]. ACMComputer Survey, 1997, 29(2): 128-170.
  • 3Joao J, Suleman M, Mutlu O, et al. Bottleneck identification and scheduling in muhithreaded applications [C]//Proe of the 17th Int Conf on Architectural Support for Programming I.anguages and Operating Systems. New York: ACM, 2012: 223-234.
  • 4Kayiran O, Nachiappan N, Jog A, et al. Managing GPU concurrency in heterogeneous architectures [C] //Proe of the 47th Annual IEEE/ACM Int Symp on Microarchitecture. Los Alamitos, CA: 1EEEComputer Society, 2014:114-126.
  • 5Mutlu O, Moscibroda T. Parallelism aware batch scheduling: Enhancing both performance and fairness of shared DRAM systems [C] //Proc of the 35th Annual Int Symp on Computer Architecture. Los Alamitos, CA: IEEE Computer Society, 2008:63-74.
  • 6Eeckhout L. Computer Architecture Performance Evaluation Methods, Synthesis Lectures on Computer Architecture [M]. San Rafael, CA: Morgan& Claypool Publishers, 2010.
  • 7Vetter J. Contemporary High Performance Computing: From Petascale toward Exascale [M]. Boca Raton, FL: Chapman & Hall/CRC, 2013.
  • 8Kim Y, Han Dongsu, Mutlu O, et al. ATLAS: A scalable and high performance scheduling algorithm for multiple memory controllers [C] //Proc of the 16th Int Symp on High Performance Computer Architecture. Piscataway, NJ : IEEE, 2010:1-12.
  • 9Mutlu O, Moscibroda T. Stall time fair memory access scheduling for chip muhiprocessors [C] //Proc of the 40th Annual IEEE/ACM Int Syrup on Microarchitecture. Los Alamitos, CA: IEEE Computer Society, 2007.
  • 10Bienia C, Kumar S, Singh J, et al. The PARSEC benchmark suite: Characterization and architectural implications [C] // Proc of the 17th Int Conf on Parallel Architectures and Compilation Techniques. New York: ACM, 2008:72-81.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部