Next Article in Journal / Special Issue
The Use of an Exact Algorithm within a Tabu Search Maximum Clique Algorithm
Previous Article in Journal
Multi-Winner Election Control via Social Influence: Hardness and Algorithms for Restricted Cases
Previous Article in Special Issue
Optimization Algorithms for Detection of Social Interactions
Open AccessReview

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

1
School of Information Technology, Deakin University, Geelong 3126, Australia
2
Faculty of Information Technology, Monash University, Melbourne 3800, Australia
*
Author to whom correspondence should be addressed.
Algorithms 2020, 13(10), 252; https://doi.org/10.3390/a13100252
Received: 1 July 2020 / Revised: 24 September 2020 / Accepted: 29 September 2020 / Published: 3 October 2020
(This article belongs to the Special Issue Algorithms for Graphs and Networks)
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. View Full-Text
Keywords: software deployment problem; Ant Colony System; multi-objective optimisation; Beam search software deployment problem; Ant Colony System; multi-objective optimisation; Beam search
Show Figures

Figure 1

MDPI and ACS Style

Thiruvady, D.; Nazari, A.; Aleti, A. Multi-objective Beam-ACO for Maximising Reliability and Minimising Communication Overhead in the Component Deployment Problem. Algorithms 2020, 13, 252.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Search more from Scilit
 
Search
Back to TopTop