Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Sequoia: Programming the Memory Hierarchy Kayvon Fatahalian Timothy J. Knight Mike Houston Mattan Erez
 

Summary: Sequoia: Programming the Memory Hierarchy
Kayvon Fatahalian Timothy J. Knight Mike Houston Mattan Erez
Daniel Reiter Horn Larkhoon Leem Ji Young Park Manman Ren
Alex Aiken William J. Dally Pat Hanrahan
Stanford University
Abstract
We present Sequoia, a programming language designed to
facilitate the development of memory hierarchy aware paral-
lel programs that remain portable across modern machines
featuring different memory hierarchy configurations. Se-
quoia abstractly exposes hierarchical memory in the pro-
gramming model and provides language mechanisms to de-
scribe communication vertically through the machine and to
localize computation to particular memory locations within
it. We have implemented a complete programming sys-
tem, including a compiler and runtime systems for Cell
processor-based blade systems and distributed memory clus-
ters, and demonstrate efficient performance running Sequoia
programs on both of these platforms.
1 Introduction

  

Source: Aiken, Alex - Department of Computer Science, Stanford University
Erez, Mattan - Department of Electrical and Computer Engineering, University of Texas at Austin
Stanford University - Computer Graphics Laboratory

 

Collections: Computer Technologies and Information Sciences; Engineering