Simultaneous Progressing Switching Protocols for Timing Predictable\n Real-Time Network-on-Chips Article Swipe

MAKE IMPACT

Niklas Ueter , Georg von der Brueggen , Jian-Jia Chen , Tulika Mitra , Vanchinathan Venkataramani · YOU? · · 2019 · Open Access · · DOI: https://doi.org/10.48550/arxiv.1909.09457

Many-core systems require inter-core communication, and network-on-chips\n(NoCs) have been demonstrated to provide good scalability. However, not only\nthe distributed structure but also the link switching on the NoCs have imposed\na great challenge in the design and analysis for real-time systems. With\nscalability and flexibility in mind, the existing link switching protocols\nusually consider each single link to be scheduled independently, e.g., the\nworm-hole switching protocol. The flexibility of such link-based arbitrations\nallows each packet to be distributed over multiple routers but also increases\nthe number of possible link states (the number of flits in a buffer) that have\nto be considered in the worst-case timing analysis.\n For achieving timing predictability, we propose less flexible switching\nprotocols, called \\emph{\\Simultaneous Progressing Switching Protocols}\n(SP$^2$), in which the links used by a flow \\emph{either} all simultaneously\ntransmit one flit (if it exists) of this flow \\emph{or} none of them transmits\nany flit of this flow. Such an \\emph{all-or-nothing} property of the SP$^2$\nrelates the scheduling behavior on the network to the uniprocessor\nself-suspension scheduling problem. We provide rigorous proofs which confirm\nthe equivalence of these two problems. Moreover, our approaches are not limited\nto any specific underlying routing protocols, which are usually constructed for\ndeadlock avoidance instead of timing predictability. We demonstrate the\nanalytical dominance of the fixed-priority $SP^2$ over some of the existing\nsufficient schedulability analysis for fixed-priority wormhole switched\nnetwork-on-chips.\n

Type

preprint

Landing Page

http://arxiv.org/abs/1909.09457

PDF

https://arxiv.org/pdf/1909.09457

OA Status

green

Related Works

10

OpenAlex ID

https://openalex.org/W4286787900

Raw OpenAlex JSON

OpenAlex ID

https://openalex.org/W4286787900

Canonical identifier for this work in OpenAlex

DOI

https://doi.org/10.48550/arxiv.1909.09457

Digital Object Identifier

Title

Simultaneous Progressing Switching Protocols for Timing Predictable\n Real-Time Network-on-Chips

Work title

Type

preprint

OpenAlex work type

Publication year

2019

Year of publication

Publication date

2019-09-19

Full publication date if available

Authors

Niklas Ueter, Georg von der Brueggen, Jian-Jia Chen, Tulika Mitra, Vanchinathan Venkataramani

List of authors in order

Landing page

https://arxiv.org/abs/1909.09457

Publisher landing page

PDF URL

https://arxiv.org/pdf/1909.09457

Direct link to full text PDF

Open access

Yes

Whether a free full text is available

OA status

green

Open access status per OpenAlex

OA URL

https://arxiv.org/pdf/1909.09457

Direct OA link when available

Concepts

Computer science, Scalability, Scheduling (production processes), Computer network, Distributed computing, Clos network, Uniprocessor system, Network packet, Predictability, Parallel computing, Multiprocessing, Mathematics, Statistics, Database, Mathematical optimization

Top concepts (fields/topics) attached by OpenAlex

Cited by

0

Total citation count in OpenAlex

Related works (count)

10

Other works algorithmically related by OpenAlex

Full payload