Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Deadlock free routing algorithms for irregular mesh topology NoC systems with rectangular regions
Högskolan i Jönköping, Tekniska Högskolan, JTH, Data- och elektroteknik. Högskolan i Jönköping, Tekniska Högskolan, JTH. Forskningsområde Intelligenta produkter. (Inbyggda System)
Högskolan i Jönköping, Tekniska Högskolan, JTH, Data- och elektroteknik. Högskolan i Jönköping, Tekniska Högskolan, JTH. Forskningsområde Intelligenta produkter. (Inbyggda System)
2008 (Engelska)Ingår i: Journal of systems architecture, ISSN 1383-7621, E-ISSN 1873-6165, Vol. 54, nr 3-4, s. 427-440Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

The simplicity of regular mesh topology NoC architecture leads to reductions in design time and manufacturing cost. A weakness of the regular shaped architecture is its inability to efficiently support cores of different sizes. A proposed way in literature to deal with this is to utilize the region concept, which helps to accommodate cores larger than the tile size in mesh topology NoC architectures. Region concept offers many new opportunities for NoC design, as well as provides new design issues and challenges. One of the most important among these is the design of an efficient deadlock free routing algorithm. Available adaptive routing algorithms developed for regular mesh topology can not ensure freedom from deadlocks. In this paper, we list and discuss many new design issues which need to be handled for designing NoC systems incorporating cores larger than the tile size. We also present and compare two deadlock free routing algorithms for mesh topology NoC with regions. The idea of the first algorithm is borrowed from the area of fault tolerant networks, where a network topology is rendered irregular due to faults in routers or links, and is adapted for the new context. We compare this with an algorithm designed using a methodology for design of application specific routing algorithms for communication networks. The application specific routing algorithm tries to maximize adaptivity by using static and dynamic communication requirements of the application. Our study shows that the application specific routing algorithm not only provides much higher adaptivity, but also superior performance as compared to the other algorithm in all traffic cases. But this higher performance for the second algorithm comes at a higher area cost for implementing network routers.

Ort, förlag, år, upplaga, sidor
2008. Vol. 54, nr 3-4, s. 427-440
Nationell ämneskategori
Systemvetenskap, informationssystem och informatik
Identifikatorer
URN: urn:nbn:se:hj:diva-3921DOI: doi:10.1016/j.sysarc.2007.07.005OAI: oai:DiVA.org:hj-3921DiVA, id: diva2:34741
Tillgänglig från: 2007-10-18 Skapad: 2007-10-18 Senast uppdaterad: 2018-01-12Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltexthttp://dx.doi.org/10.1016/j.sysarc.2007.07.005

Personposter BETA

Holsmark, RickardKumar, Shashi

Sök vidare i DiVA

Av författaren/redaktören
Holsmark, RickardKumar, Shashi
Av organisationen
JTH, Data- och elektroteknikJTH. Forskningsområde Intelligenta produkter
I samma tidskrift
Journal of systems architecture
Systemvetenskap, informationssystem och informatik

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 232 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf