Data-flow algorithms for parallel matrix computation
Communications of the ACM
Designing efficient algorithms for parallel computers
Designing efficient algorithms for parallel computers
Transputer development system
Performance Analysis of k-ary n-cube Interconnection Networks
IEEE Transactions on Computers
Improving AP1000 parallel computer performance with message communication
ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
PAPS: the parallel program performance prediction toolset
Proceedings of the 7th international conference on Computer performance evaluation : modelling techniques and tools: modelling techniques and tools
Solving Linear Algebraic Equations on an MIMD Computer
Journal of the ACM (JACM)
IEEE Software
CASE: Analysis and Design Tools
IEEE Software
Tools for Multiple-CPU Environments
IEEE Software
Visualizing the Performance of Parallel Programs
IEEE Software
Network performance modeling for PVM clusters
Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
Performance Prediction of PVM Programs
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Fault-tolerant dynamic job scheduling policy
ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
| Hi-index | 0.00 |
This paper describes the general methodology of specifying parallel systems within the PAPS (Performance Analysis of Parallel Systems) toolset and presents a case study that shows the applicability and accuracy of the Petri net based performance prediction tools contained in the toolset. Parallel systems are specified in the PAPS toolset by separately defining the program workload, the hardware resources, and the mapping of the program to the hardware. The resource parameterization is described in detail for a multiprocessor computer with a store & forward communication network. The Gaussian elimination algorithm is taken as a workload example to demonstrate how regularly structured parallel algorithms are modelled with acyclic task graphs. Three different program specifications with various levels of model accuracy are developed and their parameterization is described. The predicted execution time is compared with the measured execution times of the real program on the parallel hardware. It is shown that the Petri net based performance prediction tools provide accurate performance predicitons.