1996
DOI: 10.1007/bf00161572
|View full text |Cite
|
Sign up to set email alerts
|

A review of parallel processing for statistical computation

Abstract: Parallel computers differ from conventional serial computers in that they can, in a variety of ways, perform more than one operation at a time. Parallel processing, the application of parallel computers, has been successfully utilized in many fields of science and technology. The purpose of this paper is to review efforts to use parallel processing for statistical computing. We present some technical background, followed by a review of the literature that relates parallel computing to statistics. The review ma… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0

Year Published

1998
1998
2021
2021

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(10 citation statements)
references
References 37 publications
0
10
0
Order By: Relevance
“…The possibility of parallel processing has long been recognized by statisticians in carrying out computing intensive methods (Sylwestrowicz 1982;Schervish 1988;Adams et al 1996). For applications such as bootstrapping and kriging, algorithms can be "embarrassingly parallel" (Rossini et al 2003), since no inter-processor communication is needed.…”
Section: Introductionmentioning
confidence: 99%
“…The possibility of parallel processing has long been recognized by statisticians in carrying out computing intensive methods (Sylwestrowicz 1982;Schervish 1988;Adams et al 1996). For applications such as bootstrapping and kriging, algorithms can be "embarrassingly parallel" (Rossini et al 2003), since no inter-processor communication is needed.…”
Section: Introductionmentioning
confidence: 99%
“…There have been earlier reviews in parallel statistical computing (e.g., Adams et al 1996), so we have aimed to review only the last decade. We have reviewed the use of parallel statistical computation, particularly in linear and nonlinear regression, density estimation, Markov-chain Monte Carlo methods, and methods involving SDEs.…”
Section: Conclusion and Discussionmentioning
confidence: 99%
“…PDP is architecturally and algorithmically more complex than meta-analysis, and cannot be easily implemented in distributed networks with independently operating instances of programs like SAS because a centralized algorithm must manage estimation convergence across all sites. 37 With this approach, regression parameter estimates are collected at every iteration and a new candidate vector of coefficients is generated for testing and correction at each site until estimations converge. These methods are not redundant, as GLORE and related parallel distributed methods can increase power if data are statistically homogeneous across all sites, 37 , 38 while meta-regression methods like OCEANS compute independently estimated models and are most appropriate if data are not identically distributed at all sites.…”
Section: Methods and Approachmentioning
confidence: 99%