1. Parallel construction of explicit boundaries using support vector machines
- Author
-
Anirban Basudhar, Samy Missoum, and Ke Lin
- Subjects
Theoretical computer science ,Speedup ,Computer science ,Reliability (computer networking) ,General Engineering ,Binary number ,Boundary (topology) ,Parallel computing ,Computer Science Applications ,Support vector machine ,Automatic parallelization ,Range (mathematics) ,Computational Theory and Mathematics ,Parallel processing (DSP implementation) ,Software - Abstract
Purpose – The purpose of this paper is to present a study of the parallelization of the construction of explicit constraints or limit‐state functions using support vector machines. These explicit boundaries have proven to be beneficial for design optimization and reliability assessment, especially for problems with large computational times, discontinuities, or binary outputs. In addition to the study of the parallelization, the objective of this article is also to provide an approach to select the number of processors.Design/methodology/approach – This article investigates the parallelization in two ways. First, the efficiency of the parallelization is assessed by comparing, over several runs, the number of iterations needed to create an accurate boundary to the number of iterations associated with a theoretical “linear” speedup. Second, by studying these differences, an “appropriate” range of parallel processors can be inferred.Findings – The parallelization of the construction of explicit boundaries ca...
- Published
- 2012
- Full Text
- View/download PDF