Your browser does not support JavaScript!

access icon free Intention preservation in deterministic multithreading: a partial solution

Deterministic multithreading is a promising new research area that aims to enable reproducible deterministic execution of multithreaded applications. Some of the proposed approaches can render data races deterministic. In this study, the authors introduce the intention preservation problem in multithreaded applications and point out that existing deterministic multithreading approaches do not always preserve the program intention. While it is desirable to automatically capture the full intention of a program and preserve it in deterministic multithreading, it might be an intractable problem. Instead, they provide a partial solution for two specific cases. In the first case, they aim to preserve the program intention for read and write operations on primitive types by tracking read–write causality. In the second case, they preserve the program intention for concurrent write operations on ordered collection types by applying an operational transformation.


    1. 1)
      • 7. Bergan, T., Hunt, N., Ceze, L., et al: ‘Deterministic process groups in dos’. Proc. Ninth USENIX Conf. on Operating Systems Design and Implementation, Berkeley, CA, USA, 2010, pp. 116.
    2. 2)
      • 8. Liu, T., Curtsinger, C., Berger, E.D.: ‘Dthreads: efficient deterministic multithreading’. Proc. 23rd ACM Symp. on Operating Systems Principles, 2011, pp. 327336.
    3. 3)
    4. 4)
      • 9. Lu, K., Zhou, X., Bergan, T., et al: ‘Efficient deterministic multithreading without global barriers’. Proc. 19th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming, 2014, pp. 287300.
    5. 5)
      • 12. Zhao, W.: ‘Concurrency control in real-time e-collaboration systems’, in Kock, N. (Ed.): ‘Encyclopedia of E-Collaboration’ (Idea Group Publishing, 2008), pp. 95101.
    6. 6)
      • 16. Zhao, W.: ‘Intention preservation in deterministic multithreading’. Proc. Eighth Int. Conf. on Future Generation Communication and Networking, 2014, pp. 2932.
    7. 7)
    8. 8)
    9. 9)
      • 1. Hong, K.: ‘C++11 8. race conditions’,, accessed September 2015.
    10. 10)
      • 15. Nichols, D.A., Curtis, P., Dixon, M., et al: ‘High-latency, low-bandwidth windowing in the Jupiter collaboration system’. Proc. Eighth Annual ACM Symp. on User Interface and Software Technology, 1995, pp. 111120.
    11. 11)
    12. 12)
    13. 13)
      • 13. Zhao, W., Babi, M.: ‘Byzantine fault tolerant collaborative editing’. Proc. of the IET Int. Conf. on Information and Communications Technologies, 2013, pp. 233240.
    14. 14)
    15. 15)
    16. 16)
      • 3. Zhao, W., Moser, L., Melliar-Smith, P.M.: ‘Deterministic scheduling for multithreaded replicas’. Proc. of the IEEE Int. Workshop on Object-oriented Real-time Dependable Systems, Sedona, AZ, USA, 2005, pp. 7481.

Related content

This is a required field
Please enter a valid email address