Welcome to the InfoSci Platform
A GPU Based Approach for Solving the Workflow Scheduling Problem

A GPU Based Approach for Solving the Workflow Scheduling Problem

Mohammed Benhammouda, Mimoun Malki
Copyright: © 2019 |Volume: 9 |Issue: 4 |Pages: 12
ISSN: 2155-6377|EISSN: 2155-6385|EISBN13: 9781522567172|DOI: 10.4018/IJIRR.2019100101
Cite Article Cite Article

MLA

Benhammouda, Mohammed, and Mimoun Malki. "A GPU Based Approach for Solving the Workflow Scheduling Problem." IJIRR vol.9, no.4 2019: pp.1-12. http://doi.org/10.4018/IJIRR.2019100101

APA

Benhammouda, M. & Malki, M. (2019). A GPU Based Approach for Solving the Workflow Scheduling Problem. International Journal of Information Retrieval Research (IJIRR), 9(4), 1-12. http://doi.org/10.4018/IJIRR.2019100101

Chicago

Benhammouda, Mohammed, and Mimoun Malki. "A GPU Based Approach for Solving the Workflow Scheduling Problem," International Journal of Information Retrieval Research (IJIRR) 9, no.4: 1-12. http://doi.org/10.4018/IJIRR.2019100101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Cloud computing is considered a new way to use on-demand computing resources. When executing a workflow process in such an environment, task scheduling, a well-known NP-hard problem is a very important step. Many heuristic algorithms have been proposed to solve this problem. In this article, the authors present a GPU-based approach for solving the workflow scheduling problem. The main idea of the approach is to implement a massively parallel version of the simulated annealing algorithm, in an asynchronous way where no information is exchanged among parallel runs. The proposed approach, called PSA algorithm, is against another well-established scheduling HEFT heuristic. Experiments with randomly generated graphs show a much better performance from the proposed approach.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.