By Topic

An Efficient Stochastic Local Search for Heterogeneous Computing Scheduling

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Sergio Nesmachnow ; Univ. de la Republica, Montevideo, Uruguay ; Francisco Luna ; Enrique Alba

This work presents a stochastic local search method for efficiently solve the scheduling problem in heterogeneous computing environments. The research community has been searching for accurate schedulers for heterogeneous computing systems, able to perform in reduced times. The stochastic search proposed in this work is based on simple operators in order to keep the computational complexity as low as possible, thus allowing to efficiently tackle large scheduling instances. The experimental analysis demonstrates that the new stochastic local search method is able to compute accurate suboptimal schedules in significantly shorter execution times than state-of-the-art schedulers.

Published in:

Parallel and Distributed Processing Symposium Workshops & PhD Forum (IPDPSW), 2012 IEEE 26th International

Date of Conference:

21-25 May 2012