By Topic

Window based security-sensitive scheduling for real-time application 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)
Jana, R.L. ; Dept. of Comput. Sci. & Eng., Motilal Nehru Nat. Inst. of Technol., Allahabad, India ; Yadav, R.S. ; Tripathi, S.

Real-time tasks scheduling on cluster become more challenging when security requirement of application is considered. Running security algorithm on cluster to combat the security threat increases overall execution overhead. Increasing security strength causes decreasing task's acceptance ratio. In this study, we proposed a scheduling algorithm which balances this two conflicting requirements of real-time task to achieve maximal acceptance ratio with maximal security strength while scheduling on homogeneous cluster. Further, extensive simulation experiments which compared with SAEDF and TPSS, show that our algorithm has higher success ratio, more fairly in term of lower standard deviation of security level gained by tasks and significant improvement in overall system performance.

Published in:

Parallel Distributed and Grid Computing (PDGC), 2010 1st International Conference on

Date of Conference:

28-30 Oct. 2010