{"title":"低功耗存储器设计","authors":"Wen-Tsong Shiue","doi":"10.1109/ASAP.2002.1030704","DOIUrl":null,"url":null,"abstract":"In this paper, we present a novel design procedure for multi-module, multi-port memory design that satisfies area and/or energy/timing constraints. Our procedure consists of (i) use of storage bandwidth optimization (SBO) techniques to simplify the conflict graph and (ii) use of memory exploration techniques to determine the best memory configuration (number of modules, size and number of ports per module) with the minimum area if the energy and timing are bounded or with the minimum energy/timing if the area is bounded. Here the simplest conflict graph implies more possibilities for the arrays assigned to the same module without the penalty in an increase of the number of ports for each module. Our benchmark shows that the heuristic algorithm is very efficient to decide the best memory configuration for the system constraints (timing, area, or energy). In addition, the CACTI tool (Premkishore Shivakumar and N.P. Jouppi, 2001) is modified to estimate the timing, area, and energy for each module in different CMOS technologies (0.8 /spl mu/m, 0.35 /spl mu/m, and 0.18 /spl mu/m). Furthermore, we consider the lifetime for arrays; this results in significant reduction in timing, area, and energy for the arrays executed in different cycles sharing the same memory module.","PeriodicalId":424082,"journal":{"name":"Proceedings IEEE International Conference on Application- Specific Systems, Architectures, and Processors","volume":"32 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Low power memory design\",\"authors\":\"Wen-Tsong Shiue\",\"doi\":\"10.1109/ASAP.2002.1030704\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a novel design procedure for multi-module, multi-port memory design that satisfies area and/or energy/timing constraints. Our procedure consists of (i) use of storage bandwidth optimization (SBO) techniques to simplify the conflict graph and (ii) use of memory exploration techniques to determine the best memory configuration (number of modules, size and number of ports per module) with the minimum area if the energy and timing are bounded or with the minimum energy/timing if the area is bounded. Here the simplest conflict graph implies more possibilities for the arrays assigned to the same module without the penalty in an increase of the number of ports for each module. Our benchmark shows that the heuristic algorithm is very efficient to decide the best memory configuration for the system constraints (timing, area, or energy). In addition, the CACTI tool (Premkishore Shivakumar and N.P. Jouppi, 2001) is modified to estimate the timing, area, and energy for each module in different CMOS technologies (0.8 /spl mu/m, 0.35 /spl mu/m, and 0.18 /spl mu/m). Furthermore, we consider the lifetime for arrays; this results in significant reduction in timing, area, and energy for the arrays executed in different cycles sharing the same memory module.\",\"PeriodicalId\":424082,\"journal\":{\"name\":\"Proceedings IEEE International Conference on Application- Specific Systems, Architectures, and Processors\",\"volume\":\"32 2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-07-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings IEEE International Conference on Application- Specific Systems, Architectures, and Processors\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ASAP.2002.1030704\",\"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 IEEE International Conference on Application- Specific Systems, Architectures, and Processors","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASAP.2002.1030704","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper, we present a novel design procedure for multi-module, multi-port memory design that satisfies area and/or energy/timing constraints. Our procedure consists of (i) use of storage bandwidth optimization (SBO) techniques to simplify the conflict graph and (ii) use of memory exploration techniques to determine the best memory configuration (number of modules, size and number of ports per module) with the minimum area if the energy and timing are bounded or with the minimum energy/timing if the area is bounded. Here the simplest conflict graph implies more possibilities for the arrays assigned to the same module without the penalty in an increase of the number of ports for each module. Our benchmark shows that the heuristic algorithm is very efficient to decide the best memory configuration for the system constraints (timing, area, or energy). In addition, the CACTI tool (Premkishore Shivakumar and N.P. Jouppi, 2001) is modified to estimate the timing, area, and energy for each module in different CMOS technologies (0.8 /spl mu/m, 0.35 /spl mu/m, and 0.18 /spl mu/m). Furthermore, we consider the lifetime for arrays; this results in significant reduction in timing, area, and energy for the arrays executed in different cycles sharing the same memory module.