Search

Multi-core real-time systems are significantly challenging to analyze due to the unpredictability from extensive contention over shared caches. Therefore, an efficient method- cache partitioning, is introduced into modern multi-core platforms to avoid cache access from co-executing cores, by which the timing predictability are improved. However, the cache space isolation technique may result in unbounded blocking because of the insufficient number of cache partitions. Unfortunately, the existing scheduling and analysis techniques cannot be applied to this situation. gEDFca, a cache-aware preemptive global earliest deadline first ( EDF) scheduling algorithm was proposed for multi-core systems. And its analysis method was presented based on linear programming. Besides, a novel optimization algorithm was introduced for further improving schedulability. Evaluations using generation tasks show the proposed analysis method is highly efficient. It also shows that the optimization algorithm yields a significant improvement in schedulability. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Northeastern University (Natural Science) is the property of Dongbei Daxue Xuebao and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)