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 164
- Downloads 0
Analysis QoS Parameters for MANETs Routing Protocols
A Mobile Ad-Hoc Network (MANET) is a decentralized network of autonomous mobile nodes able to communicate with each other over wireless links. We selected three routing protocols DSDV, DSR and AODV for measuring QoS par...
Modern Trends Used In Operating Systems For High Speed Computing Applications
Operating system researches traditionally consist of adding new functions to the operating system in other words inventing and evaluating new methods for performing functions. Operating systems are the single most comple...
I n d o or Environment Mobile Robot Localization
Robot Localization is an emerging area in recent research and applications. The determination of location or localization is he basic requirement for robots to move in their office nvironment. This proposed work aims t...
An Enhanced Active contour based Segmentation for Fingerprint Extraction
Fingerprint Segmentation is one of the critical and important steps in Automatic Fingerprint Recognition System (AFIS). It is a process that separates the fingerprint image into two regions, the foreground and background...
Job-Oriented Monitoring of Clusters
There has been a lot of development in the field of clusters and grids. Recently, the use of clusters has been on rise in every possible field. This paper proposes a system that monitors jobs on large computational clust...