skip to main content
poster

RaceFree: an efficient multi-threading model for determinism

Authors Info & Claims
Published:23 February 2013Publication History
Skip Abstract Section

Abstract

Current deterministic systems generally incur large overhead due to the difficulty of detecting and eliminating data races. This paper presents RaceFree, a novel multi-threading runtime that adopts a relaxed deterministic model to provide a data-race-free environment for parallel programs. This model cuts off unnecessary shared-memory communication by isolating threads in separated memories, which eliminates direct data races. Meanwhile, we leverage the happen-before relation defined by applications themselves as one-way communication pipes to perform necessary thread communication. Shared-memory communication is transparently converted to message-passing style communication by our Memory Modification Propagation (MMP) mechanism, which propagates local memory modifications to other threads through the happen-before relation pipes. The overhead of RaceFree is 67.2% according to our tests on parallel benchmarks.

References

  1. D. Joseph, L. Brandon, C. Luis, and O. Mark, "DMP: deterministic shared memory multiprocessing," in Proceeding of the 14th international conference on Architectural support for programming languages and operating systems Washington, DC, USA: ACM, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. Olszewski, J. Ansel, and S. Amarasinghe, "Kendo: efficient deterministic multithreading in software," in Proceeding of the 14th international conference on Architectural support for programming languages and operating systems, 2009, pp. 97--108. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. X. Zhou, K. Lu, X. Wang, and X. Li, "Exploiting parallelism in deterministic shared memory multiprocessing," J.ParallelDistrib.Comput., pp. 72(2012)716--727, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. B. Tom, A. Owen, D. Joseph, C. Luis, and G. Dan, "CoreDet: a compiler and runtime system for deterministic multithreaded execution," in Proceedings of the fifteenth edition of ASPLOS on Architectural support for programming languages and operating systems Pittsburgh, Pennsylvania, USA: ACM, 2010, pp. 53--64. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. T. Liu, C. Curtsinger, and E. D. Berger, "DTHREADS: Efficient Deterministic Multithreading," in Proceedings of the 22nd ACM Symposium on Operating Systems Principles, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. S. Park, Y. Zhou, W. Xiong, Z. Yin, R. Kaushik, K. H. Lee, and S. Lu, "PRES: probabilistic replay with execution sketching on multiprocessors," in Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles, 2009, pp. 177--192. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. G. Altekar and I. Stoica, "ODR: output-deterministic replay for multicore debugging," in Proceedings of the 22nd ACM Symposium on Operating Systems Principles, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. D. Subhraveti and J. Nieh, "Record and transplay: partial checkpointing for replay debugging across heterogeneous systems," 2011, pp. 109--120. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. H. Patil, C. Pereira, M. Stallcup, G. Lueck, and J. Cownie, "Pinplay: a framework for deterministic replay and reproducible analysis of parallel programs," in Proceedings of the 8th annual IEEE/ACM international symposium on Code generation and optimization, 2010, pp. 2--11. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. L. Lamport, "Time, clocks, and the ordering of events in a distributed system," Communications of the ACM, vol. 21, pp. 558--565, 1978. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. G. W. Dunlap, S. T. King, S. Cinar, M. A. Basrai, and P. M. Chen, "ReVirt: enabling intrusion analysis through virtual-machine logging and replay," ACM SIGOPS Operating Systems Review, vol. 36, pp. 211--224, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. RaceFree: an efficient multi-threading model for determinism

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!