Cited 0 time in
Low power TLB structure by using dynamic searching algorithm
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Lee, Jung-Hoon | - |
| dc.date.accessioned | 2022-12-27T05:10:49Z | - |
| dc.date.available | 2022-12-27T05:10:49Z | - |
| dc.date.issued | 2009-07 | - |
| dc.identifier.issn | 0267-6192 | - |
| dc.identifier.uri | https://scholarworks.gnu.ac.kr/handle/sw.gnu/26270 | - |
| dc.description.abstract | We present a translation lookaside buffer (TLB) system with low power consumption for embedded processors. The proposed TLB is constructed as multiple banks, with small bank buffers, called as a filter-bank buffer, located above its associated bank. Either the filter-bank buffer or the main bank TLB is selectively accessed on the basis of two bits in the filter-bank buffer. First, one block filtering TLB is proposed to support low cost and simple mechanism. Second, two-blocks filtering TLB is proposed to obtain lower power consumption and higher performance than the one block filtering TLB. Dynamic power savings are achieved by reducing the number of entries accessed at a time, by using filtering and bank mechanism. The performance overhead of the proposed TLB turns out to be negligible compared with other hierarchical structures. That is, the two cycle overhead of the proposed TLB is only about 4%similar to 2%, as compared with the 15% overhead of a filter (micro)-TLB and the 22% overhead of a banked-filter TLB. We show that the average hit ratios of the filter buffers and the main banks of the proposed TLB are about 90% and 10% respectively. Therefore, significant power savings can be achieved with just a small performance degradation. The power consumption can be reduced by about 89% compared with a fully associative TLB, 69% with respect to a filter-TLB, and 37% relative to a banked-filter TLB. | - |
| dc.format.extent | 11 | - |
| dc.language | 영어 | - |
| dc.language.iso | ENG | - |
| dc.publisher | C R L PUBLISHING LTD | - |
| dc.title | Low power TLB structure by using dynamic searching algorithm | - |
| dc.type | Article | - |
| dc.publisher.location | 영국 | - |
| dc.identifier.wosid | 000277952200004 | - |
| dc.identifier.bibliographicCitation | COMPUTER SYSTEMS SCIENCE AND ENGINEERING, v.24, no.4, pp 261 - 271 | - |
| dc.citation.title | COMPUTER SYSTEMS SCIENCE AND ENGINEERING | - |
| dc.citation.volume | 24 | - |
| dc.citation.number | 4 | - |
| dc.citation.startPage | 261 | - |
| dc.citation.endPage | 271 | - |
| dc.type.docType | Article | - |
| dc.description.isOpenAccess | N | - |
| dc.description.journalRegisteredClass | scie | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.relation.journalResearchArea | Computer Science | - |
| dc.relation.journalWebOfScienceCategory | Computer Science, Hardware & Architecture | - |
| dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
| dc.subject.keywordAuthor | Translation lookaside buffer | - |
| dc.subject.keywordAuthor | low power consumption | - |
| dc.subject.keywordAuthor | bank structure | - |
| dc.subject.keywordAuthor | filtering mechanism | - |
| dc.subject.keywordAuthor | performance evaluation | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Gyeongsang National University Central Library, 501, Jinju-daero, Jinju-si, Gyeongsangnam-do, 52828, Republic of Korea+82-55-772-0532
COPYRIGHT 2022 GYEONGSANG NATIONAL UNIVERSITY LIBRARY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
