A Hybrid Algorithm for Task scheduling Based on Ant Colony Optimization and Local Neighborhood Search
Publish place: کنفرانس بین المللی مهندسی و علوم کاربردی
Publish Year: 1394
نوع سند: مقاله کنفرانسی
زبان: English
View: 489
This Paper With 7 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ICEASCONF01_095
تاریخ نمایه سازی: 9 مرداد 1395
Abstract:
The advent of cloud computing as a new model of service provisioning in distributed systems, encourages researchers to investigate its benefits and drawbacks in executing scientific applications such as workflows. One of the crucial issues in this environment is related to task scheduling. Task scheduling is an NP-hard optimization problem and many meta-heuristic algorithms have been proposed to solve it. This paper presents an optimized hybrid algorithm for task scheduling based on ant colony optimization and local neighborhood search to minimize both total executing time and cost. The proposed approach can be implemented on both dependent and independent tasks. By virtue of comparing proposed approach with the other algorithm, the experiment results show the hybrid algorithm not only has better scheduling performance but also runs faster than the other algorithm in a large scale. In addition, the experimental results show that the proposed algorithm can substantially achieve both minimal cost and minimal time.
Keywords:
Authors
ParisaSadat Shojaei
Affiliation: Department of Information Technology, Payame Noor University (PNU), P.O. Box, ۱۹۳۹۵-۳۶۹۷ Tehran, Iran
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :