{"title":"在VLSI布局中驱动许多长线路","authors":"V. Ramachandran","doi":"10.1145/6490.6784","DOIUrl":null,"url":null,"abstract":"We assume that long wires represent large capacitive loads, and investigate the effect on the area of a VLSI layout when drivers are introduced along many long wires in the layout. We present a layout for which the introduction of drivers along long wires squares the area of the layout; we show, however, that the increase in area is never greater than this, if the driver can be laid out in a square region. We also show an area-time trade-off for a single long wire by which we can reduce the area of its driver to Θ(lq), q ≪ 1, from Θ(l), if we can tolerate a delay of Θ(l1-q) rather than Θ(log l); and we obtain tight bounds on the worst-case area increase in general lay-outs having these drivers, using the Brouwer fixed-point theorem. We also derive results for the case when drivers are embedded in rectangles that are not square. Finally, we extend the use of our upper-bound technique to other layout, problems.","PeriodicalId":127919,"journal":{"name":"23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1982-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"On driving many long lines in a VLSI layout\",\"authors\":\"V. Ramachandran\",\"doi\":\"10.1145/6490.6784\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We assume that long wires represent large capacitive loads, and investigate the effect on the area of a VLSI layout when drivers are introduced along many long wires in the layout. We present a layout for which the introduction of drivers along long wires squares the area of the layout; we show, however, that the increase in area is never greater than this, if the driver can be laid out in a square region. We also show an area-time trade-off for a single long wire by which we can reduce the area of its driver to Θ(lq), q ≪ 1, from Θ(l), if we can tolerate a delay of Θ(l1-q) rather than Θ(log l); and we obtain tight bounds on the worst-case area increase in general lay-outs having these drivers, using the Brouwer fixed-point theorem. We also derive results for the case when drivers are embedded in rectangles that are not square. Finally, we extend the use of our upper-bound technique to other layout, problems.\",\"PeriodicalId\":127919,\"journal\":{\"name\":\"23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)\",\"volume\":\"113 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1982-11-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/6490.6784\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/6490.6784","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We assume that long wires represent large capacitive loads, and investigate the effect on the area of a VLSI layout when drivers are introduced along many long wires in the layout. We present a layout for which the introduction of drivers along long wires squares the area of the layout; we show, however, that the increase in area is never greater than this, if the driver can be laid out in a square region. We also show an area-time trade-off for a single long wire by which we can reduce the area of its driver to Θ(lq), q ≪ 1, from Θ(l), if we can tolerate a delay of Θ(l1-q) rather than Θ(log l); and we obtain tight bounds on the worst-case area increase in general lay-outs having these drivers, using the Brouwer fixed-point theorem. We also derive results for the case when drivers are embedded in rectangles that are not square. Finally, we extend the use of our upper-bound technique to other layout, problems.