Koji Sato, Hiroyoshi Shimoyama, Takao Nagai, M. Ozaki, T. Yahara
{"title":"一个“无网格”通道路由器","authors":"Koji Sato, Hiroyoshi Shimoyama, Takao Nagai, M. Ozaki, T. Yahara","doi":"10.1145/800139.804508","DOIUrl":null,"url":null,"abstract":"A \"grid-free\" channel router (termed GFR) is reported. GFR does not employ grid lines and can obtain better results than the fixed-grid method. Additionally, GFR has several optional functions, such as \"constraint loop breaking\", \"total branch length minimization\", \"constraint chain cutting\" and \"layer changing\". The algorithms of these functions are outlined and results obtained by using them are presented.","PeriodicalId":196513,"journal":{"name":"17th Design Automation Conference","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1980-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"A \\\"Grid-free\\\" Channel Router\",\"authors\":\"Koji Sato, Hiroyoshi Shimoyama, Takao Nagai, M. Ozaki, T. Yahara\",\"doi\":\"10.1145/800139.804508\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A \\\"grid-free\\\" channel router (termed GFR) is reported. GFR does not employ grid lines and can obtain better results than the fixed-grid method. Additionally, GFR has several optional functions, such as \\\"constraint loop breaking\\\", \\\"total branch length minimization\\\", \\\"constraint chain cutting\\\" and \\\"layer changing\\\". The algorithms of these functions are outlined and results obtained by using them are presented.\",\"PeriodicalId\":196513,\"journal\":{\"name\":\"17th Design Automation Conference\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1980-06-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"17th Design Automation Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800139.804508\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"17th Design Automation Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800139.804508","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A "grid-free" channel router (termed GFR) is reported. GFR does not employ grid lines and can obtain better results than the fixed-grid method. Additionally, GFR has several optional functions, such as "constraint loop breaking", "total branch length minimization", "constraint chain cutting" and "layer changing". The algorithms of these functions are outlined and results obtained by using them are presented.