Analytical derivation of traffic patterns in cache-coherent shared-memory systems |
| |
| Authors: | Matthias B StuartAuthor Vitae Jens SparsøAuthor Vitae |
| |
| Affiliation: | a Department of Informatics and Mathematical Modelling, Technical University of Denmark, Richard Petersens Plads, Building 321, DK-2800 Lyngby, Denmark
b Center for Fast Ultrasound Imaging, Department of Electrical Engineering, Technical University of Denmark, Ørsteds Plads, Building 349, DK-2800 Lyngby, Denmark |
| |
| Abstract: | This paper presents an analytical method to derive the worst-case traffic pattern caused by a task graph mapped to a cache-coherent shared-memory system. Our analysis allows designers to rapidly evaluate the impact of different mappings of tasks to IP cores on the traffic pattern. The accuracy varies with the application’s data sharing pattern, and is around 65% in the average case and 1% in the best case when considering the traffic pattern as a whole. For individual connections, our method produces tight worst-case bandwidths. |
| |
| Keywords: | Task graphs Shared-memory systems Traffic patterns |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
