APDCM2018 May 21, 2018, to be held in conjunction with

IPDPS May 21 – 25, 2018, JW Marriott Parq Vancouver, Vancouver, British Columbia, CANADA

Tentative program is here.

• Best Paper: Optimal Cooperative Checkpointing for Shared High-Performance Computing Platforms, Thomas Herault, Yves Robert, Aurelien Bouteiller, Dorian Arnold, Kurt Ferreira, George Bosilca and Jack Dongarra
• Outstanding Paper: A population protocol for uniform k-partition under global fairness, Hiroto Yasumi, Naoki Kitamura, Fukuhito Ooshita, Taisuke Izumi and Michiko Inoue

The past twenty 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 models, Reconfigurable models, Optical models, CUDA, OpenCL, GPU computing models, BSP and LogP models, PGAS model

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

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

Prospective authors are encouraged to submit an electronic version of original, unpublished manuscripts, not to exceed 10 pages using Manuscript Templates for Conference Proceedings. We also welcome comprehensive survey papers on timely topics. Abstracts must be registered through EasyChair by February 8, 2018**. After the abstract registration, the PDF of the paper must be submitted by February 14, 2018. You can update abstract and the PDF anytime before the due dates.

• Template: Manuscript Templates for Conference Proceedings
• Submission site: EasyChair

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.

Please see International Journal on Networking and Computing(IJNC) for the details of submission.

• Speaker: Yuji Shinano (ZIB)
• Title: Massively Parallel Mixed Integer Programs (MIP) Solving: Towards Harnessing over a Million CPU Cores to Solve a Single MIP on Supercomputers
• Abstract: Mixed integer programming (MIP) problem is a general form to model combinatorial optimization problems and has many industrial applications. The performance of MIP solvers, software packages to solve MIPs, has improved tremendously in the last two decades and these solvers have been used to solve many real-word problems. However, against the backdrop of modern computer technology, parallelization is of pivotal importance. In this way, ParaSCIP, which uses an academic code SCIP as base MIP solver, and ParaXpress, which uses the commercial MIP solver Xpress, are the most successful parallel MIP solver in terms of solving previously unsolvable instances from the well-known benchmark instance set MIPLIB by using supercomputers. ParaSCIP has solved two instances from MIPLIB2003 and 12 from MIPLIB2010 for the first time to optimality by using up to 80,000 cores of supercomputers and ParaXpress has solved two open instances from MIPLIB2010. ParaSCIP and ParaXpress have been developed by using the Ubiquity Generator (UG) framework, which is a general software package to parallelize any state-of-the-art branch-and-bound based solver. Moreover, UG is being used to parallelize PIPS-SBB, a solver for stochastic MIPs. In this talk, we will introduce and show the ground design of UG framework and UG Synthesizer (UGS), which is a new framework to flexibly realize any combinations of algorithm portfolios and racing to solve MIPs on a distributed computing environment. They can instantiate a massively parallel MIP solver with the potential to harness over a million CPU cores to solve a single MIP on supercomputers.

• All dates are in UTC and submission must be done by 23:59PM in UTC.
• Abstract registration due: January 26, February 8, 2018 (extended)
• Full paper submission due: February 1, February 14, 2018 (extended)
• Notification: March 3, March 5, 2018
• Final manuscript due: March 16, March 23, 2018
• Author registration due: March 20, 2018

• Oscar H. Ibarra, University of California, Santa Barbara
• Koji Nakano, Hiroshima University

• Akihiro Fujiwara, Kyushu Institute of Technology
• Susumu Matsumae, Saga University

• Jacir Bordim, University of Brasília (UnB)
• Jens Breitbart, Bosch CC-DA
• Costas Busch, Lousiana State University
• Amlan Chatterjee, California State University, Dominguez Hills
• Gianlorenzo D'Angelo, Gran Sasso Science Institute (GSSI)
• Ajoy K. Datta, University of Nevada, Las Vegas
• Stéphane Devismes, VERIMAG UMR 5104
• Martti Forsell, VTT
• Sheikh Ghafoor, TTU
• Shuichi Ichikawa, Toyohashi University of Technology
• Fumihiko Ino, Osaka University
• Yasushi Inoguchi, JAIST
• Yasuaki Ito, Hiroshima University
• Chuzo Iwamoto, Hiroshima University
• Xiaohong Jiang, Future University Hakodate, Japan
• Hirotsugu Kakugawa, Osaka University
• Yoshiaki Katayama, Nagoya Institute of Technology
• Michihiro Koibuchi, National Institute of Informatics
• Anissa Lamani, Kyushu University
• Guoqiang Li, School of Software, Shanghai Jiao Tong University
• Yamin Li, Hosei University
• Loris Marchal, CNRS
• Ami Marowka Bar-Ilan, University
• Eiji Miyano, Kyushu Institute of Technology
• Sudeep Pasricha, Colorado State University
• Franck Petit, LiP6 CNRS-INRIA UPMC Sorbonne Universités
• Max Plauth, Hasso Plattner Institute
• Jonas Posner, Uni Kassel
• Lavanya Ramapantulu, International Institute of Information Technology, Hyderabad
• Nicola Santoro, Carleton University
• Gokarna Sharma, Kent State University
• Pradip Srimani, Clemson University
• Daniel Sun, CSIRO
• Yasuhiko Takenaga, The University of Electro-Communications
• Jerry Trahan, Louisiana State University, Baton Rouge
• Tatsuhiro Tsuchiya, Osaka University
• Jiangtao Yin, University of Massachusetts Amherst

Any inquiry concerning the workshop may be sent to apdcm18@cs.hiroshima-u.ac.jp.

• History of APDCM
• IJNC (International Journal of Networking and Computing)
• CANDAR (International Symposium on Computing and Networking)

 
<script type="text/javascript" id="clustrmaps" src="//cdn.clustrmaps.com/map_v2.js?cl=ffffff&w=300&t=n&d=6r59FZ-5IXV3vxT9UXfHvoeL1IFNwKNwQZxVnU1oNz8"></script>