Analytical derivation of traffic patterns in cache-coherent shared-memory systems

Publication: Research - peer-reviewJournal article – Annual report year: 2011

Standard

Analytical derivation of traffic patterns in cache-coherent shared-memory systems. / Stuart, Matthias Bo; Sparsø, Jens.

In: Microprocessors and Microsystems, Vol. 35, No. 7, 2011, p. 632-642.

Publication: Research - peer-reviewJournal article – Annual report year: 2011

Harvard

APA

CBE

MLA

Vancouver

Author

Stuart, Matthias Bo; Sparsø, Jens / Analytical derivation of traffic patterns in cache-coherent shared-memory systems.

In: Microprocessors and Microsystems, Vol. 35, No. 7, 2011, p. 632-642.

Publication: Research - peer-reviewJournal article – Annual report year: 2011

Bibtex

@article{316676cb71ed47e3a20a99c2ae4ad0bc,
title = "Analytical derivation of traffic patterns in cache-coherent shared-memory systems",
keywords = "Traffic patterns, Shared-memory systems, Task graphs",
publisher = "Elsevier BV",
author = "Stuart, {Matthias Bo} and Jens Sparsø",
year = "2011",
doi = "10.1016/j.micpro.2011.06.007",
volume = "35",
number = "7",
pages = "632--642",
journal = "Microprocessors and Microsystems",
issn = "0141-9331",

}

RIS

TY - JOUR

T1 - Analytical derivation of traffic patterns in cache-coherent shared-memory systems

A1 - Stuart,Matthias Bo

A1 - Sparsø,Jens

AU - Stuart,Matthias Bo

AU - Sparsø,Jens

PB - Elsevier BV

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - Traffic patterns

KW - Shared-memory systems

KW - Task graphs

U2 - 10.1016/j.micpro.2011.06.007

DO - 10.1016/j.micpro.2011.06.007

JO - Microprocessors and Microsystems

JF - Microprocessors and Microsystems

SN - 0141-9331

IS - 7

VL - 35

SP - 632

EP - 642

ER -