کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
489396 704250 2015 9 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Hard-deadline Constrained Workflows Scheduling Using Metaheuristic Algorithms
ترجمه فارسی عنوان
الگوریتم های متاعرق با استفاده از الگوریتم های متاویری سخت گیرانه محدود می شوند؟
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
چکیده انگلیسی

An efficient scheduling is the essential part of complex scientific applications processing in computational distributed environments. The computational complexity comes as from environment heterogeneity as from the application structure that usually is represented as a workflow which contains different linked tasks. A lot of well-known techniques were proposed by different scientific groups. The most popular of them are based on greedy list-based heuristics or evolutionary metaheuristics. In this paper we investigate the applicability of previously developed metaheuristic algorithm – coevolutional genetic algorithm (CGA) for scheduling series of workflows with hard deadlines constraints.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Procedia Computer Science - Volume 66, 2015, Pages 506-514