APDCM2025 June 4 (Wed), 2025, to be held in conjunction with

IPDPS June 3-7, Politecnico di Milano, Milan, Italy, 2025

The past thirty years have seen a flurry of activity in the area of parallel and distributed computing. In recent years, novel parallel and distributed computational models have been proposed in the literature, reflecting advances in new computational devices and environments such as optical interconnects, programmable logic arrays, networks of workstations, radio communications, mobile computing, DNA computing, quantum computing, sensor networks etc. It is very encouraging to note that the advent of these new models has lead to significant advances in the resolution of various difficult problems of practical interest.

The main goal of this workshop is to provide a timely forum for the exchange and dissemination of new ideas, techniques and research in the field of the parallel and distributed computational models. The workshop is meant to bring together researchers and practitioners interested in all aspects of parallel and distributed computing taken in an inclusive, rather than exclusive, sense. We are convinced that the workshop atmosphere will be conducive to open and mutually beneficial exchanges of ideas between the participants.

Topics of interest include, but are not limited to

Radio communication models, Mobile computing models, Sensor network models, Hardware-specific models, FPGA models, Systolic arrays and cellular automata, Peer-to-peer models, Biologically-based computing models, Quantum computing model, Quantum annealing model, Ising model, Reconfigurable models, Optical models, CUDA, OpenCL, GPU computing models, BSP and LogP models, PGAS model, Cloud computing model, Edge/Fog computing model, NUMA model

Geometric and graph algorithms, Combinatorial algorithms, Randomized and approximation techniques, Optimization, Numerical algorithms, Quantum algorithms, Network algorithms, Localized algorithms, Distributed algorithms, Image processing, High-performance computing, GPU applications, MapReduce, Machine learning

Architectural and implementation issues, Performance analysis and simulation, MPI, Multi-core processors, Programmable logic arrays, GPGPU, Design of network protocols, Embedded systems, Cloud computing, Cluster Computing, Development tools, Fault tolerance, Security Issues, Big data analysis, Quantum annealing

IPDPS is sponsored by IEEE, and all papers presented at IPDPS-APDCM workshop will be published in the Proceedings published from IEEE Computer Society and will be included in IEEE Xplore and CSDL digital libraries. Also they are submitted for indexing through INSPEC, EI (Compendex), Thomson ISI, and other indexing services.

Prospective authors are encouraged to submit electronic versions of original, unpublished manuscripts. The maximum length is 10 pages for REGULAR papers and 4 pages for SHORT papers, using the Manuscript Templates for Conference Proceedings. We also warmly welcome comprehensive survey papers on timely and relevant topics.

Abstracts must be registered via EasyChair by the abstract deadline specified below (23:59 UTC). Abstract submission is mandatory, as reviewers are assigned based on the content of the abstracts. After registering the abstract, authors must submit the PDF version of the paper by the paper submission deadline (23:59 UTC). Both the abstract and the PDF can be updated at any time before the respective deadlines.

• Submission site: EasyChair

We will select the Best/Outstanding papers. Please see history for Best/Outstanding papers in past editions.

We plan to publish full versions of selected papers in the International Journal on Networking and Computing(IJNC). Authors of selected papers will be invited to submit their manuscripts after the workshop.

The International Journal of Networking and Computing is a biannual journal that publishes peer-reviewed articles in all areas of networking and computing. It has both print and online versions. All papers are indexed in indexing services including DBLP Computer Science Bibliography, Google Scholar, J-DreamII, and J-GLOBAL.

• Title: Massively Parallel and Distributed State Space Search Algorithms for Domain-Independent Dynamic Programming

• Speaker: Ryo Kuroiwa, National Institute of Informatics

• Abstract: This talk focuses on our recent work on developing general-purpose solvers for combinatorial optimization in a massively parallel and distributed environment. Our work is based on domain-independent dynamic programming (DIDP), where a problem is modeled as a dynamic programming model and solved by state space search. After introducing DIDP, we show that naive extensions of existing solvers result in poor scalability. Then, we introduce our new parallel and distributed state space search algorithms to overcome such issues. We demonstrate the scalability of the developed solvers using up to 93.2 TB of RAM and 24576 CPU cores.

• Bio: Ryo Kuroiwa is an Assistant Professor at the National Institute of Informatics (NII) in Japan. Before joining NII, he earned his Ph.D. at the University of Toronto and master's and bachelor's degrees at the University of Tokyo. His research focuses on combinatorial optimization, search algorithms, and parallel algorithms.

• All dates are in UTC+0, and submission will be closed at 23:59PM in UTC.
• Abstract Due: January 28, 2025
• Paper Due: February 2, 2025
• Notification: February 22, 2025
• Final Manuscript Due: March 6, 2025

• Jacir L. Bordim, University of Brasilia
• Koji Nakano, Hiroshima University

• Susumu Matsumae, Saga University
• Masahiro Shibata, Kyushu Institute of Technology

• Dip Sankar Banerjee, Indian Institute of Technology Jodhpur
• Alexandre Denis, INRIA
• Stéphane Devismes, University of Picardie Jules Verne
• Nguyen Anh Vu Doan, Infineon Technologies AG
• Somchart Fugkeaw, Thammasat University
• Masaru Fukushi, Yamaguchi University
• Maxime Gonthier, University of Chicago
• Qianping Gu, Simon Fraser University
• Shuichi Ichikawa, Toyohashi University of Technology
• Yasuaki Ito, Hiroshima University
• Chuzo Iwamoto, Hiroshima University
• Hideyuki Kawashima, Keio University
• Yonghwan Kim, Nagoya Institute of Technology
• Michihiro Koibuchi, National Institute of Informatics
• Kazuhiko Komatsu, Tohoku University
• Vanel Lazcano, Universidad Mayor
• Hiroki Matsutani, Keio University
• Junya Nakamura, Toyohashi University of Technology
• Pratik Nayak, Karlsruhe Institute of Technology
• Fukuhito Ooshita, Fukui University of Technology
• Tomonobu Ozaki, Nihon University
• Victor Parque, Hiroshima University
• Jonas Posner, University of Kassel
• Hongyang Sun, University of Kansas
• Daisuke Takafuji, Shunan University
• Jerry Trahan, Louisiana State University, Baton Rouge
• Ryota Yasudo, Kyoto University