Indian Journal of Science and Technology

Abstract

Objectives: Task execution under common resource sharing is challenging and finding an optimal solution which ensures minimum blocking time for critical tasks and assuring time constraints is a demanding research problem. In this paper, a new protocol that controls the access to shared resources, with minimum context switches that guarantee task deadlines are presented. Methods: The proposed algorithm: Critical Section aware Immediate Ceiling Priority Protocol (CS_aware ICPP) is further integrated with Dynamic Frequency Scaling (DFS) technique to safeguard all task instances which may miss future deadlines. An extensive simulation analysis is carried out to compare the performance of the proposed algorithm with other existing synchronizing algorithms in the field. Findings: Critical sections are important because it may lead to future blocking of a high priority critical task. Applications/Improvement: From the simulation results, it is found that the proposed: CS_aware ICPP algorithm outperforms the other existing algorithms in terms of reduced context switches. 
Keywords: Dynamic Frequency Scaling (DFS), Immediate Ceiling Priority Protocol (ICPP), Priority Ceiling Protocol (PCP), Task Dependency, Task Synchronization