Jump to content United States-English
HP.com Home Products and Services Support and Drivers Solutions How to Buy
» Contact HP

HP.com home


Technical Reports



» 

HP Labs

» Research
» News and events
» Technical reports
» About HP Labs
» Careers @ HP Labs
» Worldwide sites
» Downloads
Content starts here

 
Click here for full text: Postscript PDF

Automatically Pipelining Loop Iterations on Distributed-Memory Machines

Offner, Carl D.

HPL-2005-176

Keyword(s): dependence analysis; compiler optimizations; High Performance Fortran; HPF; parallelism; distributed memory

Abstract: This paper really has two parts: 1. We start with an expository discussion of LU decomposition, including a motivation as well as a clean derivation of the standard algorithm. 2. Then we show how a clever HPF compiler could infer--simply from the HPF data mapping directives--that the outer loop can be pipelined. This inference is made possible by an extension of the ordinary notion of dependence to include what are here called spatial dependences.

31 Pages

Back to Index

»Technical Reports

» 2009
» 2008
» 2007
» 2006
» 2005
» 2004
» 2003
» 2002
» 2001
» 2000
» 1990 - 1999

Heritage Technical Reports

» Compaq & DEC Technical Reports
» Tandem Technical Reports
Printable version
Privacy statement Using this site means you accept its terms Feedback to HP Labs
© 2009 Hewlett-Packard Development Company, L.P.