{"title":"一种结构化的mcm路由方法","authors":"Chua Hong Chuck, C. Chai, T. Chua","doi":"10.1109/KES.1997.616917","DOIUrl":null,"url":null,"abstract":"This paper presents a structured methodology for routing of multichip modules (MCMs) suitable for an EDA system that can guarantee 100% completion of routes irrespective of connection density. It uses a rather simple and straightforward modularized approach which, not only guarantees 100% completion of routes, but also optimizes and predetermines the number of layers required. This approach is structured using a Pre-sorter Module (PSM) and a Central Routing Adapter (CRA). Each chip or sub-module in an MCM will go through the PSM that re-arranges the node connection sequence by means of a horizontal-vertical matrix prior to the connection to the CRA. The CRA provides direct point-to-point connections based on the netlist for all chips or sub-modules in the MCM. The set of connections between the nodes of two chips (or sub-modules) is defined as a connection relationship. The number of connection relationships is n(n-1)/2, where n is the number of chips or sub-modules. By this approach, maximum number of layers in the CRA to route all connections among the chips or sub-modules will be (n-2). The design and development of these PSM and CRA are elaborated, and a 4-chip MCM example is used for illustration.","PeriodicalId":166931,"journal":{"name":"Proceedings of 1st International Conference on Conventional and Knowledge Based Intelligent Electronic Systems. KES '97","volume":"76 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A structured approach for routing of MCMs\",\"authors\":\"Chua Hong Chuck, C. Chai, T. Chua\",\"doi\":\"10.1109/KES.1997.616917\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a structured methodology for routing of multichip modules (MCMs) suitable for an EDA system that can guarantee 100% completion of routes irrespective of connection density. It uses a rather simple and straightforward modularized approach which, not only guarantees 100% completion of routes, but also optimizes and predetermines the number of layers required. This approach is structured using a Pre-sorter Module (PSM) and a Central Routing Adapter (CRA). Each chip or sub-module in an MCM will go through the PSM that re-arranges the node connection sequence by means of a horizontal-vertical matrix prior to the connection to the CRA. The CRA provides direct point-to-point connections based on the netlist for all chips or sub-modules in the MCM. The set of connections between the nodes of two chips (or sub-modules) is defined as a connection relationship. The number of connection relationships is n(n-1)/2, where n is the number of chips or sub-modules. By this approach, maximum number of layers in the CRA to route all connections among the chips or sub-modules will be (n-2). The design and development of these PSM and CRA are elaborated, and a 4-chip MCM example is used for illustration.\",\"PeriodicalId\":166931,\"journal\":{\"name\":\"Proceedings of 1st International Conference on Conventional and Knowledge Based Intelligent Electronic Systems. KES '97\",\"volume\":\"76 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-05-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1st International Conference on Conventional and Knowledge Based Intelligent Electronic Systems. KES '97\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/KES.1997.616917\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 1st International Conference on Conventional and Knowledge Based Intelligent Electronic Systems. KES '97","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KES.1997.616917","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper presents a structured methodology for routing of multichip modules (MCMs) suitable for an EDA system that can guarantee 100% completion of routes irrespective of connection density. It uses a rather simple and straightforward modularized approach which, not only guarantees 100% completion of routes, but also optimizes and predetermines the number of layers required. This approach is structured using a Pre-sorter Module (PSM) and a Central Routing Adapter (CRA). Each chip or sub-module in an MCM will go through the PSM that re-arranges the node connection sequence by means of a horizontal-vertical matrix prior to the connection to the CRA. The CRA provides direct point-to-point connections based on the netlist for all chips or sub-modules in the MCM. The set of connections between the nodes of two chips (or sub-modules) is defined as a connection relationship. The number of connection relationships is n(n-1)/2, where n is the number of chips or sub-modules. By this approach, maximum number of layers in the CRA to route all connections among the chips or sub-modules will be (n-2). The design and development of these PSM and CRA are elaborated, and a 4-chip MCM example is used for illustration.