Comparative Study of Static Task Scheduling Algorithms for Heterogeneous Systems

Journal Title: International Journal on Computer Science and Engineering - Year 2013, Vol 5, Issue 3

Abstract

On the distributed or parallel heterogeneous computing systems, an application is usually decomposed into several interdependent sets of co-operating subtasks and assigned to a set of available processors for execution. Task scheduling is in general NP-compete problem. Static task scheduling algorithms are categorized as Heuristic based and Guided random search based scheduling algorithms. Heuristic algorithms guaranteed to find near optimal solution in less than polynomial time. Heuristic based list scheduling algorithms are Heterogeneous Earliest Finish Time (HEFT) and Critical-Path-On-a-Processor (CPOP). Whereas, Guided random search based scheduling algorithms have shown robust performance on verity of scheduling problems. Typical examples are Multiple Priority Queueing Genetic Algorithm (MPQGA), Tabu Search(TS), Ant Colony System (ACS). This paper gives comparative study of all these static task scheduling algorithms and compares them on the basis of average makespan, schedule length ratio (SLR) and speedup and running time of algorithm.

Authors and Affiliations

Miss. Kalpana A. Manudhane , Mr. Avinash Wadhe

Keywords

Related Articles

A Novel Technique for Embedding Data in Spatial Domain

Abstract- Steganography is the science of hiding messages in a manner that only the intended users knows the presence of the secret message. Hiding the information within a computer file also comes under Steganography. I...

EVALUATION OF CBIR APPROACHES FOR DIFFERENTLY SIZED IMAGES

CBIR is the application of computer vision techniques to the image retrieval problem, that is, the problem of searching for digital images in large databases. An experimental comparison of a number of different color des...

Fast Method for Two-dimensional Renyi’s Entropy-based Thresholding

Two-dimensional (2-D) thresholding can give a better segmentation than one-dimensional thresholding by taking the spatial correlation of the image. Unfortunately, the computational cost is an obstacle for the implementat...

A Study on the Performance of Android Platform

As the Android platform is widely used for embedded systems including smart mobile devices, the needs for systematic performance analysis have significantly increased. System performance is usually measured by benchmarks...

Classification of Breast cancer by comparing Back propagation training algorithms

Breast cancer diagnosis has been approached by various machine learning techniques for many years. This paper presents a study on classification of Breast cancer using Feed Forward Artificial Neural Networks. Back propag...

Download PDF file
  • EP ID EP125390
  • DOI -
  • Views 70
  • Downloads 0

How To Cite

Miss. Kalpana A. Manudhane, Mr. Avinash Wadhe (2013). Comparative Study of Static Task Scheduling Algorithms for Heterogeneous Systems. International Journal on Computer Science and Engineering, 5(3), 166-173. https://europub.co.uk/articles/-A-125390