Simplex Parallelization in a Fully Hybrid Hardware Platform
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2017, Vol 8, Issue 4
Abstract
The simplex method has been successfully used in solving linear programming (LP) problems for many years. Parallel approaches have also extensively been studied due to the intensive computations required, especially for the solution of large LP problems. Furthermore, the rapid proliferation of multicore CPU architectures as well as the computational power provided by the massive parallelism of modern GPUs have turned CPU / GPU collaboration models increasingly into focus over the last years for better performance. In this paper, a highly scalable implementation framework of the standard full tableau simplex method is first presented, over a hybrid parallel platform which consists of multiple multicore nodes interconnected via a high-speed communication network. The proposed approach is based on the combined use of MPI and OpenMP, adopting a suitable column-based distribution scheme for the simplex tableau. The parallelization framework is then extended in such a way that it can exploit concurrently the full power of the provided resources on a multicore single-node environment with a CUDA-enabled GPU (i.e. using the CPU cores and the GPU concurrently), based on a suitable hybrid multithreading/GPU offloading scheme with OpenMP and CUDA. The corresponding experimental results show that the hybrid MPI+OpenMP based parallelization scheme leads to particularly high speed-up and efficiency values, considerably better than in other competitive approaches, and scaling well even for very large / huge linear problems. Furthermore, the performance of the hybrid multithreading/GPU offloading scheme is clearly superior to both the OpenMP-only and the GPU-only based implementations in almost all cases, which validates the worth of using both resources concurrently. The most important, when it is used in combination with MPI in a multi-node (fully hybrid) environment, it leads to substantial improvements in the speedup achieved for large and very large LP problems.
Authors and Affiliations
Basilis Mamalis, Marios Perlitis
Keywords
Related Articles
- EP ID EP258366
- DOI 10.14569/IJACSA.2017.080449
- Views 108
- Downloads 0
PRIVACY-PRESERVING CLUSTERING USING REPRESENTATIVES OVER ARBITRARILY PARTITIONED DATA
The challenge in privacy-preserving data mining is avoiding the invasion of personal data privacy. Secure computa- tion provides a solution to this problem. With the development of this technique, fully homomorphic encry...
Analyzing Personality Traits and External Factors for Stem Education Awareness using Machine Learning
The purpose of the paper is to present the personality traits and the factors that influence a student to pursue STEM education using machine learning techniques. STEM courses have high regard because they play a vital r...
New Mathematical Modeling of Three-Level Supply Chain with Multiple Transportation Vehicles and Different Manufacturers
Nowadays, no industry can move in global markets individually and independently of competitors because they are part of a supply chain and the success of each member of the chain influences the others. In this paper, the...
User Intent Discovery using Analysis of Browsing History
The search engine can retrieve the information from the web by using keyword queries. The responsibility of search engines is getting the relevant results that met with users’ search intents. Nowadays, all search engines...
A New Efficient Method for Calculating Similarity Between Web Services
Web services allow communication between heterogeneous systems in a distributed environment. Their enormous success and their increased use led to the fact that thousands of Web services are present on the Internet. This...