Skip to search formSkip to main contentSkip to account menu

Parallel programming model

In computing, a parallel programming model is an abstraction of parallel computer architecture, with which it is convenient to express algorithms and… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Abstraction (software engineering)Actor modelAlgorithmic skeletonApache Giraph

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Prospector : A Dynamic Data-Dependence Profiler To Help Parallel Programming
Multiprocessor architectures are increasingly common these days. In order to fully and efficiently utilize the abundant hardware… 
Highly Cited
2007
Highly Cited
2007
Skeleton-based parallel programming: Functional and parallel semantics in a single shot
2007
2007
PARALLEL-TCOFFEE: A parallel multiple sequence aligner
A method and composition for controlling odor emission from toilet holding tanks for prolonged intervals of at least 48 hours… 
Highly Cited
2003
Highly Cited
2003
Hybrid Parallel Programming: Performance Problems and Chances
Summary Most HPC systems are clusters of shared memory nodes. Parallel programming must combine the distributed memory… 
1996
1996
ICA PERFORMING OUT-OF-CORE FFTS ON PARALLEL DISK SYSTEMS
The Fast Fourier Transform (FFT) plays a key role in many areas of computational science and engineering. Although most one… 
1996
1996
An analysis of fault partitioned parallel test generation
Generation of test vectors for the VLSI devices used in contemporary digital systems is becoming much more difficult as these… 
1994
1994
The Charm Parallel Programming Language and System: Part I - Description of Language Features
A load cell has a ring shaped deformation element with a triangular cross section, the apex of the cross section extending… 
1993
1993
Interprocedural analyses for programming environments
To investigate interprocedural parallelization, powerful interprocedural analyses were designed and implemented in PIPS, an… 
Highly Cited
1991
Highly Cited
1991
Fully parallelized multi prover protocols for NEXP-time
A major open problem in the theory of multiprover protocols is to characterize the languages which can be accepted by fully… 
Highly Cited
1988
Highly Cited
1988
Parallel Approximation Algorithms for Bin Packing
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)