PROGRAM-BASED LOCALITY MEASURES FOR SCIENTIFIC COMPUTING

DOI10.1142/S0129054104002595MaRDI QIDQ3022018zbMATH OpenFDO

Authors Thomas Rauber, Gudula Rünger

Publication date 22 June 2005

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054104002595

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Packaged methods for numerical algorithms (65Y15) Theory of software (68N99)

Recommendations

• Arranging program statements for locality on the basis of neighbourhood preferences
• scientific article; zbMATH DE number 1940305
• Improving whole-program locality using intra-procedural and inter-procedural transformations
• Structuring statement sequences in instance-based locality optimization
• scientific article; zbMATH DE number 4068241

Cites work

• A cost calculus for parallel functional programming
• An analytical model for designing memory hierarchies
• Cache behavior prediction by abstract interpretation
• High order embedded Runge-Kutta formulae
• Klassische Runge-Kutta-Formeln fünfter und siebenter Ordnung mit Schrittweiten-Kontrolle
• Solving Ordinary Differential Equations I

Cited in

(4)

• Arranging program statements for locality on the basis of neighbourhood preferences
• scientific article; zbMATH DE number 1940305 (Why is no real title available?)
• Locality as a visualization tool
• Structuring statement sequences in instance-based locality optimization

This page was built for publication: PROGRAM-BASED LOCALITY MEASURES FOR SCIENTIFIC COMPUTING

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3022018)