Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 519

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Asynchronous Iterative Methods for Multiprocessors

Open access
Baudet, Gérard M.·1978·Journal of the ACM

Abstract

A class of asynchronous lterative methods is presented for solving a system of equations Exlstmg lteratwe methods are identified in terms of asynchronous iterations, and new schemes are introduced corresponding to a parallel implementation on a multiprocessor system with no synchronization between cooperating processes A suffloent condlnon is given to guarantee the convergence of any asynchronous iterations, and results are extended to include lteratlve methods with memory Asynchronous lteratlve methods are then evaluated from a computational point of view, and bounds are dertved for the efficiency The bounds are compared with actual measurements obtained by running various asynchronous iterations on a mulnprocessor, and the experimental results show clearly the advantage of purely, as~,nchronous lterattve methods KEY WORDS AND PHRASES asynchronous algorithms, asynchronous muhiprocessors, parallel algorithms, lteratwe methods, chaotic relaxation, analysis of algorithms CR CATE6ORIES 5 14, 5.15, 5 25 contracting operators (see, for example, [9, p. 433])In [2,6,8] the motivation of defining chaotic relaxation is to account for the parallel implementation of iterative methods on a multIprocessor system so as to reduce communication and synchronization between the cooperating processes.This reduction is obtained by not forcing the processes to follow a predetermined sequence of computations, but simply by allowing a process, when starting the evaluation of a new General permission to make fair use in teaching or research of all or part of this material is granted to lndwIdual readers and to nonprofit hbrarles acting for them provided that ACM's copyright notice is given and that reference Is made to the pubhcatlon, to its date of issue, and to the fact that reprinting privileges were granted by permission of the Association for Computing Machinery To otherwise reprint a figure, table, other substantial excerpt, or the entire work requires specific permission as does republication, or systematic or multiple reproduction

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/322063.322067

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 2 references

Cited by

See all 519

Metadata

Authors
Baudet, G. M.
Venue
Journal of the ACM
Published
1978-04
Volume
25
Issue
2
Pages
226-244
ISSN
  • 0004-5411 (ISSN-L)
  • 1557-735X
OpenAlex
W1978564754
Cited by
519
References
2
FWCI
7.20
Type
journal article
Language
en
Open access
bronze

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Asynchronous Iterative Methods for Multiprocessors. https://app.cochat.ai/papers/10.1145/322063.322067
The paper
Baudet, G. M. (1978). Asynchronous Iterative Methods for Multiprocessors. Journal of the ACM. https://doi.org/10.1145/322063.322067

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.