Name
Abstract | ||
|---|---|---|
We present algorithms that design NoCs with guaranteed quality of service. Given a topology, a mapping of tasks to processing elements, and traffic requirements between the tasks, the algorithm computes the interconnection widths, a detailed static routing, and a periodic scheduling. No headers, control messages, or acknowledgments are required. The algorithm employs fractional Multi-Commodity Flow (MCF) that determines the widths of the interconnections as well as the routes of the flits. The MCF is rounded to a periodic TDM schedule which is translated to local periodic control of switches and network interfaces. Our algorithm is applicable to large instances since every stage is efficient. The algorithm supports arbitrary topologies and traffic patterns. Routing along multiple paths is allowed in order to increase utilization and decrease latency. We implemented the algorithm and tested it with the MCSL benchmark. Experiments demonstrate that our solution is stable and satisfies all the real-time constraints. |
Year | Venue | Field |
|---|---|---|
2015 | CoRR | Latency (engineering),Static routing,Computer science,Quality of service,Computer network,Algorithm,Network topology,Interconnection,Periodic graph (geometry),Network on chip design,Distributed computing,Network interface |
DocType | Volume | Citations |
Journal | abs/1509.00249 | 0 |
PageRank | References | Authors |
0.34 | 6 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guy Even | 1 | 1194 | 136.90 |
| yaniv fais | 2 | 7 | 1.25 |