Optimal task partitioning strategy with duplication (OTPSD) in parallel computing environments
ثبت نشده
چکیده
Algorithms for scheduling tasks onto the heterogeneous processors must achieve remarkable performance in terms of scheduling length. Most of the scheduling algorithms do not provide the mechanism about minimum communication overhead. This paper introduces Optimal Task Partitioning Strategy with Duplication (OTPSD) that minimizes the scheduling length as well as communication overhead. The proposed scheduling algorithm is NP-complete. We introduce three phase algorithm in which the first phase comprises of grain_packSubDAG formation. The second phase is priority assignment phase. In the third phase, processors are grouped according to their processing capabilities. Proposed algorithm minimizes makespan and shows better performance in terms of normalized schedule length and processors utilization over the MCP and HEFT algorithms.
منابع مشابه
Optimal task partitioning strategy with duplication (OTPSD) in parallel computing environments
Algorithms for scheduling tasks onto the heterogeneous processors must achieve remarkable performance in terms of scheduling length. Most of the scheduling algorithms do not provide the mechanism about minimum communication overhead. This paper introduces Optimal Task Partitioning Strategy with Duplication (OTPSD) that minimizes the scheduling length as well as communication overhead. The propo...
متن کاملGreen Energy-aware task scheduling using the DVFS technique in Cloud Computing
Nowdays, energy consumption as a critical issue in distributed computing systems with high performance has become so green computing tries to energy consumption, carbon footprint and CO2 emissions in high performance computing systems (HPCs) such as clusters, Grid and Cloud that a large number of parallel. Reducing energy consumption for high end computing can bring various benefits such as red...
متن کاملStatic Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملReview on a Dynamic Scheduling Algorithm for Grid with Task Duplication
Scheduling of tasks in the grid environment is challenging compared to that in local computing service facilities. In the field of distributed and parallel computing grid computing plays a vital role for solving a wide range of large scale parallel applications. The main goal of task scheduling is to achieve high system throughput and to match the application with the available computing resour...
متن کاملP-SETHEO: Strategy Parallel Automated Theorem Proving
One of the key issues in Automated Theorem Proving is the search for optimal proof strategies. Since there is not one uniform strategy which works optimal on all proof tasks, one is faced with the diicult problem of selecting a good strategy for a given task. In this paper, we discuss a way of circumventing this strategy selection problem by using strategy parallelism. In this approach, a proof...
متن کامل