Abstract
Traditional real-time task scheduling strategies only considers cores scheduling, and do not take in account memory access and cache effects on multicore platforms. In this paper, we propose real-time parallel scheduling (PRTTS) strategy on multicore platforms. Each task is represented as a directed acyclic graph (DAG). The priorities of tasks are assigned according to task periods (rate monotonic, RM). In PRTTS scheduling strategy, priorities of tasks that access memory are promoted over priorities of tasks not accessing memory. Tasks accessing the data in the cache is dynamically raised to highest priority. The results of simulation experiment show that proposed new scheduling strategy offers better performance in terms of core utilization and schedulability rate of tasks.
Sign-in/Register to access full text options 
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.
