A Task Scheduling Algorithm with Efficient Number of Tasks in Distributed Systems
سال انتشار: 1393
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 562
فایل این مقاله در 8 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
CITCONF02_060
تاریخ نمایه سازی: 19 اردیبهشت 1395
چکیده مقاله:
Often, cloud computing is used synonymously with such terms as utility computing (or on-demand computing),software as a service (SaaS), and grid computing. However, as we will show, utility computing and SaaS can bepresented as two of several forms of services that cloud computing can provide. In a distributed system, timing andmapping the priority of tasks among processors are of great importance. This consists of mapping a Directed AcyclicGraph (DAG) to a set of tasks on a number of parallel processors and its purpose is allocating tasks to the availableprocessors, in order to satisfy the needs of priority and decency of tasks, and also to minimize the execution time in thegraph totally. In this paper, we’ll propose a task scheduling algorithm by employing additional lambda value parameter.To evaluate the proposed method, it is compared to the schedule list algorithm. Simulations show that our approachoutperforms the benchmark schedule list algorithm.
کلیدواژه ها:
نویسندگان
Vahid Ghasemi
Eslam Abad-E-Gharb Branch, Islamic Azad University, Eslam Abad_E_Gharb, kermanshah, Iran.
Rohollah Esmaeli Manesh
Eslam Abad-E-Gharb Branch, Islamic Azad University, Eslam Abad_E_Gharb, kermanshah, Iran.
Majid Iranpour Mobarakeh
Computer Engineering and IT Dep. Payam Noor University. Tehran, Iran