Abstract
The use of earliest-deadline-first task scheduling in hard real-time environments suggests as a by-product a method for hierarchical storage management, representing an application-specific implementation of the working set model. The algorithm presented essentially assigns storage to the ordered list of ready tasks provided by the scheduler. The scheme pages storage on the basis of entire tasks' code and data. Employing the knowledge available in real-time systems on future events leading to task (re-) activations, the look-ahead algorithm always replaces the page with the longest forward access distance. Hence, they are optimal as far as paging demands depend upon internally foreseeable events. In this paper a formal correctness proof using Hoare-style logic is worked out for this algorithm, HSA dmin . The task-oriented, look-ahead hierarchical storage administration scheme is part of an effort to develop a novel dependable and predictably behaving computer architecture for hard real-time environments featuring a fonnally specified and verified operating system kernel supporting an extended version of the high-level real-time programming language PEARL
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
