loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
Sequoia: Programming the Memory Hierarchy
Tampa, Florida
November 11-November 17
ISBN: 0-7695-2700-0
Kayvon Fatahalian, Stanford University
Timothy J. Knight, Stanford University
Mike Houston, Stanford University
Mattan Erez, Stanford University
Daniel Reiter Horn, Stanford University
Larkhoon Leem, Stanford University
Ji Young Park, Stanford University
Manman Ren, Stanford University
Alex Aiken, Stanford University
William J. Dally, Stanford University
Pat Hanrahan, Stanford University
We present Sequoia, a programming language designed to facilitate the development of memory hierarchy aware parallel programs that remain portable across modern machines featuring different memory hierarchy configurations. Sequoia abstractly exposes hierarchical memory in the programming model and provides language mechanisms to describe communication vertically through the machine and to localize computation to particular memory locations within it. We have implemented a complete programming system, including a compiler and runtime systems for Cell processor-based blade systems and distributed memory clusters, and demonstrate efficient performance running Sequoia programs on both of these platforms.
Citation:
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, "Sequoia: Programming the Memory Hierarchy," sc, pp.4, Proceedings of the 2006 ACM/IEEE conference on Supercomputing, 2006
Usage of this product signifies your acceptance of the Terms of Use.