مشخصات پژوهش

عنوان	A workflow scheduling algorithm based on lattice theory
نوع پژوهش	مقاله ارائه شده
کلیدواژه‌ها	Cloud computing , Costs , Scheduling algorithms , Simulation , Lattices , Scheduling , Task analysis
چکیده	Nowadays, cloud computing is widely utilized to execute workflows which represent a wide range of scientific applications. Scheduling the tasks of these workflows is the main activity in this field based on could computing criteria such as execution cost and time. In this paper, an algorithm is presented to minimize the cost of scheduling a workflow according to the execution time. We demonstrate a bijective function between lattices and workflows. Based on this relation, we prove the proposed scheduling algorithm is non-stop and feasible. Finally, our approach is compared with some well-known scheduling algorithms. The simulation results show that the proposed method can be more effective in reducing the costs of running workflows.
پژوهشگران	سعید دوستعلی (نفر دوم)، محمدجواد نجفی آرانی (نفر اول)