Exploring Parallel Efficiency and Synergy for Max-P Region Problem Using Python release_rev_7add13b6-7af4-4d9a-a2aa-b134e0b9df5f

by Viney Sindhu

Published by Georgia State University.



Given a set of n areas spatially covering a geographical zone such as a province, forming contiguous regions from homogeneous neighboring areas satisfying a minimum threshold criterion over each region is an interesting NP-hard problem that has applications in various domains such as political science and GIS. We focus on a specific case, called Max-p regions problem, in which the main objective is to maximize the number of regions while keeping heterogeneity in each region as small as possible. The solution is broken into two phases: Construction phase and Optimization phase. We present a parallel implementation of the Max-p problem using Python multiprocessing library. By exploiting an intuitive data structure based on multi-locks, we achieve up 12-fold and 19-fold speeds up over the best sequential algorithm for the construction and optimization phases respectively. We provide extensive experimental results to verify our algorithm.
In text/plain format

Type  article-journal
Stage   published
Year   2018
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)

This is a specific, static metadata record, not necessarily linked to any current entity in the catalog.

Catalog Record
Revision: 7add13b6-7af4-4d9a-a2aa-b134e0b9df5f