Results 1  10
of
32,437
Fast Parallel Algorithms for ShortRange Molecular Dynamics
 JOURNAL OF COMPUTATIONAL PHYSICS
, 1995
"... Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dyn ..."
Abstract

Cited by 653 (7 self)
 Add to MetaCart
Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular
Data parallel algorithms
 Communications of the ACM
, 1986
"... Parallel computers with tens of thousands of processors are typically programmed in a data parallel style, as opposed to the control parallel style used in multiprocessing. The success of data parallel algorithmseven on problems that at first glance seem inherently serialsuggests that this style ..."
Abstract

Cited by 287 (1 self)
 Add to MetaCart
Parallel computers with tens of thousands of processors are typically programmed in a data parallel style, as opposed to the control parallel style used in multiprocessing. The success of data parallel algorithmseven on problems that at first glance seem inherently serialsuggests that this style
A simple parallel algorithm for the maximal independent set problem
 SIAM Journal on Computing
, 1986
"... Simple parallel algorithms for the maximal independent set (MIS) problem are presented. The first algorithm is a Monte Carlo algorithm with a very local property. The local property of this algorithm may make it a useful protocol design tool in distributed computing environments and artificial intel ..."
Abstract

Cited by 450 (9 self)
 Add to MetaCart
Simple parallel algorithms for the maximal independent set (MIS) problem are presented. The first algorithm is a Monte Carlo algorithm with a very local property. The local property of this algorithm may make it a useful protocol design tool in distributed computing environments and artificial
Programming Parallel Algorithms
, 1996
"... In the past 20 years there has been treftlendous progress in developing and analyzing parallel algorithftls. Researchers have developed efficient parallel algorithms to solve most problems for which efficient sequential solutions are known. Although some ofthese algorithms are efficient only in a th ..."
Abstract

Cited by 237 (11 self)
 Add to MetaCart
In the past 20 years there has been treftlendous progress in developing and analyzing parallel algorithftls. Researchers have developed efficient parallel algorithms to solve most problems for which efficient sequential solutions are known. Although some ofthese algorithms are efficient only in a
Parallel Algorithms for Hierarchical Clustering
 Parallel Computing
, 1995
"... Hierarchical clustering is a common method used to determine clusters of similar data points in multidimensional spaces. O(n 2 ) algorithms are known for this problem [3, 4, 10, 18]. This paper reviews important results for sequential algorithms and describes previous work on parallel algorithms f ..."
Abstract

Cited by 113 (2 self)
 Add to MetaCart
Hierarchical clustering is a common method used to determine clusters of similar data points in multidimensional spaces. O(n 2 ) algorithms are known for this problem [3, 4, 10, 18]. This paper reviews important results for sequential algorithms and describes previous work on parallel algorithms
Parallel Algorithms
"... Parallel computing has undergone a stunning evolution, with high points (e.g., being able to solve many of the grandchallenge computational problems outlined in the 80’s) and low points (e.g., the demise of countless parallel computer vendors). Today, parallel computing is omnipresent across a la ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
Parallel computing has undergone a stunning evolution, with high points (e.g., being able to solve many of the grandchallenge computational problems outlined in the 80’s) and low points (e.g., the demise of countless parallel computer vendors). Today, parallel computing is omnipresent across a
Direct BulkSynchronous Parallel Algorithms
 JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
, 1992
"... We describe a methodology for constructing parallel algorithms that are transportable among parallel computers having different numbers of processors, different bandwidths of interprocessor communication and different periodicity of global synchronisation. We do this for the bulksynchronous paralle ..."
Abstract

Cited by 174 (27 self)
 Add to MetaCart
We describe a methodology for constructing parallel algorithms that are transportable among parallel computers having different numbers of processors, different bandwidths of interprocessor communication and different periodicity of global synchronisation. We do this for the bulk
PARALLEL ALGORITHMS FOR
, 1992
"... I would like to acknowledge the guidance and support of my advisor, Professor Meghanad D. Wagh. This thesis was possible because of his patience and great knowledge. I would also like thank to all my friends in Lehigh University. iii ..."
Abstract
 Add to MetaCart
I would like to acknowledge the guidance and support of my advisor, Professor Meghanad D. Wagh. This thesis was possible because of his patience and great knowledge. I would also like thank to all my friends in Lehigh University. iii
Parallel Algorithms
"... The world’s data is growing at exponential rates. To deal with this glut of information, computer systems must be able to understand and interpret data in ways that provide their users with practical knowledge [1]. To process ever increasing data sets, often, ..."
Abstract
 Add to MetaCart
The world’s data is growing at exponential rates. To deal with this glut of information, computer systems must be able to understand and interpret data in ways that provide their users with practical knowledge [1]. To process ever increasing data sets, often,
Constructive interference in parallel algorithms
 SIAM Journal of Numerical Analysis
, 1988
"... Abstract. Parallel algorithms are developed in the setting of iterative multilevel methods. The constituent parts of the algorithms are dependent rather than independent as in conventional parallel algorithms. We develop cases and conditions wherein this dependence generates a constructive interfere ..."
Abstract

Cited by 15 (10 self)
 Add to MetaCart
Abstract. Parallel algorithms are developed in the setting of iterative multilevel methods. The constituent parts of the algorithms are dependent rather than independent as in conventional parallel algorithms. We develop cases and conditions wherein this dependence generates a constructive
Results 1  10
of
32,437