View in EDS

Fast classification of MPI applications using Lamport’s logical clocks.

Saved in:
Bibliographic Details
Title: Fast classification of MPI applications using Lamport’s logical clocks.
Authors: Tong, Zhou1 tong@cs.fsu.edu, Pakin, Scott2 pakin@lanl.gov, Lang, Michael2 mlang@lanl.gov, Yuan, Xin1 xyuan@cs.fsu.edu
Source: Journal of Parallel & Distributed Computing. Oct2018, Vol. 120, p77-88. 12p.
Subjects: Logical clocks, Counters (Computer science), Distributed computing, Computer networks, Cloud computing
Abstract: We present a novel trace-based analysis tool that rapidly classifies an MPI application as bandwidth-bound, latency-bound, load-imbalance-bound, or computation-bound for different interconnection networks. The tool uses an extension of Lamport’s logical clock to track application progress in the trace replay. It has two unique features. First, it can predict application performance for many latency and bandwidth parameters from a single replay of the trace. Second, it infers the performance characteristics of an application and classifies the application using the predicted performance trend for a range of network configurations instead of using the predicted performance for a particular network configuration. We describe the techniques used in the tool and its design and implementation, and report our performance study of the tool and our experience with classifying twelve applications and mini-apps from the DOE DesignForward project as well as the NAS Parallel Benchmarks. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Parallel & Distributed Computing is the property of Academic Press Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:We present a novel trace-based analysis tool that rapidly classifies an MPI application as bandwidth-bound, latency-bound, load-imbalance-bound, or computation-bound for different interconnection networks. The tool uses an extension of Lamport’s logical clock to track application progress in the trace replay. It has two unique features. First, it can predict application performance for many latency and bandwidth parameters from a single replay of the trace. Second, it infers the performance characteristics of an application and classifies the application using the predicted performance trend for a range of network configurations instead of using the predicted performance for a particular network configuration. We describe the techniques used in the tool and its design and implementation, and report our performance study of the tool and our experience with classifying twelve applications and mini-apps from the DOE DesignForward project as well as the NAS Parallel Benchmarks. [ABSTRACT FROM AUTHOR]
ISSN:07437315
DOI:10.1016/j.jpdc.2018.05.005