Adaptive security improvement using dynamic window concept for real time tasks on cluster

Security critical real time applications running over clusters are growing rapidly. Real-time tasks scheduling on cluster become more challenging when security requirement of application is considered. As an application running on cluster demand both timeliness and security, scheduling algorithm should have better performance in terms of both number of tasks accepted and security value received. Running security algorithm on cluster to combat the security threats increases overall execution overhead. Thus a scheduling algorithm should balance between these two conflicting requirements. In this paper, we have proposed a window based scheduling algorithm which accepts tasks with minimum security requirements and later on adaptively increases security level of task. Further extensive simulation studies have been performed to measure the performance of the proposed approach. It has been observed that our approach performs better when compared to previous approaches.