Autonomic Networking-On-Chip: Bio-Inspired Specification, Development, and Verification

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F11%3APU96172" target="_blank" >RIV/00216305:26230/11:PU96172 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Autonomic Networking-On-Chip: Bio-Inspired Specification, Development, and Verification

Popis výsledku v původním jazyce

This paper describes the technique of the evolutionary design aimed at scheduling of collective communications on autonomic networks on chip (ANoC). In order to avoid contention for links and associated delays, collective communications proceed in synchronized steps. A minimum number of steps is sought for the given network topology and given sets of sender and receiver nodes. The proposed technique is not only able to re-invent optimum schedules for known symmetric topologies like hypercubes, but it can find schedules even for any asymmetric, irregular, multistage and fat topologies in case of general many-to-many collective communications. In most cases, the number of steps reaches the theoretical lower bound for the given communication pattern; if it does not, non-minimum routing can provide further improvement. Optimal schedules may serve for writing high-performance communication routines for application-specific networks on chip or for the development of communication libraries i

Název v anglickém jazyce

Autonomic Networking-On-Chip: Bio-Inspired Specification, Development, and Verification

Popis výsledku anglicky

This paper describes the technique of the evolutionary design aimed at scheduling of collective communications on autonomic networks on chip (ANoC). In order to avoid contention for links and associated delays, collective communications proceed in synchronized steps. A minimum number of steps is sought for the given network topology and given sets of sender and receiver nodes. The proposed technique is not only able to re-invent optimum schedules for known symmetric topologies like hypercubes, but it can find schedules even for any asymmetric, irregular, multistage and fat topologies in case of general many-to-many collective communications. In most cases, the number of steps reaches the theoretical lower bound for the given communication pattern; if it does not, non-minimum routing can provide further improvement. Optimal schedules may serve for writing high-performance communication routines for application-specific networks on chip or for the development of communication libraries i

Druh

C - Kapitola v odborné knize

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GAP103%2F10%2F1517" target="_blank" >GAP103/10/1517: Natural computing na nekonvenčních platformách</a><br>

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2011

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název knihy nebo sborníku

Autonomic Networking-On-Chip: Bio-Inspired Specification, Development, and Verification

ISBN

978-1-4398-2911-0

Počet stran výsledku

35

Strana od-do

60-94

Počet stran knihy

273

Název nakladatele

CRC Press LLC

Místo vydání

London

Kód UT WoS kapitoly

—