Schedule-Independent Storage Mapping for Loops

Computer Science

• for Loop 100%
• Experimental Result 50%
• Parallelism 50%
• Storage Requirement 50%
• Branch-and-Bound Algorithm 50%
• Storage Performance 50%
• Renaming 50%
• Flow Dependence 50%
• Large Problem Size 50%

Keyphrases

• Occupancy 100%
• For Loop 100%
• Array Extension 42%
• Parallelization 14%
• Full Array 14%
• NP-complete 14%
• Storage Requirement 14%
• Branch-and-bound Algorithm 14%
• Flow Dependence 14%
• Stencil 14%
• Runtime Overhead 14%
• Non-minimal 14%
• Storage Performance 14%
• Reuse Patterns 14%
• Large Problem Size 14%