A Post-mortem Detection Tool of First Races to Occur in Shared-Memory Programs with Nested Parallelism (내포병렬성을 가진 공유메모리 프로그램에서 최초경합의 수행후 탐지도구)

MunHye Kang (강문혜); Gab-Sig Sim (심갑식)

A Post-mortem Detection Tool of First Races to Occur in Shared-Memory Programs with Nested Parallelism

Journal of The Korea Society of Computer and Information
Abbr : JKSCI
2014, 19(4), pp.17-24
Publisher : The Korean Society Of Computer And Information
Research Area : Engineering > Computer Science

MunHye Kang ¹, Gab-Sig Sim ²

¹국립경남과학기술대학교
²경남과학기술대학교

Accredited

ABSTRACT

Detecting data races is important for debugging shared-memory programs with nestedparallelism, because races result in unintended non-deterministic executions of the program. It isespecially important to detect the first occurred data races for effective debugging, because theremoval of such races may make other affected races disappear or appear. Previous dynamicdetection tools for first race detecting can not guarantee that detected races are unaffected races. Also, the tools does not consider the nesting levels or need support of other techniques. This papersuggests a post-mortem tool which collects candidate accesses during program execution and then detects the first races to occur on the program after execution. This technique is efficient, becauseit guarantees that first races reported by analyzing a nesting level are the races that occur first atthe level, and does not require more analyses to the higher nesting levels than the current level.

KEYWORDS

Shared-memory parallel programs, First-race to occur, Post-mortem

Citation status

* References for papers published after 2023 are currently being built.

[journal] Netzer, R. H. B. / 1992 / What Are Race Conditions? Some Issues and Formalizations / Letters on ProgramLanguages and Systems / ACM 1(1) : 74~88

[confproc] Wester, B. / 2013 / Parallelizing Data Race Detection / The International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) / ACM

[confproc] Banerjee, U. / 2006 / A Theory of Data Race Detection / Workshop on Parallel and Distributed Systems: Testing and Debugging (PADTAD) : 69~78

[confproc] Adve, S. / 1991 / Detecting data races on weak memory systems / In proceedings Of the Annual Int'l Symposium On computer Architecture (ISCA'91) : 234~243

[confproc] Kim, J. / 1998 / Scalable On-the-fly Detection of the First Races in Parallel Programs / Proc. of the 12nd Int'l Conf. on Supercomputing (ICS) / ACM : 345~352

[confproc] Choi, J. / 1991 / RACE FRONTIER:Reproducing Data Races in Parallel Program Debugging / 3rd Symposium on Principles and Practice of Parallel Programming (PPoPP91) / ACM : 145~154

[journal] Ronsse, M. / 1999 / RecPlay: A Fully Integrated Practical Record/Replay System / Transacsion On Computer Systems / ACM 17(2) : 133~152

[confproc] Park, H. / 1998 / Detecting the First Races in Parallel Programs with Ordered Synchronization / 6th Int'l Conf. on Parallel and Distributed Systems / IEEE : 201~208

[confproc] Ha, K. / 2004 / Efficient On-the-fly Detection of First Races in Nested Parallel Programs / Workshop on State-of-the-Art in Scientific Computing (PARA) : 75~84

[confproc] Ayguade, E. / 2004 / Employing Nested OpenMP for the Parallelization of Multi-zone Computational Fluid Dynamics Applications / Proceedings of the 18th Int'l Conference on Parallel and Distributed Processing Symposium (IPDPS) : 6~15

[confproc] Blikberg, R. / 2000 / Nested parallelism:Allocation of processors to tasks and OpenMP implementation / Proceedings of the 2nd Int'l Conference on European Workshop on OpenMP (EWOMP)

[confproc] Bücker, H. M. / 2004 / A Class of OpenMP Applications Involving Nested Parallelism / Proceedings of the 19th ACM Symposium on Applied Computing (SAC) / ACM : 14~17

[book] Chandra, R. / 2001 / Parallel Programming in OpenMP / Academic Press

[confproc] Jun, Y. / 1993 / On-the-fly Detection of Access Anomalies in Nested Parallel Loops / 3rd Workshop on Parallel and Distributed Debugging / ACM : 107~117

[confproc] Dinning, A. / 1990 / An Empirical Comparison of Monitoring Algorithms for Access Anomaly Detection / 2nd Symposium on Principles and Practice of Parallel Programming (PPoPP) / ACM : 1~10

[confproc] M. Kang / 2011 / Efficient Verification of First Tangled Races to Occur in Programs with Nested Parallelism / Proceedings of the ASEA 2011, CCIS 257 / Springer : 437~450

KJCKorea
Journal Central

Journal of The Korea Society of Computer and Information 2023 KCI Impact Factor : 0.65