Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Fast greedy weighted fusion

From MaRDI portal
Publication:698451
Jump to:navigation, search

DOI10.1023/A:1012241830762zbMATH Open1019.68027MaRDI QIDQ698451FDOQ698451

Ken Kennedy

Publication date: 18 September 2002

Published in: International Journal of Parallel Programming (Search for Journal in Brave)




zbMATH Keywords

memory hierarchyloop fusiongreedy heuristicscache reusecompiler optimization


Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)




   Recommendations
  • On the complexity of loop fusion πŸ‘ πŸ‘Ž
  • Improving effective bandwidth through compiler enhancement of global cache reuse πŸ‘ πŸ‘Ž
  • A polynomial-time algorithm for memory space reduction πŸ‘ πŸ‘Ž
  • Cache-Friendly implementations of transitive closure πŸ‘ πŸ‘Ž
  • Programming Languages and Systems πŸ‘ πŸ‘Ž





This page was built for publication: Fast greedy weighted fusion

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:698451&oldid=12604634"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 09:49. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki