large-search-space-simulation.rar

Mesurement results collected for the I-IV framework's validation of heuristic algorithms. Two separate datasets are contained here: - experiment of heuristic algorithm performance and precision for small search spaces, in which an exhaustive search can find the optimal allocation of software components on a heterogeneous computing platform - experiment in which the search space size is beyond the exhaustive search method, where the allocations obtained by the heuristic methods (genetic algorithm and simulated annealing) are compared to randomly generated allocations.

本数据集收录了用于验证I-IV框架下启发式算法（heuristic algorithms）的测量结果。本次数据集包含两组独立实验：其一为小型搜索空间场景下的启发式算法性能与精度实验，在此类场景中可通过穷举搜索（exhaustive search）得到异构计算平台（heterogeneous computing platform）上软件组件的最优分配方案；其二为搜索空间规模超出穷举搜索能力范围的实验，在此场景下将对比由遗传算法（genetic algorithm）与模拟退火（simulated annealing）这两种启发式方法所获得的分配方案与随机生成的分配方案。