Minimising Access Conflicts on Shared Multi-Bank Memory
| Autor: | Matthias Baer, Georgia Giannopoulou, Andreas Tretter, Lothar Thiele |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
010302 applied physics
Distributed shared memory Flat memory model Computer science Distributed computing Graph colouring 02 engineering and technology Parallel computing 01 natural sciences Address mapping 020202 computer hardware & architecture Memory bank Hardware and Architecture 0103 physical sciences 0202 electrical engineering electronic engineering information engineering Interleaved memory Software |
| Zdroj: | ACM Transactions on Embedded Computing Systems. 16:1-20 |
| ISSN: | 1558-3465 1539-9087 |
| DOI: | 10.1145/3126535 |
| Popis: | A common multi-core pattern consists of processors communicating through shared, multi-banked on-chip memory. Two approaches exist: Interleaved address mapping, which spreads consecutive data over all banks, and contiguous address mapping, which stores consecutive data on a single bank. In this work, we compare both approaches on the Kalray MPPA-256 platform. For contiguous mapping, we propose an algorithm, based on graph colouring techniques, to automatically perform the assignment of data blocks to memory banks with the goal of minimising access collisions and delays. Experiments with representative, parallel real-world benchmarks show that 69% of the tested configurations, when optimised for contiguous mapping by our algorithm, run up to 86% faster on average than with interleaved mapping. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|