PinPlay

Patil, Harish; Pereira, Cristiano; Stallcup, Mack; Lueck, Gregory; Cownie, James H.

doi:10.1145/1772954.1772958

Cited by 164 publications

(7 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Intel proposed PinPlay [40], which is an R&R technique built atop their Pin dynamic instrumentation framework. PinPlay provides highly flexible R&R options (e.g., subgroup replay) and offers composability with other Pin-based tools (thus, pursuing generality).…”

Section: Debugging-centric Techniquesmentioning

confidence: 99%

Record-and-Replay Techniques for HPC Systems: A Survey

Chapp

Sato

Ahn

et al. 2018

JSFI

View full text Add to dashboard Cite

Record-and-replay techniques provide the ability to record executions of nondeterministic applications and re-execute them identically. These techniques find use in the contexts of debugging, reproducibility, and fault-tolerance, especially in the presence of nondeterministic factors such as message races. Record-and-replay techniques are highly diverse in terms of the fidelity of replay they provide, the assumptions they make about the recorded application, the programming models they target, and the runtime overheads they impose. In the high performance computing (HPC) environment, all the above factors must be considered in concert, thus presenting additional implementation challenges. In this manuscript, we survey record-and-replay techniques in terms of the programming models they target and the workloads on which they were evaluated, providing a categorization of these techniques benefiting application developers and researchers targeting exascale challenges. This manuscript answers three questions through this survey: What are the gaps in the existing space of record-and-replay techniques? What is the roadmap to widespread use of record-and-replay on production-scale HPC workloads? And, what are the critical open problems that must be addressed to make record-and-replay viable at exascale?

show abstract

Section: Debugging-centric Techniquesmentioning

confidence: 99%

Record-and-Replay Techniques for HPC Systems: A Survey

Chapp

Sato

Ahn

et al. 2018

JSFI

View full text Add to dashboard Cite

show abstract

“…One could apply a traditional thread-based record-andreplay system on dynamic multithreaded computation directly, and record all sources of nondeterminism in order to replay deterministically. PinPlay [57] is such a general record and replay system based on Pin, a popular dynamic binary instrumentation framework [50], that captures all sources of nondeterminism including racy memory accesses, thread interleavings, and results from system calls. We ran PinPlay on Delaunay Refinement (refine described in Section 5) and find that it has 96.8× overhead for recording and 16.1× overhead for replay when executing the computation on one worker -1-2 orders of magnitudes worse than the PORRidge overheads of 1.26× and 1.16×, respectively.…”

Section: Related Workmentioning

confidence: 99%

Processor-Oblivious Record and Replay

et al. 2017

View full text Add to dashboard Cite

Record-and-replay systems are useful tools for debugging non-deterministic parallel programs by first recording an execution and then replaying that execution to produce the same access pattern. Existing record-and-replay systems generally target thread-based execution models, and record the behaviors and interleavings of individual threads. Dynamic multithreaded languages and libraries, such as the Cilk family, OpenMP, TBB, etc., do not have a notion of threads. Instead, these languages provide a processoroblivious model of programming, where programs expose task-parallelism using high-level constructs such as spawn/sync without regard to the number of threads/cores available to run the program. Thread-based record-and-replay would violate the processor-oblivious nature of these programs, as they incorporate the number of threads into the recorded information, constraining the replayed execution to the same number of threads. In this paper, we present a processor-oblivious recordand-replay scheme for such languages where record and replay can use different number of processors and both are scheduled using work stealing. We provide theoretical guarantees for our record and replay scheme-namely that record is optimal for programs with one lock and replay is near-optimal for all cases. In addition, we implemented this scheme in the Cilk Plus runtime system and our evaluation indicates that processor-obliviousness does not cause substantial overheads.

show abstract

“…Our technique is easily applicable to parallel programs, as that would only require modifications to the Pin-based tracing mechanism. While tracing a multi-threaded program can potentially increase the overhead, this problem can be abated using selective record and replay, e.g., PinPlay [29].…”

Section: Gccmentioning

confidence: 99%

Automatic fault location for data structures

Singh

Gupta

Neamtiu

2016

Proceedings of the 25th International Conference on Compiler Construction

View full text Add to dashboard Cite

Specification-based data structure verification is a powerful debugging technique. In this work we combine specification-based data structure verification with automatic detection of faulty program statements that corrupt data structures. The user specifies the consistency constraints for dynamic data structures as relationships among the nodes of a memory graph. Our system detects constraint violations to identify corrupted data structures during program execution and then automatically locates faulty code responsible for data structure corruption. Our approach offers two main advantages: (1) a highly precise automatic fault location method, and (2) a simple specification language. We employ incremental constraint checking for time efficient constraint matching and fault location. On average, while Tarantula statistical debugging technique narrows the fault to 10 statements, our technique narrows it to ≈ 4 statements. 30 31 void split ( int x, int y, struct qdtree * node) 32 { 33 struct qdtree * temp; 34 for ( i = 0; i < 4; i ++) { 35 temp = (struct qdtree * )malloc(sizeof(qdtree)); 36 set node fields (temp, i , node); 37 node→ child[i] = temp; 38 if (x==node[i]→ posX && y==node[i]→ posY) { 39 ... 40 parent node→ child[0]= NULL; 41 } 42 else { 43 move value(node, node→ child[i]); 44 assign value(x, y, node→ child[i]); 45 } 46 } 47 }

show abstract

PinPlay

Cited by 164 publications

References 20 publications

Record-and-Replay Techniques for HPC Systems: A Survey

Record-and-Replay Techniques for HPC Systems: A Survey

Processor-Oblivious Record and Replay

Automatic fault location for data structures

Contact Info

Product

Resources

About