Task Scheduling Algorithm to Reduce the Number of Processors using Merge Conditions

Journal Title: International Journal on Computer Science and Engineering - Year 2012, Vol 4, Issue 2

Abstract

Some task scheduling algorithms generate the shortest schedule, when its input DAG satisfies a specified condition. Among those scheduling algorithms, TDS algorithm proposed a DAG condition where allocation of two parent tasks of a join task in the same processor cause longer schedule length than allocation in different processors, and it generates the shortest schedule if any input DAG satisfies the condition. In the paper, we propose a post-processing scheduling algorithm that reduces the number of processors while preserving its schedule length. Especially, we propose conditions where two processes can be merged without increasing schedule length. Experimental results show that the number of processor is reduced to 92.3% ~ 98.0% if schedule length is reserved and required computing power is reduced to 84.3% ~ 91.2% if schedule length can be increased.

Authors and Affiliations

Tae-Young Choe

Keywords

Related Articles

Audio-Visual Based Multi-Sample Fusion to Enhance Correlation Filters Speaker Verification System

In this study, we propose a novel approach for speaker verification system that uses a spectrogram image as features and Unconstrained Minimum Average Correlation Energy (UMACE) filters as classifiers. Since speech signa...

Robust Algorithm for Impulse Noise Detection

Efficiency of noise removing algorithms depends on two main parameters first one is how accurately it identify the noisy pixels and second one is how much accurately it calculate the replacing value for noisy pixels. Thi...

Data Security : An Analysis

There is intense of cyber attach through electronic media, so it calls for data security practice. Internet technology becomes very pervasive to exchange data through online. Various Government and private sectors mostly...

Use of Splines in Handwritten Character Recognition

Handwritten Character Recognition is software used to identify the and written characters and receive and interpret intelligible handwritten input from sources such as manuscript documents. The recent past several years...

MRI Brain Image Segmentation Algorithm Using Watershed Transform and Kernel Fuzzy C-Means Clustering on Level Set Method

A new method for image segmentation is proposed in this paper, which combines the watershed transform, KFCM and level set method. The watershed transform is first used to presegment the image so as to get the initial par...

Download PDF file
  • EP ID EP114096
  • DOI -
  • Views 135
  • Downloads 0

How To Cite

Tae-Young Choe (2012). Task Scheduling Algorithm to Reduce the Number of Processors using Merge Conditions. International Journal on Computer Science and Engineering, 4(2), 255-266. https://europub.co.uk./articles/-A-114096