Parallelization of a regionalization heuristic in distributed computing platforms – a case study of parallel-p-compact-regions problem

Jason Laura, WenWen Li, Sergio J. Rey, Luc Anselin

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

In this paper, we report efforts to develop a parallel implementation of the p-compact regionalization problem suitable for multi-core desktop and high-performance computing environments. Regionalization for data aggregation is a key component of many spatial analytical workflows that are known to be NP-Hard. We utilize a low communication cost parallel implementation technique that provides a benchmark for more complex implementations of this algorithm. Both the initialization phase, utilizing a Memory-based Randomized Greedy and Edge Reassignment (MERGE) algorithm, and the local search phase, utilizing Simulated Annealing, are distributed over available compute cores. Our results suggest that the proposed parallelization strategy is capable of solving the compactness-driven regionalization problem both efficiently and effectively. We expect this work to advance CyberGIS research by extending its application areas into the regionalization world and to make a contribution to the spatial analysis community by proposing this parallelization strategy to solve large regionalization problems efficiently.

Original languageEnglish (US)
Pages (from-to)536-555
Number of pages20
JournalInternational Journal of Geographical Information Science
Volume29
Issue number4
DOIs
StatePublished - Apr 3 2015

Fingerprint

regionalization
Distributed computer systems
heuristics
Simulated annealing
Agglomeration
Data storage equipment
Communication
simulated annealing
Costs
workflow
spatial analysis
aggregation
communication
costs
cost
community
performance
Local search (optimization)

Keywords

  • CyberGIS
  • cyberinfrastructure
  • heuristic
  • performance
  • spatial optimization

ASJC Scopus subject areas

  • Information Systems
  • Geography, Planning and Development
  • Library and Information Sciences

Cite this

Parallelization of a regionalization heuristic in distributed computing platforms – a case study of parallel-p-compact-regions problem. / Laura, Jason; Li, WenWen; Rey, Sergio J.; Anselin, Luc.

In: International Journal of Geographical Information Science, Vol. 29, No. 4, 03.04.2015, p. 536-555.

Research output: Contribution to journalArticle

@article{488e39268cce444da5403e695d1ff4b7,
title = "Parallelization of a regionalization heuristic in distributed computing platforms – a case study of parallel-p-compact-regions problem",
abstract = "In this paper, we report efforts to develop a parallel implementation of the p-compact regionalization problem suitable for multi-core desktop and high-performance computing environments. Regionalization for data aggregation is a key component of many spatial analytical workflows that are known to be NP-Hard. We utilize a low communication cost parallel implementation technique that provides a benchmark for more complex implementations of this algorithm. Both the initialization phase, utilizing a Memory-based Randomized Greedy and Edge Reassignment (MERGE) algorithm, and the local search phase, utilizing Simulated Annealing, are distributed over available compute cores. Our results suggest that the proposed parallelization strategy is capable of solving the compactness-driven regionalization problem both efficiently and effectively. We expect this work to advance CyberGIS research by extending its application areas into the regionalization world and to make a contribution to the spatial analysis community by proposing this parallelization strategy to solve large regionalization problems efficiently.",
keywords = "CyberGIS, cyberinfrastructure, heuristic, performance, spatial optimization",
author = "Jason Laura and WenWen Li and Rey, {Sergio J.} and Luc Anselin",
year = "2015",
month = "4",
day = "3",
doi = "10.1080/13658816.2014.987287",
language = "English (US)",
volume = "29",
pages = "536--555",
journal = "International Journal of Geographical Information Science",
issn = "1365-8816",
publisher = "Taylor and Francis Ltd.",
number = "4",

}

TY - JOUR

T1 - Parallelization of a regionalization heuristic in distributed computing platforms – a case study of parallel-p-compact-regions problem

AU - Laura, Jason

AU - Li, WenWen

AU - Rey, Sergio J.

AU - Anselin, Luc

PY - 2015/4/3

Y1 - 2015/4/3

N2 - In this paper, we report efforts to develop a parallel implementation of the p-compact regionalization problem suitable for multi-core desktop and high-performance computing environments. Regionalization for data aggregation is a key component of many spatial analytical workflows that are known to be NP-Hard. We utilize a low communication cost parallel implementation technique that provides a benchmark for more complex implementations of this algorithm. Both the initialization phase, utilizing a Memory-based Randomized Greedy and Edge Reassignment (MERGE) algorithm, and the local search phase, utilizing Simulated Annealing, are distributed over available compute cores. Our results suggest that the proposed parallelization strategy is capable of solving the compactness-driven regionalization problem both efficiently and effectively. We expect this work to advance CyberGIS research by extending its application areas into the regionalization world and to make a contribution to the spatial analysis community by proposing this parallelization strategy to solve large regionalization problems efficiently.

AB - In this paper, we report efforts to develop a parallel implementation of the p-compact regionalization problem suitable for multi-core desktop and high-performance computing environments. Regionalization for data aggregation is a key component of many spatial analytical workflows that are known to be NP-Hard. We utilize a low communication cost parallel implementation technique that provides a benchmark for more complex implementations of this algorithm. Both the initialization phase, utilizing a Memory-based Randomized Greedy and Edge Reassignment (MERGE) algorithm, and the local search phase, utilizing Simulated Annealing, are distributed over available compute cores. Our results suggest that the proposed parallelization strategy is capable of solving the compactness-driven regionalization problem both efficiently and effectively. We expect this work to advance CyberGIS research by extending its application areas into the regionalization world and to make a contribution to the spatial analysis community by proposing this parallelization strategy to solve large regionalization problems efficiently.

KW - CyberGIS

KW - cyberinfrastructure

KW - heuristic

KW - performance

KW - spatial optimization

UR - http://www.scopus.com/inward/record.url?scp=84930044303&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84930044303&partnerID=8YFLogxK

U2 - 10.1080/13658816.2014.987287

DO - 10.1080/13658816.2014.987287

M3 - Article

VL - 29

SP - 536

EP - 555

JO - International Journal of Geographical Information Science

JF - International Journal of Geographical Information Science

SN - 1365-8816

IS - 4

ER -