Abstract
The right model of parallel computation must possess various properties including accurately predicting the behavior of real programs on physical computers. It is argued that this property must be tested experimentally. Three experiments are reviewed supporting the hypothesis that the CTA machine model and the Phase Abstractions programming model predict accurately for real programs on physical computers. Data for ten MIMD computers is reported. Additionally, basic concepts connected with models of computation are reviewed, and several recently developed parallel models are critiqued.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
G. Alverson, W. Griswold, D. Notkin, L. Snyder, “A flexible communication abstraction,” SuperComputing 90, pp. 584–593, 1990.
R. Anderson, L. Snyder, “A comparison of shared and nonshared models,” Proc. of IEEE 79(4):480–487, 1991.
K. Bolding, L. Snyder, “Mesh and torus chaotic routing,” Advanced Research in VLSI, MIT Press, pp. 333–347, 1992.
L. Carter, “The RAM model,” TR RC 16319, IBM Watson Research Lab, 1990.
D. Chinn, F. Leighton, M. Tompa, “Minimal adaptive routing on the mesh with bounded queue size,” Sixth ACM SPAA, pp. 354–363, 1994.
W. Crowley, C. Hendrickson, T. Luby, “The SIMPLE code,” TR UCID-17715, Lawrence Livermore Laboratory, 1978.
D. Culler et al., “LogP: towards a realistic model of parallel computation,” ACM SIGPlan Symp. PPoPP, pp. 1–12, 1993.
M. Dikaiakos, C. Lin, D. Manoussaki, “The portable parallel implementation of two novel mathematical biology algorithms in ZPL,” Ninth ACM Int'l Supercomputing, 1995.
W. Griswold, G. Harrison, D. Notkin, L. Snyder, “Scalable abstractions,” Fifth Dist. Mem. Comp. Conf., IEEE, pp. 1008–1016, 1990.
P. Hatcher et al., “Data-parallel programming,” IEEE Trans. Par. Distrib. Syst. 2(3):377–383, 1991.
W. Hillis, G. Steele, “Data parallel algorithms,” CACM 29(12):1170–1183, 1986.
R. Karp, A. Sahay, E. Santos, K. Schauser, “Optimal broadcast and summation in the LogP model,” Fifth ACM SPAA, pp. 142–153, 1993.
S. Konstantinidou, L. Snyder, “The chaos router,” IEEE Trans. on Computers 43(12):1386–1397, 1994.
E Lewis, C. Lin, L. Snyder, G. Turkiyyah, “A portable parallel N-body solver,” Seventh SIAM Conf. on Parallel Proc. for Scientific Comp., pp. 331–336, 1995.
C. Lin, L. Snyder, “A portable implementation of SIMPLE,” Int'l J. of Par. Prog. 20(5):363–401, 1991.
C. Lin, The portability of parallel programs across MIMD computers, PhD Dissertation, University of Washington, 1992.
C. Lin, L. Snyder, “Accommodating polymorphic data decompositions in explicitly parallel programs,” Eighth Int'l Parallel Proc. Symp., pp. 68–74, 1994.
C. Lin, L. Snyder, “ZPL: an array sublanguage.” In U. Banerjee et al. (Eds.) Lecture Notes in Computer Science, Vol. 768, Springer-Verlag, pp. 96–114, 1994.
C. Lin, ZPL language reference manual, UW CSE TR 94-10-06, 1994.
C. Lin, L. Snyder, “SIMPLE performance results in ZPL.” In K. Pingali et al. (Eds.) Lecture Notes in Computer Science, Vol. 892, Springer-Verlag, pp. 361–375, 1994.
C. Lin et al., “ZPL vs. HPF: A comparison of performance,” UW CSE Technical Report, 1994.
T. Ngo, L. Snyder, “On the influence of programming models,” Scalable High Perf. Computing Conf., IEEE, pp. 284–291, 1992.
T. Ngo, L. Snyder, “Data locality on shared memory computers,” UW TR 93-06-08, 1993.
A. Rogers, Compiling for locality of reference, PhD dissertation, Cornell, 1990.
J. Schwartz, “Ultracomputers,” ACM ToPLaS 2(4):484–521, 1980.
L. Snyder, “Type architecture, shared memory and the corollary of modest potential,” Annual Review of CS, I:289–317, 1986.
L. Snyder, “A taxonomy of synchronous parallel machines,” Int'l Conf. on Parallel Proc., Penn State, pp. 281–285, 1988.
L. Snyder, “The XYZ abstraction levels.” In D. Gelernter et al. (Eds.) Lang. Compilers for Parallel Comp., MIT Press, pp. 470–489, 1990.
L. Snyder, “Applications of the ‘phase abstractions'.” In J. Saltz and P. Mehrotra (Eds.) Lang. Compilers and Run-time Environ. for Dist. Mem. Mach., Elsevier, pp. 79–102, 1992.
L. Snyder, “A practical parallel programming model,” AMS DIMACS Series in Disc. Math and Theoretical CS 18:143–160, 1994.
L. Snyder, “ZPL programmer's guide,” UW TR 94-12-02, 1994.
L. Snyder, “Foundations of practical parallel languages.” In J. Ferrante and A. Hey (Eds.) Portability and Perform. for Parallel Proc., John Wiley & Sons, pp. 1–19, 1994.
L. Valiant, “Parallelism in comparison problems,” SIAM J. Comp. 4(3):348–355, 1975.
L. Valiant, “A bridging model for parallel computation,” CACM 33(8):103–111, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Snyder, L. (1995). Experimental validation of models of parallel computation. In: van Leeuwen, J. (eds) Computer Science Today. Lecture Notes in Computer Science, vol 1000. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015238
Download citation
DOI: https://doi.org/10.1007/BFb0015238
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60105-0
Online ISBN: 978-3-540-49435-5
eBook Packages: Springer Book Archive