Please use this identifier to cite or link to this item:
http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/5305
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kumar, Arvind | - |
dc.contributor.author | Sehgal, Vivek Kumar [Guided by] | - |
dc.date.accessioned | 2022-07-28T15:39:34Z | - |
dc.date.available | 2022-07-28T15:39:34Z | - |
dc.date.issued | 2015 | - |
dc.identifier.uri | http://ir.juit.ac.in:8080/jspui//xmlui/handle/123456789/5305 | - |
dc.description.abstract | Network on chip is gaining popularity as the time is going on, due to increasing communication. As the number of transistors growing the network on chip is becoming complex. To reduce the complexity, 3D NoC was there but still improvements are required as more the number of wires more is the complexity and lesser is the speed involved. So the aim of this research is to find such an mapping algorithm which can map the cores or task to a topology in such a way that less energy is consumed, less time for communication, faster speed of accessing, cores with maximum communication are brought closer making the network less complex. To achieve these properties, the existing mapping approaches are mentioned in this report. Keeping the drawbacks of existing approaches in mind my aim is to find such a mapping technique which suits all the QoS requirements and is best among all the existing approaches. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Jaypee University of Information Technology, Solan, H.P. | en_US |
dc.subject | Routing algorithm | en_US |
dc.subject | Router in NoC | en_US |
dc.subject | Communication task graph | en_US |
dc.subject | Architecture characterization graph | en_US |
dc.subject | Algorithm | en_US |
dc.title | Mapping Algorithms for Network on Chip | en_US |
dc.type | Project Report | en_US |
Appears in Collections: | Dissertations (M.Tech.) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Mapping Algorithms for Network-on-Chip.pdf | 3.75 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.