返回
Meta-Heuristics for Solving the Software Component Allocation Problem
DOI:10.1109/ACCESS.2020.3015864.png)
摘要
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.
Keyword:
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总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
暂无机构信息
引用论文
Herd Behaviour in the Pension Fund Administrators in Chile: A Correlation and Cointegration Analysis
Can active learning techniques simultaneously develop students’ hard and soft skills? Evidence from an international relations class
PLOS ONE
IF0

