Real-time communication analysis for on-chip networks with wormhole switching

Zheng Shi; Alan Burns

Real-time communication analysis for on-chip networks with wormhole switching

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

In this paper, we discuss a real-time on-chip communication service with a priority-based wormhole switching policy. A novel off-line schedulability analysis approach is presented. By evaluating diverse inter-relationships among the traffic-flows, this approach can predict the packet network latency based on two quantifiable different delays: direct interference from higher priority traffic-flows and indirect interference from other higher priority traffic-flows. Due to the inevitable existence of parallel interference, we prove that the general problem of determining the exact schedulability of real-time traffic-flow over the on-chip network is NP-hard. However the results presented do form an upper bound. In addition, an error in a previous published scheduling approach is illustrated and remedied. Utilizing this analysis scheme, we can flexibly evaluate at design time the schedulability of a set of traffic-flows with different QoS requirements on a real-time SoC/NoC communication platform.

Original language	English
Title of host publication	NOCS 2008: SECOND IEEE INTERNATIONAL SYMPOSIUM ON NETWORKS-ON-CHIP, PROCEEDINGS
Place of Publication	LOS ALAMITOS
Publisher	IEEE Computer Society
Pages	161-170
Number of pages	10
ISBN (Print)	978-0-7695-3098-7
Publication status	Published - 2007
Event	2nd International Symposium on Networks-on-Chip - Newcastle upon Tyne Duration: 7 Apr 2008 → 11 Apr 2008

Conference

Conference	2nd International Symposium on Networks-on-Chip
City	Newcastle upon Tyne
Period	7/04/08 → 11/04/08

Keywords

FLOW-CONTROL
TASKS

Cite this

@inproceedings{3f41c8187a4548608574acee967e5c7d,

title = "Real-time communication analysis for on-chip networks with wormhole switching",

abstract = "In this paper, we discuss a real-time on-chip communication service with a priority-based wormhole switching policy. A novel off-line schedulability analysis approach is presented. By evaluating diverse inter-relationships among the traffic-flows, this approach can predict the packet network latency based on two quantifiable different delays: direct interference from higher priority traffic-flows and indirect interference from other higher priority traffic-flows. Due to the inevitable existence of parallel interference, we prove that the general problem of determining the exact schedulability of real-time traffic-flow over the on-chip network is NP-hard. However the results presented do form an upper bound. In addition, an error in a previous published scheduling approach is illustrated and remedied. Utilizing this analysis scheme, we can flexibly evaluate at design time the schedulability of a set of traffic-flows with different QoS requirements on a real-time SoC/NoC communication platform.",

keywords = "FLOW-CONTROL, TASKS",

author = "Zheng Shi and Alan Burns",

year = "2007",

language = "English",

isbn = "978-0-7695-3098-7",

pages = "161--170",

booktitle = "NOCS 2008: SECOND IEEE INTERNATIONAL SYMPOSIUM ON NETWORKS-ON-CHIP, PROCEEDINGS",

publisher = "IEEE Computer Society",

address = "United States",

note = "2nd International Symposium on Networks-on-Chip ; Conference date: 07-04-2008 Through 11-04-2008",

}

TY - GEN

T1 - Real-time communication analysis for on-chip networks with wormhole switching

AU - Shi, Zheng

AU - Burns, Alan

PY - 2007

Y1 - 2007

N2 - In this paper, we discuss a real-time on-chip communication service with a priority-based wormhole switching policy. A novel off-line schedulability analysis approach is presented. By evaluating diverse inter-relationships among the traffic-flows, this approach can predict the packet network latency based on two quantifiable different delays: direct interference from higher priority traffic-flows and indirect interference from other higher priority traffic-flows. Due to the inevitable existence of parallel interference, we prove that the general problem of determining the exact schedulability of real-time traffic-flow over the on-chip network is NP-hard. However the results presented do form an upper bound. In addition, an error in a previous published scheduling approach is illustrated and remedied. Utilizing this analysis scheme, we can flexibly evaluate at design time the schedulability of a set of traffic-flows with different QoS requirements on a real-time SoC/NoC communication platform.

AB - In this paper, we discuss a real-time on-chip communication service with a priority-based wormhole switching policy. A novel off-line schedulability analysis approach is presented. By evaluating diverse inter-relationships among the traffic-flows, this approach can predict the packet network latency based on two quantifiable different delays: direct interference from higher priority traffic-flows and indirect interference from other higher priority traffic-flows. Due to the inevitable existence of parallel interference, we prove that the general problem of determining the exact schedulability of real-time traffic-flow over the on-chip network is NP-hard. However the results presented do form an upper bound. In addition, an error in a previous published scheduling approach is illustrated and remedied. Utilizing this analysis scheme, we can flexibly evaluate at design time the schedulability of a set of traffic-flows with different QoS requirements on a real-time SoC/NoC communication platform.

KW - FLOW-CONTROL

KW - TASKS

M3 - Conference contribution

SN - 978-0-7695-3098-7

SP - 161

EP - 170

BT - NOCS 2008: SECOND IEEE INTERNATIONAL SYMPOSIUM ON NETWORKS-ON-CHIP, PROCEEDINGS

PB - IEEE Computer Society

CY - LOS ALAMITOS

T2 - 2nd International Symposium on Networks-on-Chip

Y2 - 7 April 2008 through 11 April 2008

ER -