Name
Abstract | ||
|---|---|---|
Cloud computing model provides global and ondemand access to resources in a seamless manner with minimal interaction with the service provider. A typical cloud data center consists of several computational resources interconnected with each other through high-speed networks. In cloud the program execution can be visualized as a collection of multiple tasks represented by Directed Acyclic Graph (DAG) that execute in their logical sequence. Prioritization of these tasks plays an important role to achieve high performance and improved efficiency in a cloud environment. In this paper, we propose a novel task scheduling algorithm named Median Deviation based Task Scheduling (MDTS), which uses Median Absolute Deviation (MAD) of the Expected Time to Compute (ETC) of a task as a major attribute to calculate ranks of the given tasks. We use coefficient-of-variation (COV) based technique that considers task and machine heterogeneity to estimate the ETC of a particular DAG. The proposed algorithm is evaluated under various conditions using synthetic DAGs and real world applications. Our evaluation shows that the proposed MDTS algorithm produces high quality schedules and significantly reduces the makespan of an application by up to 25.01%. |
Year | Venue | Field |
|---|---|---|
2016 | iThings/GreenCom/CPSCom/SmartData | Approximation algorithm,Job shop scheduling,Scheduling (computing),Computer science,Service provider,Directed acyclic graph,Median absolute deviation,Schedule,Cloud computing,Distributed computing |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Muhammad Fasih Akbar | 1 | 0 | 0.34 |
| Ehsan Ullah Munir | 2 | 48 | 12.18 |
| M. Mustafa Rafique | 3 | 157 | 15.49 |
| Zaki Malik | 4 | 501 | 34.83 |
| Samee U. Khan | 5 | 1572 | 83.04 |
| Laurence T. Yang | 6 | 6870 | 682.61 |