Cache Optimization for Coarse Grain Task Parallel Processing Using Inter-Array Padding
Source: Waseda University
The wide use of multiprocessor system has been making automatic parallelizing compilers more important. To improve the performance of multiprocessor system more by compiler, multigrain parallelization is important. In multigrain parallelization, coarse grain task parallelism among loops and subroutines and near fine grain parallelism among statements is used in addition to the traditional loop parallelism. In addition, locality optimization to use cache effectively is also important for the performance improvement. This paper describes inter-array padding to minimize cache conflict misses among macro-tasks with data localization scheme which decomposes loops sharing the same arrays to fit cache size and executes the decomposed loops consecutively on the same processor.
| Format: | Size: | 138.00 | |
| Date: | Dec 2007 |
People who downloaded this item also downloaded
- Component-Based Software Engineering - The Need to Link Methods and Their Theories
- Hardware Virtualization on a Coarse-Grained Reconfigurable Processor
- Data-Triggered Threads: Eliminating Redundant Computation
- Parallel Data Mining on Multicore Clusters
- MapCG: Writing Parallel Program Portable Between CPU and GPU



