Evolutionary algorithms for affinity scheduling heuristics in heterogeneous computing systems

This article presents the application of evolutionary algorithms to solve the affinity scheduling problem in multicore computing systems. Affinity scheduling is a technique that allows the efficient utilization of heterogeneous computing systems, by assigning a set of task taking into account specific efficency and quality-of-service criteria. The evolutionary algorithms proposed in this article are useful methods to solve realistic instances of the affinity scheduling problem, outperforming the results computed using traditional acheduling techniques when evaluating both the communication and synchronization times between tasks.