An efficient, low-cost routing framework for convex mesh partitions to support virtualization
| Autor: | Frank Olaf Sem-Jacobsen, Tor Skeie, Samuel Rodrigo, Davide Bertozzi, Alessandro Strano |
|---|---|
| Rok vydání: | 2013 |
| Předmět: |
010302 applied physics
Static routing Dynamic Source Routing Protocol Independent Multicast Multicast business.industry Computer science Distributed computing ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS Wireless Routing Protocol Distance Vector Multicast Routing Protocol 02 engineering and technology 01 natural sciences 020202 computer hardware & architecture Link-state routing protocol Hardware and Architecture 0103 physical sciences 0202 electrical engineering electronic engineering information engineering Xcast business Software Computer network |
| Zdroj: | ACM Transactions on Embedded Computing Systems |
| ISSN: | 1558-3465 1539-9087 |
| DOI: | 10.1145/2485984.2485995 |
| Popis: | At the core of an efficient chip multiprocessors (CMP) is support for unicast and multicast routing, low implementation costs, and the ability to isolate concurrent applications with maximum utilization of the CMP. We present an efficient logic-based unicast and multicast routing algorithm that guarantees isolation of local application traffic within any near-convex region on the chip, and the algorithms to recognize supported partitions and configure the cores accordingly. Evaluations show that the routing algorithm has a 57% more compact implementation than a recent multicast solution with the same coverage, and it achieves 5% higher throughput with 13% lower latency. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|