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

Performance Evaluation Of Different Adaptive Filters For ECG Signal Processing

One of the main problem in biomedical data processing like electrocardiography is the separation of the wanted signal from noises caused by power line interference, external lectromagnetic fields and random body movemen...

A Scheduling Approach with Processor and Network Heterogeneity for Grid Environment

Processor heterogeneity is an important issue in grid environment. In this paper, a list based task scheduling algorithm, called “critical path scheduling with t-level” (CPST) for grid computing system is proposed. There...

Byte Level NIDS Improvement

Byte sequences are used in multiple network intrusion detection systems (NIDS) as signatures to detect nasty activity. Though being highly competent, a high rate of false-positive rate is found. Here we suggest the conce...

Implementation of Secured password for Web applications using two server model

The secured password is the most commonly used uthentication mechanism in security applications [11]. There ay be chances of password hacking from the hackers, so hat t is very essential to protect password informati...

A Comparison of the TCP VariantsPerformance over different Routing Protocols on Mobile Ad Hoc Networks

Abstract: We describe a variant of TCP (Tahoe, Vegas), TCP is most widely used transport protocol in both wired and wireless networks. In mobile ad hoc networks, the topology changes frequently due to mobile nodes, this...

Download PDF file
  • EP ID EP125390
  • DOI -
  • Views 111
  • 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