Abstract
The Abstract Parallel Machine (APM) model separates the definitions of parallel operations from the application algorithm, which defines the sequence of parallel operations to be executed. An APM contains a set of parallel operation definitions, which specify how the computation is organized into independent sites of computation and what data exchanges are required. This paper adds explicit cost models as the third component of an APM system. The costs of parallel operations can be obtained either by analyzing a parallel operation definition, or by measuring performance on a real machine. Costs with monotonicity constraints allow the cost of an algorithm to be transformed automatically as the algorithm itself is transformed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
F. Abolhassan, J. Keller, and W.J. Paul. On the Cost-Effectiveness of PRAMs. In Proc. 3rd IEEE Symp. on Parallel and Distributed Processing, pages 2–9, 1991.
S. G. Akl. Parallel Computation—Models and Methods. Prentice Hall, 1997.
B. Bacci, M. Danelutto, S. Orlando, S. Pelagatti, and M. Vanneschi. P3L: A structured high level programming language and its structured support. Concurrency: Practice and Experience, 7(3):225–255, 1995.
R. Bird and O. de Moor. Algebra of Programming. Prentice Hall, September 1996.
Murray Cole. Algorithmic Skeletons: Structured Management of Parallel Computation. MIT Press, 1989.
D.E. Culler, R. Karp, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, and T. von Eicken. LogP: Towards a realistic model of parallel computation. 4th Symp. on Principles and Practice of Parallel Programming, 28(4):1–12, 1993.
J. Darlington, A.J. Field, P.G. Harrison, P.H.J. Kelly, D.W.N. Sharp, Q. Wu, and R.L. While. Parallel programming using skeleton functions. In Proceedings of the PARLE’93, volume 694 of LNCS, pages 146–160, Munich, Germany, June 1993.
S. Fortune and J. Wyllie. Parallelism in Random Access Machines. In Proceedings of the 10th ACM Symposium on Theory of Computing, pages 114–118, 1978.
R. Foschia, T. Rauber, and G. Rünger. Modeling the Communication Behavior of the Intel Paragon. In Proc. 5th Symp. on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS’97), IEEE, pages 117–124, 1997.
S. Gorlatch and C. Lengauer. Parallelization of divide-and-conquer in the birdmeertens formalism. Formal Aspects of Computing, 7(6):663–682, 1995.
M. Hill, W. McColl, and D. Skillicorn. Questions and Answers about BSP. Scientific Programming, 6(3):249–274, 1997.
C.B. Jay, M. Cole, M. Sekanina, and P.A. Steckler. A Monadic Calculus for Parallel Costing of a Functional Language of Arrays. In Proc. Euro-Par’97, volume 1300 of LNCS, pages 650–661, 1997.
J. O’Donnell. Research Directions in Parallel Functional Programming, chapter Data Parallelism. Springer Verlag, 1999.
J. O’Donnell and G. Rünger. A methodology for deriving parallel programs with a family of abstract parallel machines. In Euro-Par’97: Parallel Processing, volume 1300 of LNCS, pages 662–669. Springer, August 1997. Passau, Germany.
J. O’Donnell and G. Rünger. Abstract parallel machines. Computers and Artificial Intelligence, To Appear.
P. Pepper. Deductive derivation of parallel programs. In Parallel Algorithm Derivation and Program Transformation, pages 1–53. Kluwer, 1993.
J.E. Savage. Models of Computation. Addison Wesley, 1998.
D. Skillicorn. Cost modeling. In K. Hammond and G. Michaelson, editors, Research Direction in Parallel Functional Programming, pages 207–218. Springer, 1999.
D. Skillicorn and D. Talia. Models and languages for parallel computation. ACM Computing Surveys, 30(2):123–169, 1998.
D.B. Skillicorn. Towards a Framework for Cost-Based Transformations. Journal of Systems and Architecture, 42:331–340, 1995.
D.B. Skillicorn and W. Cai. A Cost Calculus for Parallel Functional Programming. Journal of Parallel and Distributed Computing, 28(1):65–83, 1995.
L.G. Valiant. A bridging model for parallel computation. Comm. of the ACM, 33(8):103–111, 1990.
Z. Xu and K. Hwang. Early Prediction of MPP Performance: SP2, T3D and Paragon Experiences. Parallel Computing, 22:917–942, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
O’Donnell, J., Rauber, T., Rünger, G. (2001). Cost Hierarchies for Abstract Parallel Machines. In: Midkiff, S.P., et al. Languages and Compilers for Parallel Computing. LCPC 2000. Lecture Notes in Computer Science, vol 2017. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45574-4_2
Download citation
DOI: https://doi.org/10.1007/3-540-45574-4_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42862-6
Online ISBN: 978-3-540-45574-5
eBook Packages: Springer Book Archive