SwePub
Sök i LIBRIS databas

  Extended search

WFRF:(Ijaz M)
 

Search: WFRF:(Ijaz M) > Concept and design ...

Concept and design of exhaustive-parallel search algorithm for Network-on-Chip

Deivasigamani, M. (author)
Tabatabaei, Shaghayeghsadat (author)
KTH,Elektroniksystem
Mustafa, Naveed Ul (author)
KTH,Elektroniksystem
show more...
Ijaz, Hamza (author)
KTH,Elektroniksystem
Aslam, Haris Bin (author)
KTH,Elektroniksystem
Liu, Shaoteng (author)
KTH,Elektroniksystem
Jantsch, Axel (author)
KTH,Elektroniksystem
show less...
 (creator_code:org_t)
2011
2011
English.
In: Int. Syst. Chip Conf.. - 9781457716164 ; , s. 150-155
  • Conference paper (peer-reviewed)
Abstract Subject headings
Close  
  • This paper presents the concept and design of exhaustive-parallel search algorithm for Network-on-Chip. The proposed parallel algorithm searches minimal path between source and destination in a forward-wave-propagation manner. The algorithm guarantees setup latency if the setup path exists. A high performance switch is designed to support exhaustive-parallel search algorithm. The NoC fabric is designed for 88 mesh architecture and its performance is evaluated.

Subject headings

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering (hsv//eng)

Keyword

Circuit-switch (CS)
Exhaustive Parallel Search (EPS)
Guaranteed Throughput (GT)
Network-on-Chip (NoC)
Guaranteed throughputs
High performance switches
Mesh architecture
Minimal path
Network on chip
Parallel search
Search Algorithms
Learning algorithms
Microprocessor chips
Servers
VLSI circuits
Programmable logic controllers

Publication and Content Type

ref (subject category)
kon (subject category)

Find in a library

To the university's database

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view