A New Optimization Method for Security-Constrained Workflow Scheduling

Abstract

Broadly speaking, scheduling is a process of developing bunches of security policies and to control the certain available tasks which have to be taken care of using a computer system. Care should be exercised that a scheduler in a particular fields should be quite cautious in adapting scheduling strategy as the environment and the version of task change. In many cases, security is proven to be able to encourage relevance between two entities for a long time. This does imply that a secure scheduling algorithm, of course, can completely alleviate the failure probability during task execution in a security environment. Therefore, to move in a direction of a systematic approach, this paper, very natural, aims at introducing a brand new reliable algorithm using different quality of service (QoS) parameters to manage the scheduling large number of workflows. To do this, it combines two metaheuristic algorithms, CPSO and GA. It should be noted, however, that three different QoS such as execution cost, loadbalancing and security 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 while meeting deadline and risk rate constraints. Verification of the proposed algorithm with other algorithms was taken into consideration. The accumulation of results through exercising this algorithm reveals that optimal solution to the problems is promised. Therefore, it is highly desirable to claim that obtained results from this effective approach are better than with the approach used with other algorithms such as CPSO and GA.