3656 search results - page 296 / 732 » Parallel programming in Split-C |
171
click to vote
ECOOPW
1998
Springer
15 years 11 months ago
1998
Springer
It is our opinion that declaring aspects by means of a full- edged logic language has a fundamental advantage over using a restricted special purpose aspect language. As an illust...
156
click to vote
HPDC
1996
IEEE
15 years 10 months ago
1996
IEEE
The performance of the Global Array shared-memory nonuniform memory-access programming model is explored on the I-WAY, wide-area-network distributed supercomputer environment. The...
190
click to vote
PPSN
1994
Springer
15 years 10 months ago
1994
Springer
Abstract. The mutation distribution of evolutionary algorithms usually is oriented at the type of the search space. Typical examples are binomial distributions for binary strings i...
169
click to vote
PPOPP
2010
ACM
16 years 3 months ago
2010
ACM
Transactional memory promises to make parallel programming easier than with fine-grained locking, while performing just as well. This performance claim is not always borne out bec...
152
click to vote
FOSSACS
2010
Springer
16 years 1 months ago
2010
Springer
For many application-level distributed protocols and parallel algorithms, the set of participants, the number of messages or the interaction structure are only known at run-time. T...