A Parallel Interval Computation Model with Alternative Message Passing
Wu, Yong, Kumar, A and Shi, Peng (2010) A Parallel Interval Computation Model with Alternative Message Passing. In: 2010 Second International Conference on Intelligent Human-Machine Systems and Cybernetics (IHMSC) 2010 : 26 - 28 Aug. 2010, Nanjing, Jiangsu, China, proceedings. IEEE Computer Society, Los Alamitos, California, pp. 120-123.
Abstract
In this paper, we propose a decentralized parallel computation model for global optimization using interval analysis. The model is adaptive to any number of processors and there is no need to design an initial decomposition scheme to feed each processor at the beginning. The work load is distributed evenly among all processors by alternative message passing. Numerical experiments indicate that the model works well and is stable with different number of parallel processors, distributes the load evenly among the processors, and provides an impressive speedup, especially when the problem is time-consuming to solve.
Dimensions Badge
Altmetric Badge
Item type | Book Section |
URI | https://vuir.vu.edu.au/id/eprint/10053 |
DOI | 10.1109/IHMSC.2010.129 |
Official URL | http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arn... |
ISBN | 9781424478699, 9780769541518 |
Subjects | Historical > Faculty/School/Research Centre/Department > Institute for Logistics and Supply Chain Management (ILSCM) Historical > FOR Classification > 0802 Computation Theory and Mathematics Historical > SEO Classification > 970108 Expanding Knowledge in the Information and Computing Sciences |
Keywords | ResPubID19961, message passing, optimisation, parallel processing, decentralized parallel interval computation model, global optimization problem, interval analysis, message passing, parallel processing, parallel processors, branch-and-bound, computation model, global optimization, interval analysis, parallel processing, computational modeling, load management, load modeling, message passing, numerical models, program processors |
Citations in Scopus | 0 - View on Scopus |
Download/View statistics | View download statistics for this item |