IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v50y2025i1d10.1007_s10878-025-01297-0.html
   My bibliography  Save this article

Hardness and algorithms for several new optimization problems on the weighted massively parallel computation model

Author

Listed:
  • Hengzhao Ma

    (Northeastern University
    Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences)

  • Jianzhong Li

    (Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences)

Abstract

The topology-aware Massively Parallel Computation (MPC) model is proposed and studied recently, which enhances the classical MPC model by the awareness of network topology. The work of Hu et. al. on topology-aware MPC model considers only the tree topology. In this paper a more general case is considered, where the underlying network is a weighted complete graph. We then call this model as Weighted Massively Parallel Computation (WMPC) model, and study the problem of minimizing communication cost under it. Three communication cost minimization problems are defined based on different patterns of communication, which are the Data Redistribution Problem, Data Allocation Problem on Continuous data, and Data Allocation Problem on Categorized data. We also define four kinds of objective functions for communication cost, which consider the total cost, bottleneck cost, maximum of send and receive cost, and summation of send and receive cost, respectively. Combining the three problems in different communication patterns with the four kinds of objective cost functions, 12 problems are obtained. The hardness results and algorithms of the 12 problems make up the content of this paper. With rigorous proof, we prove that some of the 12 problems are in P, some FPT, some NP-complete, and some W[1]-complete. Approximate algorithms are proposed for several selected problems.

Suggested Citation

  • Hengzhao Ma & Jianzhong Li, 2025. "Hardness and algorithms for several new optimization problems on the weighted massively parallel computation model," Journal of Combinatorial Optimization, Springer, vol. 50(1), pages 1-40, August.
    • Handle: RePEc:spr:jcomop:v:50:y:2025:i:1:d:10.1007_s10878-025-01297-0
    DOI: 10.1007/s10878-025-01297-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-025-01297-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-025-01297-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:50:y:2025:i:1:d:10.1007_s10878-025-01297-0. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.