期刊名称：International Journal of Mechatronics, Electrical and Computer Technology
印刷版ISSN：2305-0543
出版年度：2013
卷号：3
期号：9
页码：286-313
出版社：Austrian E-Journals of Universal Scientific Organization
摘要：Grid Computation is an issue that has received much attention from researchers in recent years.Its aim is to use the computational power of idle resources which have been distributed in differentplaces and under different policies and security conditions. Therefore, one of the challenges facingthis technology is the issue of security of jobs and the computational sites. Distributed jobs incomputational sites may become problematic due to some infections and malwares. As a result, therisks and security levels should be considered; computing resources must be evaluated by resourceowners for task execution, and scheduling should be based on requested users' security levels. Thisis the matter that has been ignored in the previous scheduling algorithms, which leads to waste oftime and overhead. In this paper, a new method based on a combination of Genetic andImperialism Competitive algorithm is presented to implement a security-aware scheduling andfailure algorithm. The proposed method is compared with the previous methods such as Min-Min,Suffrage and genetic algorithms, has become near optimal and led to reduce the overhead causedby violation of security conditions. Additionally, Due to the usage of fault tolerance mechanisms,the performance of these mechanisms has been evaluated and it was found that the replicationmechanism had the lowest failure rate and the check point mechanism had a direct effect on theperformance and it should be fully supervised and be smart.
