Detecting and using critical paths at runtime in message driven parallel programs

@article{Dooley2010DetectingAU,
  title={Detecting and using critical paths at runtime in message driven parallel programs},
  author={Isaac Dooley and Anshu Arya and Laxmikant V. Kal{\'e}},
  journal={2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW)},
  year={2010},
  pages={1-8}
}
  • Isaac Dooley, Anshu Arya, Laxmikant V. Kalé
  • Published in
    IEEE International Symposium…
    2010
  • Computer Science
  • Detecting critical paths in traditional message passing parallel programs can be useful for post-mortem performance analysis. This paper presents an efficient online algorithm for detecting critical paths for message-driven parallel programs. Initial implementations of the algorithm have been created in three message-driven parallel languages: Charm++, Charisma, and Structured Dagger. Not only does this work describe a novel implementation of critical path detection for the message-driven… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-8 OF 8 CITATIONS

    Techniques in scalable and effective parallel performance analysis

    VIEW 3 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Communication-aware scalability analysis based on critical path

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Critical lock analysis: Diagnosing critical section bottlenecks in multithreaded applications

    • Guancheng Chen, Per Stenström
    • Computer Science
    • 2012 International Conference for High Performance Computing, Networking, Storage and Analysis
    • 2012
    VIEW 2 EXCERPTS
    CITES BACKGROUND & METHODS

    References

    Publications referenced by this paper.
    SHOWING 1-8 OF 8 REFERENCES