Name
Abstract | ||
|---|---|---|
We address the problem of scheduling real-time transactions in Network-on-Chip (NoC). In particular, we propose a novel slot-based scheduling algorithm for acyclic transaction sets in NoC. The algorithm induces a competitive sufficient schedulability utilization bound. Since the proposed algorithm is able to exploit the parallelism between non-overlapping transactions, under given assumptions, it performs better than the existing fixed-priority solutions. We evaluate performance through extensive simulations. Furthermore, we discuss some important factors in the implementation of the algorithm and present an implementation in a real system. The measurement shows that the proposed algorithm has relatively low overhead. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/RTCSA.2011.44 | RTCSA |
Keywords | Field | DocType |
multiprocessing systems,network-on-chip,processor scheduling,NoC,acyclic transaction sets,concurrent transactions,fixed-priority solutions,many-core system-on-chips,network-on-chip,nonoverlapping transactions,schedulability utilization bound,slot-based real-time scheduling algorithm,real-time NoC communication,real-time communication,real-time scheduling | Fair-share scheduling,Scheduling (computing),Computer science,Parallel computing,Network on a chip,Real-time computing,Exploit,Processor scheduling,Database transaction,Real-time communication,Distributed computing | Conference |
Volume | ISSN | Citations |
1 | 1533-2306 | 0 |
PageRank | References | Authors |
0.34 | 16 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bach D. Bui | 1 | 112 | 6.18 |
| Marco Caccamo | 2 | 425 | 31.84 |
| Rodolfo Pellizzoni | 3 | 1020 | 53.85 |