科研之友
微信
新浪微博
Facebook
分享链接
摘要
This article presents the parallel implementation on CPU/GPU of two variants of a stochastic local search method to efficiently solve the scheduling problem in heterogeneous computing systems. Both methods are based on a set of simple operators to keep the computational complexity as low as possible, thus allowing large instances of the scheduling problem to be efficiently addressed. The experimental analysis demonstrates that both versions of the parallel CPU/GPU stochastic local search are able to compute accurate suboptimal schedules in significantly shorter execution times than state-of-the-art schedulers, while also outperforming a recently published GPU parallel evolutionary scheduler in terms of both efficiency and solution quality.
- 出版日期2015-2
