The visualization of parallel systems: an overview
Journal of Parallel and Distributed Computing - Special issue on tools and methods for visualization of parallel systems and computations
SIEVE: a performance debugging environment for parallel programs
Journal of Parallel and Distributed Computing - Special issue on tools and methods for visualization of parallel systems and computations
Dynamic control of performance monitoring on large scale parallel systems
ICS '93 Proceedings of the 7th international conference on Supercomputing
Solaris multithreaded programming guide
Solaris multithreaded programming guide
Software—Practice & Experience
The SPLASH-2 programs: characterization and methodological considerations
ISCA '95 Proceedings of the 22nd annual international symposium on Computer architecture
Programming with threads
Partitioning and Scheduling Parallel Programs for Multiprocessors
Partitioning and Scheduling Parallel Programs for Multiprocessors
Extensible Parallel Program Performance Visualization
MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
PERFSIM: a tool for automatic performance analysis of data-parallel Fortran programs
FRONTIERS '95 Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)
Predicting the Speedup of Multithreaded Solaris Programs
HIPC '97 Proceedings of the Fourth International Conference on High-Performance Computing
A Tool for Binding Threads to Processors
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Bounding the minimal completion time in high-performance parallel processing
International Journal of High Performance Computing and Networking
| Hi-index | 0.00 |
Eficient performance tuning of parallel programs is often hard. In this paper we describe an approach that uses a uni-processor execution of a multithreaded program as reference to simulate a multiprocessor execution. The speed-up is predicted, and the program behaviour is visualized as a graph, which can be used in the performance tuning process.The simulator considers scheduling as well as hard-ware parameters, e.g., the thread priority, no. of LWPs, and no. of CPUs. The visualization part shows the simulated execution in two graphs: one showing the threads' behaviour over time and the other the amount of parallelism over time. In the first graph is it possible to relate an event in the graph to the code line causing the event. Validation using a Sun multiprocessor with eight processors and five scientific parallel applications shows that the speed-up predictions are within +/-6% of a real execution.