From Trace Generation to Visualization: A Performance Framework for Distributed Parallel Systems

Wu, C.E.; Bolmarcich, Anthony; Snir, Marc; Wootton, D.; Parpia, F. A.; Chan, Anthony; Lusk, Ewing L.; Gropp, William

doi:10.1109/sc.2000.10050

Cited by 44 publications

(41 citation statements)

References 10 publications

(12 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Profile guided optimization of MPI programs has been a widely researched topic [1], [2], [14], [11], [13]. Our work dynamically collects MPI application profiles, analyzes the application behavior, and proposes ways to improve the execution time of applications.…”

Section: Related Workmentioning

confidence: 99%

Profile Guided MPI Protocol Selection for Point-to-Point Communication Calls

Marathe

Lowenthal

et al. 2011

2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PHD Forum

View full text Add to dashboard Cite

Abstract-Improving communication performance is critical to achieving high performance in message-passing programs. Designing new, efficient protocols to realize point-to-point and collective communication operations has therefore been an active area of research. However, the best protocol for a given communication routine is both application and architecture specific.This paper contributes a new method of selection of the optimal protocol for a given point-to-point communication pair. Our technique analyzes the MPI communication call profile of an application and uses a computation and communication model we have developed to choose the proper protocol for each communication phase. We have applied our system to MPI applications such as CG, Sweep3D and Sparse Matrix multiplication, as well as synthetic applications. Our scheme yields an improvement in total execution time of up to 20% compared to MVAPICH2 and up to 3.2% compared to the best, highly optimized communication protocol for the real applications. Furthermore, experiments on the synthetic applications show that the savings can be much more pronounced.

show abstract

Section: Related Workmentioning

confidence: 99%

Profile Guided MPI Protocol Selection for Point-to-Point Communication Calls

Marathe

Lowenthal

et al. 2011

2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PHD Forum

View full text Add to dashboard Cite

show abstract

“…A number of options are provided to view the result of the execution, for example, the text profiling output for timing information and Jumpshot [24] for viewing the trace files. The configuration of these two routines are straightforward [5].…”

Section: Limitations Of High-level Profiling Withmentioning

confidence: 99%

Mixed-Tool Performance Analysis on Hybrid Multicore Architectures

Łuszczek

Tomov

et al. 2010

2010 39th International Conference on Parallel Processing Workshops

View full text Add to dashboard Cite

Abstract-This paper proposes a triangular solve algorithm with variable block size for graphics processing unit (GPU). By using diagonal blocks inversion with recursion, this algorithm works with tunable block size to achieve the best performance. Various methods are shown on how to make use of existing profiling tools to successfully measure and analyze performance of this algorithm. We use some of the most popular CPU and GPU profiling tools for their advantages and overcome their disadvantages with several new techniques to analyze the performance and relationship of different components of applications. With the presented methodologies, insight information is produced which helps to understand and tune the proposed algorithm and considerably improve the performance of the solver itself as well as the application using it.

show abstract

“…Our first approach (SLOG1 [21]) used frames corresponding to time intervals, with a frame index for scalability. Included in each frame were events from other frames that were "relevant" to the display of this frame.…”

Section: Related Workmentioning

confidence: 99%

An Efficient Format for Nearly Constant-Time Access to Arbitrary Time Intervals in Large Trace Files

Chan

Gropp

Lusk

2008

Scientific Programming

View full text Add to dashboard Cite

Abstract.A powerful method to aid in understanding the performance of parallel applications uses log or trace files containing time-stamped events and states (pairs of events). These trace files can be very large, often hundreds or even thousands of megabytes. Because of the cost of accessing and displaying such files, other methods are often used that reduce the size of the tracefiles at the cost of sacrificing detail or other information.This paper describes a hierarchical trace file format that provides for display of an arbitrary time window in a time independent of the total size of the file and roughly proportional to the number of events within the time window. This format eliminates the need to sacrifice data to achieve a smaller trace file size (since storage is inexpensive, it is necessary only to make efficient use of bandwidth to that storage). The format can be used to organize a trace file or to create a separate file of annotations that may be used with conventional trace files. We present an analysis of the time to access all of the events relevant to an interval of time and we describe experiments demonstrating the performance of this file format.

show abstract

From Trace Generation to Visualization: A Performance Framework for Distributed Parallel Systems

Cited by 44 publications

References 10 publications

Profile Guided MPI Protocol Selection for Point-to-Point Communication Calls

Profile Guided MPI Protocol Selection for Point-to-Point Communication Calls

Mixed-Tool Performance Analysis on Hybrid Multicore Architectures

An Efficient Format for Nearly Constant-Time Access to Arbitrary Time Intervals in Large Trace Files

Contact Info

Product

Resources

About