{"title":"一种持续减少CPU等待周期的DRAM系统","authors":"Y. Kanno, H. Mizuno, T. Watanabe","doi":"10.1109/VLSIC.1999.797261","DOIUrl":null,"url":null,"abstract":"This paper describes a DRAM system for consistently reducing CPU wait cycles for an access to DRAMs in a cache-based memory hierarchy. An arithmetical address mapping circuitry and a pseudo dual-port DRAM access protocol provide a DRAM access without a bank conflict and high speed write-back accesses (write for dirty data and read for cache-line filling). Only two adders for the address mapping circuitry and a data-preload register in each DRAM are necessary for the implementation.","PeriodicalId":433264,"journal":{"name":"1999 Symposium on VLSI Circuits. Digest of Papers (IEEE Cat. No.99CH36326)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A DRAM system for consistently reducing CPU wait cycles\",\"authors\":\"Y. Kanno, H. Mizuno, T. Watanabe\",\"doi\":\"10.1109/VLSIC.1999.797261\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes a DRAM system for consistently reducing CPU wait cycles for an access to DRAMs in a cache-based memory hierarchy. An arithmetical address mapping circuitry and a pseudo dual-port DRAM access protocol provide a DRAM access without a bank conflict and high speed write-back accesses (write for dirty data and read for cache-line filling). Only two adders for the address mapping circuitry and a data-preload register in each DRAM are necessary for the implementation.\",\"PeriodicalId\":433264,\"journal\":{\"name\":\"1999 Symposium on VLSI Circuits. Digest of Papers (IEEE Cat. No.99CH36326)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-06-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1999 Symposium on VLSI Circuits. Digest of Papers (IEEE Cat. No.99CH36326)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/VLSIC.1999.797261\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1999 Symposium on VLSI Circuits. Digest of Papers (IEEE Cat. No.99CH36326)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VLSIC.1999.797261","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A DRAM system for consistently reducing CPU wait cycles
This paper describes a DRAM system for consistently reducing CPU wait cycles for an access to DRAMs in a cache-based memory hierarchy. An arithmetical address mapping circuitry and a pseudo dual-port DRAM access protocol provide a DRAM access without a bank conflict and high speed write-back accesses (write for dirty data and read for cache-line filling). Only two adders for the address mapping circuitry and a data-preload register in each DRAM are necessary for the implementation.