Online Computation of Critical Paths for Multithreaded Languages

We have developed an instrumentation scheme that enables programs written in multithreaded languages to compute a critical path at run time.Our scheme gives not only the length (execution time) of the critical path but also the lengths and locations of all the subpaths making up the critical path. Although the scheme is like Cilk's algorithm in that it uses a \longest path" computation, it allows more exible sync hronization. We implemented our sc heme on top of the concurrent object-oriented language Schematic and conrmed its eectiveness through experiments on a 64-processor symmetric multiprocessor.

• Type: Conference
• Year: 2000
• Where: IPPS
• Authors: Yoshihiro Oyama, Kenjiro Taura, Akinori Yonezawa
• Keywords: Critical Path, Distributed And Parallel Computing, Instrumentation Scheme, IPPS 2000, Run Time.Our Scheme