Subscribe Now Subscribe Today
Science Alert
 
Blue
   
Curve Top
Information Technology Journal
  Year: 2002 | Volume: 1 | Issue: 2 | Page No.: 153-159
DOI: 10.3923/itj.2002.153.159
 
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Scheduling Real-Time Tasks in Ditsributed Environment with Tabu Search Algorithm

Mahmood, A.

Abstract:
Many time critical applications require predictable performance and tasks in these applications have to meet their deadlines. Hence, tasks in these applications need to be scheduled in such a manner that they not only meet their deadlines but also satisfy some performance criteria specific to the application domain. Scheduling real-time tasks with minimum jitter in a distributed computing environment is particularly important in many control applications. This problem is known to be NP-hard, even for simple cases. Therefore, heuristic approaches seem appropriate to these classes of problems. In this paper, we investigate a tabu search algorithm for nonpreemptive static scheduling of real-time tasks where tasks are periodic and have arbitrary deadlines, precedence and exclusion constraints. The proposed algorithm not only creates a feasible schedule but it also minimizes jitter for periodic tasks. The performance of the algorithm has been studied through a simulation and the results are reported in this paper.
PDF References Citation Report Citation
 RELATED ARTICLES:
  •    The Scheduling Problem of Active Critical Chain Method
How to cite this article:

Mahmood, A. , 2002. Scheduling Real-Time Tasks in Ditsributed Environment with Tabu Search Algorithm. Information Technology Journal, 1: 153-159.

DOI: 10.3923/itj.2002.153.159

URL: https://scialert.net/abstract/?doi=itj.2002.153.159

COMMENT ON THIS PAPER
 
 
 

 

 
 
 
 
 
 
 
 
 

 
 
 
 
 

Curve Bottom