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
- EP ID EP114096
- DOI -
- Views 108
- Downloads 0
Significance of Web 2.0 in Digital Libraries
The rapid development of Information and Communication Technologies has provided a well sophisticated environment to develop the digital libraries. A digital library is a large-scale, organized collection of complex and...
Clustering Mixed Data Set Using Modified MARDL Technique
Clustering is tend to be an important issue in data mining applications. Many clustering algorithms are available to cluster datasets that contain either numeric or categorical attributes. The real life database consists...
Generation of a pool of variable size symmetric keys through Image
This paper introduces a new concept of the generation of a unending pool of keys through an image leaving behind the idea of sending keys every time for encryption and decryption. This can help in avoiding the problem of...
WaveCluster for Remote Sensing Image Retrieval
Wave Cluster is a grid based clustering approach. Many researchers have applied wave cluster technique for segmenting images. Wave cluster uses wave transformation for clustering the data item. Normally it uses Haar, Dau...