Abstract
Shared resources on the multicore chip, such as main memory, are increasingly becoming a point of contention. Traditional real-time task scheduling strategies focus on solely on the CPU, and do not take in account memory access and cache effects. In this paper, we propose real-time parallel scheduling (PRTTS) strategy on multicore platforms. Each task is represented as a directed acyclic graph (DAG). Tasks priorities are assigned according to task periods. In PRTTS scheduling strategy priorities of tasks which access memory are promoted over priorities of tasks not accessing memory. Tasks which read/write data in cache dynamically have their priority increased above all tasks. The results of simulation experiment show that proposed new scheduling strategy offers better performance in terms of core utilization and schedulability rate of tasks.
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.
