ACM Home Page
Please provide us with feedback. Feedback
Performance prediction of parallel processing systems: the PAMELA methodology
Full text PdfPdf (1.05 MB)
Source International Conference on Supercomputing archive
Proceedings of the 7th international conference on Supercomputing table of contents
Tokyo, Japan
Pages: 318 - 327  
Year of Publication: 1993
ISBN:0-89791-600-X
Author
Sponsor
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 36,   Citation Count: 13
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/165939.166002
What is a DOI?

ABSTRACT

In this paper we present a new methodology for the performance prediction of parallel programs on parallel platforms ranging from shared-memory to distributed-memory (vector) machines. The methodology comprises a procedural program and machine specification paradigm based on PAMELA (PerformAnce ModEling LAnguage), along with a performance calculus, called “serialization analysis”. This calculus extends conventional parallel program analysis technology by explicitly accounting for resource contention, yet at the low evaluation cost typical for static techniques. It is shown that, where conventional techniques introduce fundamental errors, predictions from serialization analysis remain realistic. Apart from the merits of the methodology itself, this high reliability/cost ratio makes PAMELA an attractive candidate for compile-time application within the performance prediction hierarchy often found in parallel programming environments.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
W. Abu-Sufah and A.D. Malony, "Vector processing on the Alliant FX/8 multiprocessor," in Proc. Int. Conf. Parallel Proc., Aug. 1986, pp. 559-566.
 
2
3
 
4
G.R. Andrews and F.B. Schneider, "Concepts and notations for concurrent programming," Computing Surveys, vol. 266, no. 24, 1987, pp. 132-145.
5
6
 
7
L. Bomans and D. Roose, "Benchmarking the iPSC/2 hypercube multiprocessor," Concurrency-Practice and Experience, vol. 1, Sept. 1989, pp. 3-18.
8
 
9
D. Calahan, K.D. Cooper, R.T. Hood, K. Kennedy, and L. Torczon, "ParaScope: A parallel programming environment," Int. Journ. of Supercomp. Applic., vol. 4, no. 2, 1988, pp. 84-99.
 
10
 
11
O.J. Dahl and K. Nygaard, Simula: A Language for Programming and Description of Discrete Event Systems. Norwegian Computing Center, Oslo, 1967.
 
12
F. Darema, D.A. George, V.A. Norton, and G.F. Pfister, "A single-program-multiple-data computation model for EPEX/FORTRAN," Parallel Computing, vol. 7, 1988, pp. 11-24.
 
13
W. Ewinger, O. Haan, E. Haupenthal, and C. Siemers, "Modelling and measurement of memory access in SIEMENS VP supercomputers," Parallel Computing, vol. 11, 1989, pp. 361-365.
14
 
15
 
16
A.J.C. van Gemund, "Performance modeling with PAMELA: An introduction," Tech. Rep. 1-68340- 44(1992)01, Delft University of Technology, Dec. 1992.
 
17
18
 
19
R.W. Hockney and I.J. Curington, "(f1/2): A parameter to characterize memory and communication bottlenecks," Parallel Computing, vol. 10, 1989, pp. 277-286.
 
20
H. Jonkers, "Introduction to probabilistic performance modelling of parallel applications," Tech. Rep. 1-68340- 44(1993)04, Delft University of Technology, Apr. 1993.
 
21
H.F. Jordan, "The Force," in The Characteristics of Parallel Algorithms (L.H. Jamieson, D. Gannon, and R.J. Douglas, eds.), MIT Press, 1987, pp. 395-436.
 
22
 
23
 
24
 
25
O. Kolp and H. Mierendorff, "Performance estimations for SUPRENUM systems," Parallel Computing, vol. 7, 1988, pp. 357-366.
 
26
 
27
B.P. Lester, "A system for computing the speedup of parallel programs," in Proc. Int. Conf. Parallel Proc., Aug. 1986, pp. 145-152.
 
28
 
29
 
30
 
31
 
32
33
 
34
ParaSoft Corporation, EXPRESS user's manual, 1989.
 
35
C.D. Polychronopoulos and U. Banerjee, "Speedup bounds and processor allocation for parallel programs on multiprocessors," in Proc. Int. Conf. Parallel Proc., Aug. 1986, pp. 961-968.
 
36
C.D. Polychronopoulos, M. Girkar, M.R. Haghighat, C.L. Lee, B. Leung, and D. Schouten, "Parafrase-2: An environment for parallelizing, partitioning, synchronizing, and scheduling programs on multiprocessors," in Proc. Int. Conf. Parallel Proc., Aug. 1989, vol. II, pp. 39-48.
 
37
 
38
39
 
40
K. So and V.A. Norton, "A speedup analyzer for parallel programs," in Proc. int. Conf. Parallel Proc., Aug. 1987, pp. 653-661.
 
41
B. Stramm and F. Berman, "Predicting the performance of large programs on scalable multicomputers," in Scalable HPC Conference, Apr. 1992, pp. 22-29.
 
42
 
43
K-Y. Wang, "Intelligent program optimization and parallelization for parallel computers," Tech. Rep. CSD- TR 91-030, Purdue University, Apr. 1991.

CITED BY  13

Collaborative Colleagues:
Arjan J. C. van Gemund: colleagues