A Compiler Strategy for Shared Virtual Memories

François Bodin; Michael O'Boyle

doi:10.1007/978-1-4615-2315-4_5

A Compiler Strategy for Shared Virtual Memories

François Bodin, Michael O'Boyle

School of Informatics

Research output: Chapter in Book/Report/Conference proceeding › Chapter

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.

Original language	English
Title of host publication	Languages, Compilers and Run-Time Systems for Scalable Computers
Editors	Boleslaw K. Szymanski, Balaram Sinharoy
Place of Publication	Boston, MA
Publisher	Springer
Pages	57-69
Number of pages	13
ISBN (Electronic)	978-1-4615-2315-4
ISBN (Print)	978-1-4613-5979-1
DOIs	https://doi.org/10.1007/978-1-4615-2315-4_5
Publication status	Published - 1996

Access to Document

10.1007/978-1-4615-2315-4_5

http://link.springer.com/chapter/10.1007%2F978-1-4615-2315-4_5

Cite this

@inbook{268b12485d3e47629a6e7e7066c03184,

title = "A Compiler Strategy for Shared Virtual Memories",

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.",

author = "Fran{\c c}ois Bodin and Michael O'Boyle",

year = "1996",

doi = "10.1007/978-1-4615-2315-4_5",

language = "English",

isbn = "978-1-4613-5979-1",

pages = "57--69",

editor = "Szymanski, {Boleslaw K.} and Balaram Sinharoy",

booktitle = "Languages, Compilers and Run-Time Systems for Scalable Computers",

publisher = "Springer",

address = "United Kingdom",

}

TY - CHAP

T1 - A Compiler Strategy for Shared Virtual Memories

AU - Bodin, François

AU - O'Boyle, Michael

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

U2 - 10.1007/978-1-4615-2315-4_5

DO - 10.1007/978-1-4615-2315-4_5

M3 - Chapter

SN - 978-1-4613-5979-1

SP - 57

EP - 69

BT - Languages, Compilers and Run-Time Systems for Scalable Computers

A2 - Szymanski, Boleslaw K.

A2 - Sinharoy, Balaram

PB - Springer

CY - Boston, MA

ER -

A Compiler Strategy for Shared Virtual Memories

Abstract

Access to Document

Fingerprint

Cite this