Particle swarm optimisation of memory usage in embedded systems
by Jose L. Risco-Martin, Oscar Garnica, Juan Lanchares, J. Ignacio Hidalgo, David Atienza
International Journal of High Performance Systems Architecture (IJHPSA), Vol. 1, No. 4, 2008

Abstract: In this paper, we propose a dynamic, non-dominated sorting, multi-objective particle-swarm-based optimiser, named hierarchical non-dominated sorting particle swarm optimiser (H-NSPSO), for memory usage optimisation in embedded systems. It significantly reduces the computational complexity of others multi- objective particle swarm optimisation (MOPSO) algorithms. Concretely, it first uses a fast non-dominated sorting approach with O(mN²) computational complexity. Second, it maintains an external archive to store a fixed number of non-dominated particles, which is used to drive the particle population towards the best non-dominated set over many iteration steps. Finally, the proposed algorithm separates particles into multi sub-swarms, building several tree networks as the neighbourhood topology. H-NSPSO has been made adaptive in nature by allowing its vital parameters (inertia weight and learning factors) to change within iterations. The method is evaluated using two real world examples in embedded applications and compared with existing covering methods.

Online publication date: Sun, 29-Mar-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Systems Architecture (IJHPSA):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com