A NEW OPTIMIZATION METHOD FOR SECURITY-CONSTRAINED WORKFLOW SCHEDULING

摘要

Broadly speaking, scheduling is a process of developing bunches of security policies and tocontrol the certain available tasks which have to be taken care of using a computer system. Care shouldbe exercised that a scheduler in a particular fields should be quite cautious in adapting schedulingstrategy as the environment and the version of task change. In many cases, security is proven to be able toencourage relevance between two entities for a long time. This does imply that a secure schedulingalgorithm, of course, can completely alleviate the failure probability during task execution in a securityenvironment. Therefore, to move in a direction of a systematic approach, this paper, very natural, aims atintroducing a brand new reliable algorithm using different quality of service (QoS) parameters to managethe scheduling large number of workflows. To do this, it combines two metaheuristic algorithms, CPSOand GA. It should be noted, however, that three different QoS such as execution cost, loadbalancing andsecurity are employed as the most immediate performance measure to handle the scheduling process.Conclusion reached through this algorithm mention that its total execution cost will be minimized whilemeeting deadline and risk rate constraints. Verification of the proposed algorithm with other algorithmswas taken into consideration. The accumulation of results through exercising this algorithm reveals thatoptimal solution to the problems is promised. Therefore, it is highly desirable to claim that obtainedresults from this effective approach are better than with the approach used with other algorithms such asCPSO and GA.