Handling irreducible loops: Optimized node splitting vs. DJ-graphs

DOI10.1007/3-540-44681-8_32MaRDI QIDQ4791896zbMATH OpenFDO

Authors Sebastian Unger, Frank Mueller

Publication date 4 February 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2150/21500207

Mathematics Subject Classification ID

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

Recommendations

• Euro-Par 2004 Parallel Processing
• Data-dependency graph transformations for instruction scheduling
• Folklore confirmed
• Revisiting cycle shrinking
• Loop transformations, convexity, pruning and optimization

Cited in

(1)

• Euro-Par 2004 Parallel Processing

This page was built for publication: Handling irreducible loops: Optimized node splitting vs. DJ-graphs

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