Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

A Parallel Simulated Annealing Approach for the Mapping of Large Process Networks

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 $13
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)
Galea, F. ; Embedded Real Time Syst. Lab., CEA, Gif-sur-Yvette, France ; Sirdey, R.

We propose a parallel simulated annealing approach to solve a dataflow process network mapping problem, where a network of communicating tasks is mapped into a set of processors with limited resource capacities, while minimizing the overall communication bandwidth between processors. The speedups obtained using this approach enables us to solve problems with more than one thousand tasks, on up to 48 processors, in reasonable time. Results have been obtained by taking profit of the specific architecture of a Non-Uniform Memory Access (NUMA) computer.

Published in:

Parallel and Distributed Processing Symposium Workshops & PhD Forum (IPDPSW), 2012 IEEE 26th International

Date of Conference:

21-25 May 2012