Openly accessible

Multi-Objective Beam-ACO for Maximising Reliability and Minimising Communication Overhead in the Component Deployment Problem

Thiruvady, Dhananjay, Nazari, Asef and Aleti, Aldeida 2020, Multi-Objective Beam-ACO for Maximising Reliability and Minimising Communication Overhead in the Component Deployment Problem, Algorithms, vol. 13, no. 10, pp. 1-19, doi: 10.3390/a13100252.

Attached Files
Name Description MIMEType Size Downloads

Title Multi-Objective Beam-ACO for Maximising Reliability and Minimising Communication Overhead in the Component Deployment Problem
Author(s) Thiruvady, DhananjayORCID iD for Thiruvady, Dhananjay orcid.org/0000-0002-8011-933X
Nazari, AsefORCID iD for Nazari, Asef orcid.org/0000-0003-4955-9684
Aleti, Aldeida
Journal name Algorithms
Volume number 13
Issue number 10
Article ID 252
Start page 1
End page 19
Total pages 19
Publisher MDPI
Place of publication Basel, Switzerland
Publication date 2020
ISSN 1999-4893
Summary Automated deployment of software components into hardware resources is a highly constrained optimisation problem. Hardware memory limits which components can be deployed into the particular hardware unit. Interacting software components have to be deployed either into the same hardware unit, or connected units. Safety concerns could restrict the deployment of two software components into the same unit. All these constraints hinder the search for high quality solutions that optimise quality attributes, such as reliability and communication overhead. When the optimisation problem is multi-objective, as it is the case when considering reliability and communication overhead, existing methods often fail to produce feasible results. Moreover, this problem can be modelled by bipartite graphs with complicating constraints, but known methods do not scale well under the additional restrictions. In this paper, we develop a novel multi-objective Beam search and ant colony optimisation (Beam-ACO) hybrid method, which uses problem specific bounds derived from communication, co-localisation and memory constraints, to guide the search towards feasibility. We conduct an experimental evaluation on a range of component deployment problem instances with varying levels of difficulty. We find that Beam-ACO guided by the co-localisation constraint is most effective in finding high quality feasible solutions.
Language eng
DOI 10.3390/a13100252
Indigenous content off
Field of Research 01 Mathematical Sciences
08 Information and Computing Sciences
09 Engineering
HERDC Research category C1 Refereed article in a scholarly journal
Free to Read? Yes
Persistent URL http://hdl.handle.net/10536/DRO/DU:30143506

Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 0 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 14 Abstract Views, 0 File Downloads  -  Detailed Statistics
Created: Tue, 06 Oct 2020, 22:50:21 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.