By Topic

An investigation of the heterogeneous mapping problem using genetic algorithms

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
$33 $33
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

3 Author(s)
M. J. Baxter ; Sheffield Univ., UK ; M. O. Tokhi ; P. J. Fleming

Mapping is the off-line allocation of the tasks that represent a parallelised algorithm across a multiprocessor architecture. In this paper the target architecture is heterogeneous, where a number of computationally disparate processors are integrated within a single network. This paper describes the development of several exploratory mapping algorithms that attempt to minimise the cycle-time of the application algorithms. A simple heuristic is appraised first, followed by an examination of a genetic algorithm (GA) approach. Subsequently, the GA is augmented with several specialised operators in an attempt to improve performance. Finally, a mechanism to adapt the operator probabilities based on their recent performance is introduced. Initially, the GA utilises a simple parallel architecture model. However, this leads to the embedding of the target hardware within the objective function to improve performance. Finally, the effectiveness of these approaches are examined and contrasted, with due consideration of what has been learnt about the nature of the heterogeneous mapping problem.

Published in:

Control '96, UKACC International Conference on (Conf. Publ. No. 427)  (Volume:1 )

Date of Conference:

2-5 Sept. 1996