A Compiler Strategy for Shared Virtual Memories

François Bodin, Michael O'Boyle

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract / Description of output

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.
Original languageEnglish
Title of host publicationLanguages, Compilers and Run-Time Systems for Scalable Computers
EditorsBoleslaw K. Szymanski, Balaram Sinharoy
Place of PublicationBoston, MA
PublisherSpringer US
Number of pages13
ISBN (Electronic)978-1-4615-2315-4
ISBN (Print)978-1-4613-5979-1
Publication statusPublished - 1996


Dive into the research topics of 'A Compiler Strategy for Shared Virtual Memories'. Together they form a unique fingerprint.

Cite this