Abstract | ||
---|---|---|
This tutorial reviews four popular mathematical formalisms -- dataflow analysis, schedulability analysis, network calculus, and queueing theory -- and how they have been applied to the analysis of Network-on-Chip (NoC) performance. We review the basic concepts and results of each formalism and provide examples of how they have been used in on-chip communication performance analysis. The tutorial also discusses the respective strengths and weaknesses of each formalism, their suitability for a specific purpose, and the attempts that have been made to bridge these analytical approaches. Finally, we conclude the tutorial by discussing open research issues. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1145/2380403.2380442 | CASES |
Keywords | Field | DocType |
analytical approach,queueing theory,open research issue,network calculus,dataflow analysis,popular mathematical formalisms,respective strength,performance evaluation,basic concept,schedulability analysis,on-chip communication performance analysis,network on chip,system on chip,design methodology | Open research,Computer science,Parallel computing,Network on a chip,Theoretical computer science,Dataflow,Queueing theory,Network calculus,Formalism (philosophy),Rotation formalisms in three dimensions,Strengths and weaknesses | Conference |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Abbas Eslami Kiasari | 1 | 97 | 7.34 |
Axel Jantsch | 2 | 1875 | 169.83 |
Marco J.G. Bekooij | 3 | 416 | 27.80 |
Alan Burns | 4 | 739 | 59.60 |
Zhonghai Lu | 5 | 1063 | 100.12 |