Parallelization the Job-shop Problem on Distributed and Shared Memory Architectures
Faculty of Information Technology, Lac Hong University
International Journal of Computer Science and Telecommunications, Volume 4, Issue 6, 2013
@article{trung2013parallelization,
title={Parallelization the Job-shop Problem on Distributed and Shared Memory Architectures},
author={Trung, Vu Dinh and Lang, Tran Van},
year={2013}
}
The paper presents the parallel algorithm for solving the scheduling problem. This algorithm is implemented in the distributed memory multi-computers, and with each machine using CPU – GPU shared memory architecture, so that the time to complete the work as quickly as possible. This algorithm is based on the branching algorithm approach for searching. The experimental results for the scheduling problem were calculated with large data. From that determines the threshold of input data of the problem in order to the computation time is minimum.
July 17, 2013 by hgpu
