1993 search results - page 283 / 399 » Designing and Building Parallel Program |
147
Voted
TPDS
2002
15 years 2 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...
133
click to vote
HPCA
2011
IEEE
14 years 6 months ago
2011
IEEE
Most shared memory systems maximize performance by unpredictably resolving memory races. Unpredictable memory races can lead to nondeterminism in parallel programs, which can suff...
157
click to vote
HPCA
2011
IEEE
14 years 6 months ago
2011
IEEE
Contention management is an important design component to a transactional memory system. Without effective contention management to ensure forward progress, a transactional memory...
123
click to vote
EDBT
1990
ACM
15 years 6 months ago
1990
ACM
Deductive Databases are coming of age with the emergence of efficient and easy to use systems that support queries, reasoning, and application development on databases through dec...
119
click to vote
ICFP
2010
ACM
15 years 3 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...