Abstract
The IBM Scalable Shared Memory Project Machine (SSMP) is an SCOMA research prototype machine. Due to large latencies of non-local data access, the primary concerns of the compiler are locality, data layout, and scheduling of work to where data is currently located — goals that are similar to a compiler for a distributed memory machine. The presence of a global shared memory simplifies code generation for irregular computations and facilitates the use of dynamic scheduling for better load-balancing.
This is a preview of subscription content, log in via an institution to check access.
References
J. M. Anderson and M. S. Lam. Global optimizations for parallelism and locality on scalable parallel machines. In Proc. ACM SIGPLAN '93 Conference on Programming Language Design and Implementation, Albuquerque, New Mexico, June 1993.
U. Banerjee.Loop Transformations for Restructuring Compilers: The Foundations. Kluwer Academic, Boston, Mass., 1993.
S. Chatterjee, J. R. Gilbert, R. Schreiber, and S. H. Teng. Automatic array alignment in data-parallel programs. In Proc. Twentieth Annual ACM Symposium on Principles of Programming Languages, Charleston, SC, January 1993.
M. Gupta and P. Banerjee. PARADIGM: A Compiler for Automatic Data Distribution on Multicomputers. In Proc. 7th ACM International Conference on Supercomputing, Tokyo, Japan, July 1993.
M. Gupta, S. Midkiff, E. Schonberg, V. Seshadri, K.Y. Wang, D. Shields, W.-M. Ching, and T. Ngo. An HPF compiler for the IBM SP2. In Proc. Supercomputing '95, San Diego, CA, December 1995.
S. Hiranandani, K. Kennedy, and C-W Tseng. Compiler optimizations for fortran d on mimd distributed-memory machi nes. CACM, pages 86–100, July 1991.
T. Mowry. Tolerating latency through software-controlled data prefetching. PhD thesis, Stanford University, March 1994.
C.D. Polychronopoulos. Parallel programming and compilers. Kluwer Academic, Boston, Mass., 1988.
R. Ponnusamy and J. Saltz ad A. Choudhary. Runtime-compilation techniques for data partitioning and communication schedule reuse. In Proceedings Supercomputing '93, pages 361–370, Nov 1993.
P. Trancoso and J. Torrellas. The impact of speeding up critical sections with data prefetching and forwarding. In Proceeding of the 1996 ICPP, Aug 1996.
S. VanderWiel and D.J. Lilja. When caches are not enough: A review of data prefetching techniques. IEEE Computer, 1997. To Appear.
M.E. Wolf. Improving Locality and Parallelism in Nested Loops. PhD thesis, Stanford University, Aug 1992.
Z. Zhang and J. Torrellas. Speeding up irregular applications in shared-memory multiprocessors: Memory binding and group prefetching. In Proceedings of the 22nd International Symposium on Computer Architecture, June 1995.
H. Zima and B. Chapman. Compiling for distributed-memory systems. Proceedings of the IEEE, 81-13(2):264–287, Feb 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gupta, M., Midkiff, S.P. (1998). A compiler for the ibm scalable shared memory project machine — extended abstract. In: Li, Z., Yew, PC., Chatterjee, S., Huang, CH., Sadayappan, P., Sehr, D. (eds) Languages and Compilers for Parallel Computing. LCPC 1997. Lecture Notes in Computer Science, vol 1366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032709
Download citation
DOI: https://doi.org/10.1007/BFb0032709
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64472-9
Online ISBN: 978-3-540-69788-6
eBook Packages: Springer Book Archive