Isaacs et al., 2015 - Google Patents
Recovering logical structure from Charm++ event tracesIsaacs et al., 2015
View PDF- Document ID
- 5642472824409125741
- Author
- Isaacs K
- Bhatele A
- Lifflander J
- Böhme D
- Gamblin T
- Schulz M
- Hamann B
- Bremer P
- Publication year
- Publication venue
- Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis
External Links
Snippet
Asynchrony and non-determinism in Charm++ programs present a significant challenge in analyzing their event traces. We present a new framework to organize event traces of parallel programs written in Charm++. Our reorganization allows one to more easily explore …
- 238000004458 analytical method 0 abstract description 10
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Programme initiating; Programme switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5061—Partitioning or combining of resources
- G06F9/5066—Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/34—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation; Recording or statistical evaluation of user activity, e.g. usability assessment
- G06F11/3409—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation; Recording or statistical evaluation of user activity, e.g. usability assessment for performance assessment
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/34—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation; Recording or statistical evaluation of user activity, e.g. usability assessment
- G06F11/3466—Performance evaluation by tracing or monitoring
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/36—Preventing errors by testing or debugging software
- G06F11/3604—Software analysis for verifying properties of programs
- G06F11/3612—Software analysis for verifying properties of programs by runtime analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/40—Transformations of program code
- G06F8/41—Compilation
- G06F8/45—Exploiting coarse grain parallelism in compilation, i.e. parallelism between groups of instructions
- G06F8/456—Parallelism detection
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/36—Preventing errors by testing or debugging software
- G06F11/362—Software debugging
- G06F11/3636—Software debugging by tracing the execution of the program
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/40—Transformations of program code
- G06F8/41—Compilation
- G06F8/44—Encoding
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/36—Preventing errors by testing or debugging software
- G06F11/3668—Software testing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
- G06F17/5009—Computer-aided design using simulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F2201/00—Indexing scheme relating to error detection, to error correction, and to monitoring
- G06F2201/86—Event-based monitoring
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/70—Software maintenance or management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/30—Creation or generation of source code
- G06F8/31—Programming languages or programming paradigms
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Ozdal et al. | Energy efficient architecture for graph analytics accelerators | |
Isaacs et al. | State of the Art of Performance Visualization. | |
Geimer et al. | The Scalasca performance toolset architecture | |
US8627335B2 (en) | Method and apparatus for data space profiling of applications across a network | |
Morari et al. | A quantitative analysis of OS noise | |
US20080127149A1 (en) | Method and Apparatus for Computing User-Specified Cost Metrics in a Data Space Profiler | |
US20080177756A1 (en) | Method and Apparatus for Synthesizing Hardware Counters from Performance Sampling | |
US8990551B2 (en) | Analysis and visualization of cluster resource utilization | |
US9367428B2 (en) | Transparent performance inference of whole software layers and context-sensitive performance debugging | |
Garcia Pinto et al. | A visual performance analysis framework for task‐based parallel applications running on hybrid clusters | |
US20120131559A1 (en) | Automatic Program Partition For Targeted Replay | |
Guo et al. | G2: A graph processing system for diagnosing distributed systems | |
Isaacs et al. | Recovering logical structure from Charm++ event traces | |
Liu et al. | A new approach for performance analysis of OpenMP programs | |
Schmidl et al. | Performance analysis techniques for task-based OpenMP applications | |
US8412744B2 (en) | Visualization of runtime analysis across dynamic boundaries | |
Bobrek et al. | Modeling shared resource contention using a hybrid simulation/analytical approach | |
Isaacs et al. | Ordering traces logically to identify lateness in message passing programs | |
Pinto et al. | Providing in-depth performance analysis for heterogeneous task-based applications with starvz | |
Li et al. | Multicore profiling for Erlang programs using Percept2 | |
Ceballos et al. | Formalizing data locality in task parallel applications | |
Boushehrinejadmoradi et al. | A parallelism profiler with what-if analyses for openmp programs | |
Dubrulle et al. | A low-overhead dedicated execution support for stream applications on shared-memory CMP | |
Wei et al. | Using sample-based time series data for automated diagnosis of scalability losses in parallel programs | |
Zhou et al. | Low overhead and context sensitive profiling of gpu-accelerated applications |