Dual-mode instruction prefetch scheme for improved worst case and average case program execution times
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Minsuk | - |
dc.contributor.author | Min, Sang Lyul | - |
dc.contributor.author | Park, Chang Yun | - |
dc.contributor.author | Bae, Young Hyun | - |
dc.contributor.author | Shin, Heonshik | - |
dc.contributor.author | Kim, Chong Sang | - |
dc.date.accessioned | 2023-02-15T09:53:26Z | - |
dc.date.available | 2023-02-15T09:53:26Z | - |
dc.date.issued | 1993-12 | - |
dc.identifier.issn | 8186-4486 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/60673 | - |
dc.description.abstract | One of the obstacles to using RISC processors in a hard real-time environment is the unpredictability of caches. This unpredictability stems from basing them on a design that tries to optimize the average case execution time. In this paper, we propose a dual mode instruction prefetch scheme as an alternative to instruction caching schemes. In the proposed scheme, a thread is associated with each instruction block. The thread indicates the instruction block that is to be prefetched once the block containing it is accessed by the processor. The proposed scheme operates in two different modes: real-time and non real-time modes. In the real-time mode, the prefetching of instruction blocks is made in the direction that improves the worst case execution time. For this purpose, the thread is generated by the compiler through an analysis of the worst case execution path. In the non real-time mode, the thread is dynamically updated so that it indicates the instruction block that is most likely to be accessed after the containing block. By the principles of locality, the block that is most likely to be accessed next is the block that was previously accessed after the present block. Therefore, the thread is made to point to such a block in the non real-time mode. The above tailoring of thread information is on a task basis and, therefore, each task in the system can choose its own mode depending on its needs. Typically real-time tasks choose the real-time mode for an improved worst case execution time whereas non time critical tasks choose the non real-time mode for an improved average case execution time. This paper shows, through analysis using a timing tool, that the proposed scheme significantly (up to 45%) improves the predicted worst case execution time in the real-time mode as compared with no prefetching scheme. | - |
dc.format.extent | 8 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Publ by IEEE, Piscataway, NJ, United States | - |
dc.title | Dual-mode instruction prefetch scheme for improved worst case and average case program execution times | - |
dc.type | Article | - |
dc.identifier.doi | 10.1109/REAL.1993.393511 | - |
dc.identifier.bibliographicCitation | Proceedings - Real-Time Systems Symposium, pp 98 - 105 | - |
dc.description.isOpenAccess | N | - |
dc.identifier.scopusid | 2-s2.0-0027884618 | - |
dc.citation.endPage | 105 | - |
dc.citation.startPage | 98 | - |
dc.citation.title | Proceedings - Real-Time Systems Symposium | - |
dc.type.docType | Conference Paper | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
84, Heukseok-ro, Dongjak-gu, Seoul, Republic of Korea (06974)02-820-6194
COPYRIGHT 2019 Chung-Ang University 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.