Cart (Loading....) | Create Account
Close category search window
 

Partitioning concurrent VLSI simulation programs onto a multiprocessor by simulated annealing

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

1 Author(s)
Sheild, J. ; Loughborough University of Technology, Department of Electronic & Electrical Engineering, Loughborough, UK

Efficiently loading concurrent programs onto multiprocessor architectures is a graph partitioning problem where both the edges and vertices are weighted. The corresponding optimisation problem is computationally NP-hard, and the optimal solution can only be found by exhaustively examining all possible partitioning configurations. Near-optimal solutions can be found by using heuristic algorithms such as iterative improvement and simulated annealing. The simulated annealing heuristic is experimentally evaluated against simple iterative improvement for graphs representing the concurrent simulation programs of four VLSI circuits where the vertices were weighted. A simple cost function and an annealing schedule are presented for partitioning the graphs onto a star network of identical processors. Experimental results show that simulated annealing produces a better solution than simple iterative improvement but at the expense of considerable computer running times. It is suggested that the time required for simulated annealing to give better solutions than iterative improvement depends on the nature of distributions of weighted vertices and edges in the concurrent simulation graph as well as its size.

Published in:

Computers and Digital Techniques, IEE Proceedings E  (Volume:134 ,  Issue: 1 )

Date of Publication:

January 1987

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.