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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of parallel and distributed computing Jg. 107; S. 57 - 66
1. Verfasser: Kubica, Bartłomiej Jacek
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Inc 01.09.2017
Schlagworte:
ISSN:0743-7315, 1096-0848
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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