Improving locality for adaptive irregular scientific codes

MaRDI QIDQ4406687zbMATH OpenFDO

Authors Hwansoo Han, Chau-Wen Tseng

Publication date 26 June 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2017/20170173.htm

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20) Computing methodologies and applications (68U99)

Recommendations

• Hypergraph-based irregular application locality optimization
• PROGRAM-BASED LOCALITY MEASURES FOR SCIENTIFIC COMPUTING
• Modeling and improving locality for the sparse-matrix–vector product on cache memories
• Reducing communication cost for parallelizing irregular scientific codes
• Efficient compiler and run-time support for parallel irregular reductions

Cited in

(4)

• PROGRAM-BASED LOCALITY MEASURES FOR SCIENTIFIC COMPUTING
• Locality behavior of parallel and sequential algorithms for irregular graph problems
• Improving memory hierarchy performance for irregular applications using data and computation reorderings
• Parallelization issues of a code for physically-based simulation of fabrics

This page was built for publication: Improving locality for adaptive irregular scientific codes

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