Skip to search formSkip to main contentSkip to account menu

Data parallelism

Known as: Data level parallelism, Data-parallelism, Data-level parallelism 
Data parallelism is a form of parallelization across multiple processors in parallel computing environments. It focuses on distributing the data… 
Wikipedia (opens in a new tab)

Related topics

Related topics

42 relations
APLActive messageAlliant Computer SystemsApache Flink

Broader (1)

Parallel computing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
SPATL: Honey, I Shrunk the Coherence Directory
One of the key scalability challenges of on-chip coherence in a multicore chip is the coherence directory, which provides… 
Highly Cited
2008
Highly Cited
2008
Xetal-II: A 107 GOPS, 600 mW Massively Parallel Processor for Video Scene Analysis
Xetal-II is a single-instruction multiple-data (SIMD) processor with 320 processing elements. It delivers a peak performance of… 
Highly Cited
2001
Highly Cited
2001
A compiler framework for mapping applications to a coarse-grained reconfigurable computer architecture
The rapid growth of silicon densities has made it feasible to deploy reconfigurable hardware as a highly parallel computing… 
2000
2000
Parallel Processor Configuration Design with Processing/Transmission Costs
A computer configuration design problem where the objective is to configure a parallel processor to do processing in a cost… 
Highly Cited
1998
Highly Cited
1998
Approaches for integrating task and data parallelism
Languages that support task and data parallelism are highly general and can exploit both forms of parallelism in a single… 
1998
1998
Parallelization via context preservation
Abstract program schemes, such as scan or homomorphism, can capture a wide range of data parallel programs. While versatile… 
Highly Cited
1993
Highly Cited
1993
On the relation between functional and data parallel programming languages
Per Hammarlund~ and Bjorn Lisper tSANS—Studies of Artificial Neural Systems NADA—Department or Numerical Analysis and Computing… 
1992
1992
Efficient Matrix Multiplication on SIMD Computers
Efficient algorithms are described for matrix multiplication on SIMD computers. SIMD implementations of Winograd’s algorithm are… 
Highly Cited
1991
Highly Cited
1991
Fast rotation of volume data on parallel architectures
An algorithm for rendering of orthographic views of volume data on data-parallel computer architectures is described. In… 
Highly Cited
1988
Highly Cited
1988
Compiling C* programs for a hypercube multicomputer
A data parallel language such as C* has a number of advantages over conventional hypercube programming languages. The algorithm… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)