3656 search results - page 101 / 732 » Parallel programming in Split-C |
134
click to vote
PPOPP
1999
ACM
15 years 6 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
112
Voted
ACSC
2008
IEEE
15 years 8 months ago
2008
IEEE
In the future, if we are to continue to expect improved application performance we will have to achieve it by exploiting course-grained hardware parallelism rather then simply rel...
130
click to vote
IPPS
2005
IEEE
15 years 8 months ago
2005
IEEE
With the increasing availability of high-performance massively parallel computer systems, the prevalence of sophisticated scientific simulation has grown rapidly. The complexity ...
129
click to vote
POPL
2012
ACM
13 years 10 months ago
2012
ACM
We present an analysis which takes as its input a sequential program, augmented with annotations indicating potential parallelization opportunities, and a sequential proof, writte...
111
click to vote
IPPS
2000
IEEE
15 years 6 months ago
2000
IEEE
Tuning parallel applications requires the use of effective tools for detecting performance bottlenecks. Along a parallel program execution, many individual situations of performan...