4198 search results - page 26 / 840 » Data Parallel Program Design |
PPOPP
1999
ACM
15 years 2 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...
EPIA
1999
Springer
15 years 2 months ago
1999
Springer
YapOr is an or-parallel system that extends the Yap Prolog system to exploit implicit or-parallelism in Prolog programs. It is based on the environment copying model, as first imp...
IEEEPACT
2005
IEEE
15 years 3 months ago
2005
IEEE
We describe the design, generation and compression of the extended whole program path (eWPP) representation that not only captures the control flow history of a program execution...
ACSC
2008
IEEE
15 years 4 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...
LCPC
2007
Springer
15 years 4 months ago
2007
Springer
The use of multiprocessor tasks (M-tasks) has been shown to be successful for mixed task and data parallel implementations of algorithms from scientific computing. The approach o...