{"id":{"repo_id":"utahstate","oai_identifier":"oai:digitalcommons.usu.edu:etd-2320"},"canonical_url":"https://search.ndltd.org/etd/utahstate/oai:digitalcommons.usu.edu:etd-2320","repository":{"repo_id":"utahstate","name":"Utah State University","base_url":"https://digitalcommons.usu.edu/do/oai/"},"display":{"title":"Aging-Aware Routing Algorithms for Network-on-Chips","abstract":"Network-on-chips (NoCs) are one of the most scalable mediums to interconnect different processors in a multi-processor system. The processors are connected to routers via network interfaces and the routers are connected to each other through links. A routing algorithm is implemented inside each router that decides the path that a packet must take to reach the destination processor from the source. If a path is heavily utilized, the links and routers comprising the path start to age, and therefore can become faulty with time. In order to avoid this situation, the routing logic must be able to distribute the packets evenly across the network so as to reduce the utilization of heavily stressed routers and links. In this work, two such aging-aware routing algorithms are proposed that reduce the aging induced power and performance overheads and also avoid stress on the network components. These algorithms can be broadly classified as dynamic (adaptive routing) and static (oblivious routing) solutions.","abstract_html":"Network-on-chips (NoCs) are one of the most scalable mediums to interconnect different processors in a multi-processor system. The processors are connected to routers via network interfaces and the routers are connected to each other through links. A routing algorithm is implemented inside each router that decides the path that a packet must take to reach the destination processor from the source. If a path is heavily utilized, the links and routers comprising the path start to age, and therefore can become faulty with time. In order to avoid this situation, the routing logic must be able to distribute the packets evenly across the network so as to reduce the utilization of heavily stressed routers and links. In this work, two such aging-aware routing algorithms are proposed that reduce the aging induced power and performance overheads and also avoid stress on the network components. These algorithms can be broadly classified as dynamic (adaptive routing) and static (oblivious routing) solutions.","abstract_has_math":false,"creators":["Bhardwaj, Kshitij"],"institution":"Hosted by Utah State University Libraries","degree_name":"Master of Science (MS)","degree_level":"Thesis","degree_discipline":"Electrical and Computer Engineering","degree_department":null,"school":null,"contributors":["Koushik Chakraborty","Sanghamitra Roy","Reyhan Baktur"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:47:02Z","subjects":["aging","routing","algorithm","network-on-chips","Electrical and Computer Engineering"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.26076/c81c-eb38"],"render_values":[{"text":"https://doi.org/10.26076/c81c-eb38","href":"https://doi.org/10.26076/c81c-eb38","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.usu.edu/etd/1319","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.usu.edu/etd/1319","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.usu.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.usu.edu%3Aetd-2320","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Koushik Chakraborty","Sanghamitra Roy","Reyhan Baktur"]},{"key":"dc:creator","label":"Author","values":["Bhardwaj, Kshitij"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2012-09-20T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2012-08-01T07:00:00Z"]},{"key":"dc:publisher","label":"Institution","values":["Hosted by Utah State University Libraries"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical and Computer Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["aging","routing","algorithm","network-on-chips","Electrical and Computer Engineering"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.usu.edu/etd/1319"]},{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.26076/c81c-eb38"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Network-on-chips (NoCs) are one of the most scalable mediums to interconnect different processors in a multi-processor system. The processors are connected to routers via network interfaces and the routers are connected to each other through links. A routing algorithm is implemented inside each router that decides the path that a packet must take to reach the destination processor from the source. If a path is heavily utilized, the links and routers comprising the path start to age, and therefore can become faulty with time. In order to avoid this situation, the routing logic must be able to distribute the packets evenly across the network so as to reduce the utilization of heavily stressed routers and links. In this work, two such aging-aware routing algorithms are proposed that reduce the aging induced power and performance overheads and also avoid stress on the network components. These algorithms can be broadly classified as dynamic (adaptive routing) and static (oblivious routing) solutions."]},{"key":"dc:title","label":"Title","values":["Aging-Aware Routing Algorithms for Network-on-Chips"]}]}],"canonical_facts":{"dc:contributor":["Koushik Chakraborty","Sanghamitra Roy","Reyhan Baktur"],"dc:creator":["Bhardwaj, Kshitij"],"dc:date.available":["2012-09-20T07:00:00Z"],"dc:date.created":["2012-08-01T07:00:00Z"],"dc:description.abstract":["Network-on-chips (NoCs) are one of the most scalable mediums to interconnect different processors in a multi-processor system. The processors are connected to routers via network interfaces and the routers are connected to each other through links. A routing algorithm is implemented inside each router that decides the path that a packet must take to reach the destination processor from the source. If a path is heavily utilized, the links and routers comprising the path start to age, and therefore can become faulty with time. In order to avoid this situation, the routing logic must be able to distribute the packets evenly across the network so as to reduce the utilization of heavily stressed routers and links. In this work, two such aging-aware routing algorithms are proposed that reduce the aging induced power and performance overheads and also avoid stress on the network components. These algorithms can be broadly classified as dynamic (adaptive routing) and static (oblivious routing) solutions."],"dc:identifier":["https://digitalcommons.usu.edu/etd/1319"],"dc:identifier.doi":["https://doi.org/10.26076/c81c-eb38"],"dc:publisher":["Hosted by Utah State University Libraries"],"dc:subject":["aging","routing","algorithm","network-on-chips","Electrical and Computer Engineering"],"dc:title":["Aging-Aware Routing Algorithms for Network-on-Chips"],"thesis:degree_discipline":["Electrical and Computer Engineering"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T08:47:02Z"}