Home > Engineering > Electronics & Communication Engineering > Volume-2 > Issue-3 > Design A Congestion Aware Routing Algorithm for Synchronous Cam Design

Design A Congestion Aware Routing Algorithm for Synchronous Cam Design

Call for Papers

Volume-3 | Issue-3

Last date : 26-Apr-2019

Best International Journal
Open Access | Peer Reviewed | Best International Journal | Indexing & IF | 24*7 Support | Dedicated Qualified Team | Rapid Publication Process | International Editor, Reviewer Board | Attractive User Interface with Easy Navigation

Journal Type : Open Access

Processing Charges : 700/- INR Only OR 25 USD (for foreign users)

Paper Publish : Within 2-4 Days after submitting

Submit Paper Online

For Author

IJTSRD Publication

Research Area

News & Events


Design A Congestion Aware Routing Algorithm for Synchronous Cam Design


P. Mounica | R. Umamaheswari | R. Madhavi | R. Nischala | N. Ramesh Babu


P. Mounica | R. Umamaheswari | R. Madhavi | R. Nischala | N. Ramesh Babu "Design A Congestion Aware Routing Algorithm for Synchronous Cam Design" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-2 | Issue-3, April 2018, pp.1596-1599, URL: https://www.ijtsrd.com/papers/ijtsrd11547.pdf

The effect of process variation (PV) on delay is a major reason to decay the performance in advanced technologies. The performance of front routing algorithms is determined with or without PV for different traffic patterns. The saturation throughput and average message delay are used as performance metrics to evaluate the throughput. PV decreases the saturation throughput and increases the average message delay. Adaptive routing algorithm should be manipulated with the PV. A novel PV delay and congestion aware routing (PDCR) algorithm is presented for asynchronous network-on-chip (NOC) design. The routing algorithm performs various adaptive routing algorithms in the average delay and saturation throughput for different traffic patterns. A low-power content-addressable memory (CAM) by a new algorithm is proposed for associativity between the input tag and the corresponding address of the output data. The proposed architecture is depends on a recently developed sparse clustered network by utilizing binary connections that on-average eliminates most of the parallel comparisons performed during a search.

Asynchronous design, congestion, network on chip (NoC), process variation (PV), routing algorithms


IJTSRD11547
Volume-2 | Issue-3, April 2018
1596-1599
IJTSRD | www.ijtsrd.com | E-ISSN 2456-6470
Copyright © 2019 by author(s) and International Journal of Trend in Scientific Research and Development Journal. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (CC BY 4.0) (http://creativecommons.org/licenses/by/4.0)

International Journal of Trend in Scientific Research and Development - IJTSRD having online ISSN 2456-6470. IJTSRD is a leading Open Access, Peer-Reviewed International Journal which provides rapid publication of your research articles and aims to promote the theory and practice along with knowledge sharing between researchers, developers, engineers, students, and practitioners working in and around the world in many areas like Sciences, Technology, Innovation, Engineering, Agriculture, Management and many more and it is recommended by all Universities, review articles and short communications in all subjects. IJTSRD running an International Journal who are proving quality publication of peer reviewed and refereed international journals from diverse fields that emphasizes new research, development and their applications. IJTSRD provides an online access to exchange your research work, technical notes & surveying results among professionals throughout the world in e-journals. IJTSRD is a fastest growing and dynamic professional organization. The aim of this organization is to provide access not only to world class research resources, but through its professionals aim to bring in a significant transformation in the real of open access journals and online publishing.

Thomson Reuters
Google Scholer
Academia.edu

ResearchBib
Scribd.com
archive

PdfSR
issuu
Slideshare

WorldJournalAlerts
Twitter
Linkedin