Comparative Analysis of Different Techniques of Real Time Scheduling for Multi-Core Platform
share
As the demand of real time computing increases day by day, there is a major paradigm shift in processing platform of real time system from single core to multi-core platform which provides advantages like higher throughput, linear power consumption, efficient utilization of processor cores and high performance per unit cost over the many single core processors unit. Currently available most popular real time schedulers for multi-core domain are partitioned and global scheduling and these schedulers not suitable to efficiently use this multi-core platform efficiently. Although, semi-partitioned algorithms increases utilization bound by using spare capacities left by partitioning via global scheduling, it has a inherent disadvantage of off-line task splitting. Although, semi-partitioned algorithms increases utilization bound by using spare capacities left by partitioning via global scheduling, it has a inherent disadvantage of off-line task splitting. To overcome these problems of multi-core real time scheduling algorithm new dynamic cluster based multi-core real time scheduling algorithm proposed which is hybrid scheduling approach. This paper discuss different multi-core scheduling techniques and comparative analysis of these techniques with the proposed dynamic cluster based real time multi-core scheduling
READ FULL TEXT