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.