Matches in UGent Biblio for { <https://biblio.ugent.be/publication/4111494#aggregation> ?p ?o. }
Showing items 1 to 31 of
31
with 100 items per page.
- aggregation classification "C1".
- aggregation creator person.
- aggregation creator person.
- aggregation date "2013".
- aggregation format "application/pdf".
- aggregation hasFormat 4111494.bibtex.
- aggregation hasFormat 4111494.csv.
- aggregation hasFormat 4111494.dc.
- aggregation hasFormat 4111494.didl.
- aggregation hasFormat 4111494.doc.
- aggregation hasFormat 4111494.json.
- aggregation hasFormat 4111494.mets.
- aggregation hasFormat 4111494.mods.
- aggregation hasFormat 4111494.rdf.
- aggregation hasFormat 4111494.ris.
- aggregation hasFormat 4111494.txt.
- aggregation hasFormat 4111494.xls.
- aggregation hasFormat 4111494.yaml.
- aggregation isPartOf urn:isbn:9781479908370.
- aggregation language "eng".
- aggregation publisher "IEEE Computer Society".
- aggregation rights "I have transferred the copyright for this publication to the publisher".
- aggregation subject "Technology and Engineering".
- aggregation title "Towards balanced traffic distribution in NoCs using a highly adaptive path-based routing algorithm".
- aggregation abstract "With the continuously increasing number of cores, on-chip communication has gained a significant role in taking advantage of the multicore chips. Therefore, designing efficient routing algorithms is highly desirable to increase the performance of the Networks-on-Chip (NoC). In comparison with deterministic routing methods, adaptive routing offers better performance by evenly distributing the traffic over the network. Adaptive routing strategies try to avoid congested or malfunctioning areas by dynamically sending the packets through alternative paths based on the network’s congestion condition. The routing algorithm proposed in this paper is mainly based on Hamiltonian path-based strategies for multicast traffic. This method reaches a high degree of adaptiveness by exploiting the eligible minimal paths between the source and the destination. Imposing some restrictions in choosing the potential paths ensures a deadlock- and livelock-free algorithm without using virtual channels. Experimental results demonstrate that the proposed algorithm performs significantly better in terms of latency and power consumption compared to the other adaptive and non-adaptive algorithms. This efficiency is achieved by alleviating congestion across the network.".
- aggregation authorList BK313242.
- aggregation endPage "201".
- aggregation startPage "194".
- aggregation aggregates 4111496.
- aggregation isDescribedBy 4111494.
- aggregation similarTo LU-4111494.