By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Tripathi, S. ; Dept. of Comput. Sci. & Eng., Motilal Nehru Nat. Inst. of Technol., Allahabad, India ; Yadav, R.S. ; Jana, R.L.

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.

Published in:

Computer and Communication Technology (ICCCT), 2010 International Conference on

Date of Conference:

17-19 Sept. 2010