{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:05:02Z","timestamp":1740135902452,"version":"3.37.3"},"reference-count":11,"publisher":"Wiley","license":[{"start":{"date-parts":[[2011,4,28]],"date-time":"2011-04-28T00:00:00Z","timestamp":1303948800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-0954153"],"award-info":[{"award-number":["CNS-0954153"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["VLSI Design"],"published-print":{"date-parts":[[2011,4,28]]},"abstract":"<jats:p>In the advent of smaller devices, a significant increase in the density of on-chip components has raised congestion\nand overflow as critical issues in VLSI physical design automation. In this paper, we present novel techniques for\nreducing congestion and minimizing overflows. Our methods are based on ripping up nets that go through the\ncongested areas and replacing them with <jats:italic>congestion-aware<\/jats:italic> topologies.\nOur contributions can be summarized as follows. First, we present several efficient algorithms for finding\n<jats:italic>congestion-aware<\/jats:italic> Steiner trees that is, trees that avoid congested areas of the chip. Next, we show that the novel\ntechnique of <jats:italic>network coding<\/jats:italic> can lead to further improvements in routability, reduction of congestion, and overflow\navoidance. Finally, we present an algorithm for identifying efficient congestion-aware network coding topologies.\nWe evaluate the performance of the proposed algorithms through extensive simulations.<\/jats:p>","DOI":"10.1155\/2011\/892310","type":"journal-article","created":{"date-parts":[[2011,4,28]],"date-time":"2011-04-28T19:31:56Z","timestamp":1304019116000},"page":"1-9","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Congestion Mitigation Using Congestion-Aware Steiner Trees and Network Coding Topologies"],"prefix":"10.1155","volume":"2011","author":[{"given":"M. A. R.","family":"Chaudhry","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, Texas A&M University, College Station, TX 77843, USA"}]},{"given":"Z.","family":"Asad","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Texas A&M University, College Station, TX 77843, USA"}]},{"given":"A.","family":"Sprintson","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Texas A&M University, College Station, TX 77843, USA"}]},{"given":"J.","family":"Hu","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Texas A&M University, College Station, TX 77843, USA"}]}],"member":"311","reference":[{"year":"1990","key":"2"},{"year":"1995","key":"3"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-9260(01)00020-7"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2004.826547"},{"year":"1979","key":"15"},{"issue":"1","key":"17","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0166-218X(92)90021-2","volume":"40","year":"1992","journal-title":"Discrete Applied Mathematics"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3830"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847712"}],"container-title":["VLSI Design"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/archive\/2011\/892310.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/archive\/2011\/892310.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/archive\/2011\/892310.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T07:07:40Z","timestamp":1607497660000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/vlsi\/2011\/892310\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,28]]},"references-count":11,"alternative-id":["892310","892310"],"URL":"https:\/\/doi.org\/10.1155\/2011\/892310","relation":{},"ISSN":["1065-514X","1563-5171"],"issn-type":[{"type":"print","value":"1065-514X"},{"type":"electronic","value":"1563-5171"}],"subject":[],"published":{"date-parts":[[2011,4,28]]}}}