BIP! Finder - Revisiting Asynchronous Linear Solvers: Provable Convergence Rate through Randomization

2014 • Revisiting Asynchronous Linear Solvers: Provable Convergence Rate through Randomization

Authors: Anshul Gupta; Haim Avron; Alex Druinsky

Venue: 2014 IEEE 28th International Parallel and Distributed Processing Symposium

Type: Publication

Abstract: Asynchronous methods for solving systems of linear equations have been researched since Chazan and Miranker's [1969] pioneering paper on chaotic relaxation. The underlying idea of asynchronous methods is to avoid processor idle time by allowing the processors to continue to make progress even if not all progress made by other processors has been communicated to them. Historically, the applicability of asynchronous methods for solving linear equations has been limited to certain restricted classes of matrices, such as diagonally dominant matrice... (read more)

Impact:

1.7977023E-8 6.438417E-9 41 10

/ Attention: 0 29

Topics: Theoretical computer science Parallel computing Algorithm

DOI: 10.1145/2814566

External links: Crossref OpenAIRE

Found 3 versions BibTex PDF

Topic-specific impact indicators

Popularity:
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
Influence:
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
Citation Count:
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
Impulse:
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.