By Topic

Task tree scheduling onto linear arrays using tabu search

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Dhodhi, M.K. ; Dept. of Electr. & Comput. Eng., Kuwait Univ., Safat, Kuwait ; Ahmad, I.

Tabu search is a promising optimisation heuristic that has been successfully applied to the solution of many combinatorial optimisation problems, yielding optimal or near optimal results. An efficient algorithm based on tabu search is presented, designated as TASS, for the problem of scheduling a tree-like task graph (task tree) onto linear arrays of processors, with the aim of minimising the system response time. The linear processor arrays implemented in VLSI/ULSI technology provide an affordable and cost-effective solution for special applications that can be represented by task trees. The performance of the proposed tabu search-based algorithm is evaluated for a set of test problems selected from the literature. Comparison of results obtained by the proposed algorithm with results reported by previous techniques, shows a considerable improvement in the system response time

Published in:

Computers and Digital Techniques, IEE Proceedings -  (Volume:144 ,  Issue: 5 )