2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS) 2016
DOI: 10.1109/ipdps.2016.66
|View full text |Cite
|
Sign up to set email alerts
|

A Relaxed Synchronization Approach for Solving Parallel Quadratic Programming Problems with Guaranteed Convergence

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
3
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 8 publications
0
3
0
Order By: Relevance
“…However, due to the degraded numerical accuracy of standard schemes with asynchrony, alternate approaches are needed for asynchronous computations such that numerical errors incurred are minimal. While asynchronous computations have been utilized successfully for iterative linear solvers [17][18][19][20], some of the early work in asynchronous simulations of partial differential equations (PDEs) is limited to simple canonical equations in one-dimension. In [21][22][23] the governing equation is modified apriori to offset the effect of asynchrony on the numerical solution.…”
Section: Introductionmentioning
confidence: 99%
“…However, due to the degraded numerical accuracy of standard schemes with asynchrony, alternate approaches are needed for asynchronous computations such that numerical errors incurred are minimal. While asynchronous computations have been utilized successfully for iterative linear solvers [17][18][19][20], some of the early work in asynchronous simulations of partial differential equations (PDEs) is limited to simple canonical equations in one-dimension. In [21][22][23] the governing equation is modified apriori to offset the effect of asynchrony on the numerical solution.…”
Section: Introductionmentioning
confidence: 99%
“…However, due to the degraded numerical accuracy of standard schemes with asynchrony, alternate approaches are needed for asynchronous computations such that numerical errors incurred are minimal. While asynchronous computations have been utilized successfully for iterative linear solvers [17,18,19,20], some of the early work in asynchronous simulations of partial differential equations (PDEs) is limited to simple canonical equations in one-dimension. In [21,22,23] the governing equation is modified apriori to offset the effect of asynchrony on the numerical solution.…”
Section: Introductionmentioning
confidence: 99%
“…Although Bertsekas [3] introduced a sufficient condition for the stability of general asynchronous fixed-point iterations (see chapter 6.2), which is equivalent to a diagonal dominance condition for QP problems, this condition is known to be very strong and thus conservative, according to the literature [22]. More recently, a periodic synchronization method has been developed in [19,16,14]. The key idea is that each node communicates with other nodes at a certain period, instead of synchronizing the data at each iteration step.…”
Section: Introductionmentioning
confidence: 99%