Graph based framework to detect optimal memory layouts for improving data locality

Keyphrases

• Data Locality 100%
• Graph Framework 100%
• Memory Layout 100%
• Compiler 66%
• Caching 33%
• Effective Management 33%
• Performance Level 33%
• Linear Programming Method 33%
• Work-based 33%
• Data Transformation 33%
• Array Layout 33%
• Graph Structure 33%
• Distributed Storage 33%
• Parallel Architecture 33%
• Memory Hierarchy 33%
• Loop Iteration 33%
• Improvement Methods 33%
• Integer Linear Programming 33%
• Enhancement Techniques 33%
• Dynamic Memory 33%
• Optimal Layout 33%
• Loop Transformations 33%
• Shared-memory multiprocessors 33%
• Deep Memory Hierarchy 33%
• Layout Change 33%
• Multidimensional Array 33%
• Iteration Space 33%
• Loop Nest 33%
• Layout Detection 33%
• Compilation Time 33%
• Dynamic Layout 33%

Computer Science

• Data Locality 100%
• Memory Hierarchy 100%
• Experimental Result 50%
• Programming Method 50%
• Parallel Architectures 50%
• Integer-Linear Programming 50%
• Loop Iteration 50%
• Data Transformation 50%
• Time Compilation 50%
• Multidimensional Array 50%
• Effective Management 50%
• Loop Transformation 50%
• Shared Memory Multiprocessor 50%
• Dynamic Memory 50%
• Iteration Space 50%