Matches in UGent Biblio for { <https://biblio.ugent.be/publication/4211628#aggregation> ?p ?o. }
Showing items 1 to 32 of
32
with 100 items per page.
- aggregation classification "P1".
- aggregation creator person.
- aggregation creator person.
- aggregation date "2013".
- aggregation format "application/pdf".
- aggregation hasFormat 4211628.bibtex.
- aggregation hasFormat 4211628.csv.
- aggregation hasFormat 4211628.dc.
- aggregation hasFormat 4211628.didl.
- aggregation hasFormat 4211628.doc.
- aggregation hasFormat 4211628.json.
- aggregation hasFormat 4211628.mets.
- aggregation hasFormat 4211628.mods.
- aggregation hasFormat 4211628.rdf.
- aggregation hasFormat 4211628.ris.
- aggregation hasFormat 4211628.txt.
- aggregation hasFormat 4211628.xls.
- aggregation hasFormat 4211628.yaml.
- aggregation isPartOf urn:isbn:9781479920785.
- aggregation isPartOf urn:issn:2325-6532.
- 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 "The Hamiltonian-based odd-even turn model for adaptive routing in interconnection networks".
- aggregation abstract "Optimization of multiprocessor systems relies heavily on the efficient design of on-chip routing algorithms. Adaptive routing appears to have an extremely significant role in the performance of the Networks-on-Chip. In this paper, a deadlock-free and highly adaptive minimal routing method (HOE) is proposed. Although the Hamiltonian Adaptive Multicast Unicast Model (HAMUM) is able to support a high degree of adaptiveness, it cannot exploit some of the potential alternative paths in routing. By prohibiting the minimum number of turns, our proposed method strives to find the maximum number of alternative paths between each pair of source and destination nodes, without using virtual channels. HOE has also been applied to the Column-Path (CP) routing algorithm to improve its characteristics. The simulation results validate the flexibility of our approach in choosing the appropriate routing path depending on the congestion condition of the network. The better performance of the proposed method is due to its higher degree of adaptiveness which results in less vulnerability to nonuniform factors and a better traffic distribution all over the network.".
- aggregation authorList BK301574.
- aggregation endPage "6".
- aggregation startPage "1".
- aggregation aggregates 4214612.
- aggregation isDescribedBy 4211628.
- aggregation similarTo LU-4211628.