.png){kind=icon}
Return
Meta-Heuristics for Solving the Software Component Allocation Problem
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.3015864.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The software component allocation problem is concerned with mapping a set of software components to the computational units available in a heterogeneous computing system while maximizing a certain objective function. This problem is important in the domain of component-based software engineering, and solving it is not a trivial task. In this paper, we demonstrate a software framework for defining and solving component allocation problem instances. In addition, we implement two meta-heuristics for solving the problem. The experiments show that these meta-heuristics achieve good performance. The framework is designed to be extensible and therefore other researchers can conveniently use it to implement new meta-heuristics for solving the software component allocation problem.
Keywords:
Resource management
Software
Optimization
Genetic algorithms
Software algorithms
Computational modeling
Tools
Component allocation
model-driven engineering
embedded systems
heterogeneous systems
genetic algorithms
ant colony optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
No organization information available
Cited Papers
ShareSaveHerd Behaviour in the Pension Fund Administrators in Chile: A Correlation and Cointegration Analysis
PREAI
ShareSaveCan active learning techniques simultaneously develop students’ hard and soft skills? Evidence from an international relations class.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAIShareSaveShareSaveShareSaveShareSave
View more