Abstract
This paper describes a compiling strategy for SVM that exploits parallelism and minimises overheads when using an SPMD execution model. Our strategy integrates compiler techniques developed separately for data and control parallelism paradigms and integrates them into one approach. This strategy has been implemented in a prototype compiler, called MARS, currently running on the KSR-1 architecture. The technique is intended to be generic for all SVM systems. Initial results are encouraging.
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
Anderson J.M. and Lam M.S. Global Optimizations for Parallelism and Locality on Scalable Parallel Machines, Proceedings of Programming Languages Design and Implementation, ACM Press, 1993.
Appelbe B., Doddapaneni S. and Hardnett C. A new Algorithm for Global Optimization for Parallelism and Locality, LNCS 892, 7th International Workshop on Languages and Compilers for Parallel Computing, Ithaca, NY, August, 1994.
Beckner S., Chapman B. and Zima H. Vienna Fortran 90, Proceedings of Scalable High Performance Computing Conference, 1992.
Bodin F., Beckman P., Gannon D. and Srinivas J. Sage++: A Class Library for Building Fortran and C++ Restructuring Tools, Second Object-Oriented Numerics Conference, Oregon (USA), April 1994.
Bodin F., Granston E. and Montaut T. Evaluating Two Loop Transformations for Reducing Multiple-Writer False Sharing, LCPC, Springer-Verlag in the Lecture Notes in Computer Science, August 1994.
Bodin F., Eisenbeis C., Jalby W. and Windheiser D. A Strategy for Array Management in Local Memory, Special Issue of Math. Programming B on Applications of Discrete Programming in Computer Science, 1992.
Callahan D., Carr S. and Kennedy K. Improving Register Allocation for Subscripted Variablesxe, Proceedings of the Conference on Programming Language Design and Implementation, 1990.
Choudhary A., Fox G., Hiranandani S., Kennedy K., Koelbel C., Ranka S. and Tseng C. Unified Compilation of Fortran 77D and 90D, ACM Letters on Programming Languages and Systems Vol 2, N 1–4, March-December, 1993.
Gupta M. and Banerjee P. Paradigm: A Compiler for Automatic Data Distribution on Multicomputers, Proceeding of the International Conference on Supercomputing, pp 87–96, 1993.
Lahjomri Z. and Priol T. Koan: A Shared Virtual Memory for the iPSC/2 Hypercube, Proceedings of CONPAR/VAPP92, Lyon, September, 1992.
Lam M., Rothberg E. and Wolf M.E. The Cache Performance and Optimizations of Blocked Algorithms, Proceedings of the Fourth ACMASPLOS Conference, April 1991.
Li J. and Chen M. Index Domain Alignment: Minimizing Cost of Cross-Referencing between Distributed Arrays, IEEE Proceedings of the Third Symposium on the Frontiers of Massively Parallel Computation, October 1990
O’Boyle M.F.P. and Hedayat G.A. Data Alignment: Transformations to Reduce Communication on Distributed Memory Architectures, Scalable High Performance Computing Conference, Williamsburg, April 1992.
O’Boyle M.F.P., Kervella L. and Bodin F. Synchronisation Minimisation in a SPMD execution model, to appear in Journal of Parallel and Distributed Computing special issue on Distributed Shared Memory Systems.
Wolf M.E. and Lam M. A Data Locality Optimizing Algorithm, ACM Conference on Programming Language Design and Implementation, June 26–28, 1991.
Wolf M.E. and Lam M. A Loop Transformation Theory and an Algorithm to Maximize Parallelism, IEEE Transactions on Parallel and Distributed Systems, Vol 2, No 4, October 1991.
Wolfe M.J. Optimizing Supercompilers for Supercomputers, PhD thesis, University of Illinois, October 1982.
Zima H. and Chapman B. Supercompilers for Parallel and Vector Computers, ACM Press, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer Science+Business Media New York
About this chapter
Cite this chapter
Bodin, F., O’Boyle, M. (1996). A Compiler Strategy for Shared Virtual Memories. In: Szymanski, B.K., Sinharoy, B. (eds) Languages, Compilers and Run-Time Systems for Scalable Computers. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2315-4_5
Download citation
DOI: https://doi.org/10.1007/978-1-4615-2315-4_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5979-1
Online ISBN: 978-1-4615-2315-4
eBook Packages: Springer Book Archive