CIVILICA We Respect the Science
(ناشر تخصصی کنفرانسهای کشور / شماره مجوز انتشارات از وزارت فرهنگ و ارشاد اسلامی: ۸۹۷۱)

An Improved Ant Algorithm for Grid Scheduling Problem

عنوان مقاله: An Improved Ant Algorithm for Grid Scheduling Problem
شناسه ملی مقاله: CSICC14_013
منتشر شده در چهاردهمین کنفرانس بین المللی سالانه انجمن کامپیوتر ایران در سال 1388
مشخصات نویسندگان مقاله:

Jamshid Bagherzadeh - Department of computer Engineering, Urmia, Iran
Mojtaba MadadyarAdeh - Islamic Azad University, Young Researchers Club, Urmia, Iran

خلاصه مقاله:
Grid computing is a promising technology for future computing platforms and is expected to provide easier access to remote computational resources that are usually locally limited. Scheduling is one of the active research topics in grid environments. The goal of grid task scheduling is to achieve high system throughput and to allocate various computing resources to applications. The Complexity of scheduling problem increases with the size of the grid and becomes ighly difficult to solve effectively. Many different methods have been proposed to solve this problem. Some of these ethods are based on heuristic techniques that provide an optimal or near optimal solution for large grids. In this paper we introduce a new task scheduling algorithm based on Ant Colony Optimization (ACO). According to the experimental results, the proposed algorithm confidently demonstrates its competitiveness with previously proposed algorithms

کلمات کلیدی:
Grid computing, grid Scheduling, ant colony optimization, heuristics, ETC Matrix

صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/72979/