Selecting the most fitting resource for task execution

Future Generation Computer SystemsPublished 18 September 2010

Ruay-Shiung Chang, Chun-Fu Lin, Jen-Jom Chen

DOI10.1016/j.future.2010.09.003

Source URL

Citations25

SJR quartileQ1

SJR score1.55

SNIP2.23

TL;DR

A task scheduling algorithm that searches for the proper resource for task execution is proposed and results show that the proposed algorithm works well in dynamic environments.

Abstract

In the computing grid, task scheduling, in order to discover resources for user’s requirements, is important. In general, the task scheduler assigns tasks to a proper resource node for execution, and the resource nodes with better performance would be assigned first. When task loading is heavy and all resource nodes with better performance are assigned, other tasks have to be assigned to the resource nodes with inferior performance. Therefore, if a task is assigned to a resource node without considering the performance factor, the overall execution time will increase obviously. To solve this problem, a task scheduling algorithm that searches for the proper resource for task execution is proposed in this paper. Simulation results show that the proposed algorithm works well in dynamic environments.

Keywords

Computer Science

Journal of Parallel and Distributed ComputingDynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems

819 Citations1999Muthucumaru Maheswaran, Shoukat Ali +3 more

Three new heuristics, one for batch mode and two for immediate mode, are introduced as part of this research, revealing that the choice of which dynamic mapping heuristic to use in a given heterogeneous environment depends on parameters such as the structure of the heterogeneity among tasks and machines and the arrival rate of the tasks.

Peer-to-peer architecture case study: Gnutella network

729 Citations2002Matei Ripeanu

A 'crawler' is built to extract the topology of Gnutella's application level network, a topology graph is analyzed and the current configuration has the benefits and drawbacks of a power-law structure.

Heuristics for scheduling parameter sweep applications in grid environments

569 Citations2002Henri Casanova, Arnaud Legrand +2 more

This study proposes an adaptive scheduling algorithm for parameter sweep applications on the grid, modify standard heuristics for task/host assignment in perfectly predictable environments, and proposes an extension of Sufferage called XSufferage.

View PDF

Journal of Computer Science and TechnologyQoS guided Min-Min heuristic for grid task scheduling

419 Citations2003Xiaoshan He, Xian‐He Sun +1 more

The experimental results show that the new QoS guided Min-Min heuristic can lead to significant performance gain for a variety of applications and is compared with others based on the quality of the prediction formulated by inaccurate information.

Lecture notes in computer scienceTrading Cycles for Information: Using Replication to Schedule Bag-of-Tasks Applications on Computational Grids

243 Citations2003Daniel Paranhos da Silva, Walfredo Cirne +1 more

This paper uses task replication to cope with the dynamic and heterogeneous nature of grids without depending on any information about machines or tasks and shows that task replication can deliver good and stable performance at the expense of additional resource consumption.

Future Generation Computer SystemsAn ant algorithm for balanced job scheduling in grids

195 Citations2008Ruay-Shiung Chang, Jih‐Sheng Chang +1 more

A Balanced Ant Colony Optimization (BACO) algorithm for job scheduling in the Grid environment is proposed to balance the entire system load while trying to minimize the makespan of a given set of jobs.

Segmented min-min: a static mapping algorithm for meta-tasks on heterogeneous computing systems

135 Citations2002Min‐You Wu, Wei Shu +1 more

An algorithm is presented which improves the min-min algorithm by scheduling large tasks first, balances the load well and demonstrates even better performance in both makespan and running time.

Journal of Parallel and Distributed ComputingStatic and Dynamic Processor Scheduling Disciplines in Heterogeneous Parallel Architectures

121 Citations1995Daniel A. Menascé, Dibakar Saha +3 more

A new static processor assignment policy, called Largest Task First Minimum Finish Time (LTFMFT), is introduced and the analysis shows that this policy is very sensitive to the degree of heterogeneity of the architecture, and that it outperforms all other policies analyzed.

Future Generation Computer SystemsJob scheduling and data replication on data grids

121 Citations2007Ruay-Shiung Chang, Jih‐Sheng Chang +1 more

A job scheduling policy called HCS (Hierarchical Cluster Scheduling), and a dynamic data replication strategy, called HRS (Hiersarchical Replication Strategy), to improve the data access efficiencies in a cluster grid are developed and implemented.

Future Generation Computer SystemsA decentralized model for scheduling independent tasks in Federated Grids

82 Citations2009Katia Leal, Eduardo Huedo +1 more

A decentralized model for scheduling independent tasks in Federated Grids that consists of a set of meta-schedulers on each of the grid infrastructures of the Federated Grid to improve two of the most common objective functions of task scheduling problems: makespan and resource performance.