Aiming at the static task scheduling problems in heterogeneous environment, a heuristic task scheduling algorithm named HCPPEFT is proposed. In task prioritizing phase, there are three levels of priority in the algorithm to choose task. First, the critical tasks have the highest priority, secondly the tasks with longer path to exit task will be selected, and then algorithm will choose tasks wit...

In parallel and distributed computing, development of an efficient static task scheduling algorithm for directed acyclic graph (DAG) applications is an important problem. The static task scheduling problem is NP-complete in its general form. The complexity of the problem increases when task scheduling is to be done in a heterogeneous environment, consisting of processors with varying processing...

Because the task scheduling problem is np-complete problem, it is hard to find a deterministic algorithm to solve the problem of task scheduling in the cloud computing platform. Therefore this paper presents a task scheduling mechanism based on simulated annealing algorithm. The algorithm is a modern heuristic algorithm and overcome the shortcoming of the local optimum search method. The algori...

Hadoop uses a reliable, efficient and scalable way to process data. It provides a good solution for dealing with big data. The task scheduler is the core component of Hadoop, and it is responsible for the managing and allocating the cluster resources. Therefore, scheduling algorithm directly affects the overall performance of Hadoop platform and utilization of cluster resource. Based on this, t...

Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...

We present an algorithm for scheduling precedence constrained parallel tasks on multiprocessors with noncontiguous processor allocation. The algorithm is called LLHm (Level-by-level and List scheduling using the Harmonic system partitioning scheme), where m ≥ 1 is a positive integer, which is a parameter for the harmonic system partitioning scheme. Three basic techniques are employed in algorit...

proper scheduling of tasks leads to optimum using of time and resources, inorder to obtaining best result. one of the most important and complicatedscheduling problems is open shop scheduling problem. there are n jobs in openshop scheduling problem which should be processed by m machines. purpose ofscheduling open shop problem is attaining to a suitable order of processing jobs byspecified mach...

The goal of grid computing is to provide powerful computing for complex scientific problems by utilizing and sharing large scale resources available in the grid. Efficient scheduling algorithms are needed to allocate suitable resources for each submitted task. So scheduling is one of the most important issues for achieving high performance computing in grid. This paper addresses an approach for...

Abstract— Processor heterogeneity is an important issue in grid environment. In this paper, a list based task scheduling algorithm, called “critical path scheduling with t-level” (CPST) for grid computing system is proposed. There are no. of scheduling algorithms such as HEFT [1] use mean execution time based b-level for task priority and SHCP [2] use task priority based on simple critical path...

Heuristic and task scheduling provide better scheduling solutions for cloud computing by greatly enriching in identifying candidate solutions, ensuring performance optimization and therefore reducing the make span of task scheduling. Several researchers have put forward scheduling and load balancing algorithms for cloud computing systems. However, how to reduce the response latency while effici...