Parallelization of a bound-consistency enforcing procedure and its application in solving nonlinear systems

This paper considers incorporating a bound-consistency enforcing procedure to an interval branch-and-prune method. A heuristic to decide, when to use the developed operator, is proposed. As enforcing the bound-consistency is much more time consuming than performing other narrowing tools, we parallel...

Full description

Saved in:
Bibliographic Details
Published in:Journal of parallel and distributed computing 2017-09, Vol.107, p.57-66
Main Author: Kubica, Bartłomiej Jacek
Format: Article
Language:English
Subjects:
Big reader lock
Bound-consistency
Interval computations
MIC
Multithreaded programming
Nonlinear equations systems
Readers-writer lock
TBB
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper considers incorporating a bound-consistency enforcing procedure to an interval branch-and-prune method. A heuristic to decide, when to use the developed operator, is proposed. As enforcing the bound-consistency is much more time consuming than performing other narrowing tools, we parallelize the procedure, using Intel TBB. A few parallelization versions are considered. Also, this is a good opportunity to make a case-study of performance of various lock instances, implemented in the TBB package. Numerical results for typical benchmark problems are presented and analyzed. A specific lock version, proper for the application, is proposed. Performance on two architectures is considered: Intel Xeon and Intel Xeon Phi (MIC). •We describe incorporating bound-consistency enforcing into an interval solver.•We investigate a few versions of parallelization of this procedure.•Heuristics and policies for using the procedure are developed.•Numerical results on multi-core and many-core architectures are presented.
ISSN:0743-7315
1096-0848
DOI:10.1016/j.jpdc.2017.03.009