88 search results - page 11 / 18 » Complexity of Data Dependence problems for Program Schemas w... |
TPDS
2002
13 years 7 months ago
2002
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
SC
2004
ACM
14 years 28 days ago
2004
ACM
Improving program locality has become increasingly important on modern computer systems. An effective strategy is to group computations on the same data so that once the data are ...
SMALLTALK
2007
Springer
14 years 1 months ago
2007
Springer
Concurrency control in Smalltalk is based on locks and is therefore notoriously difficult to use. Even though some implementations provide high-level constructs, these add complexi...
JPDC
2006
13 years 7 months ago
2006
Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an...
CPE
1994
Springer
13 years 11 months ago
1994
Springer
When implementingparallel programs forparallel computer systems the performancescalability of these programs should be tested and analyzed on different computer configurations and...