4198 search results - page 724 / 840 » Data Parallel Program Design |
146
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
121
Voted
ALGORITHMICA
2006
15 years 2 months ago
2006
Our goal is to develop a robust out-of-core sorting program for a distributed-memory cluster. The literature contains two dominant paradigms for out-of-core sorting algorithms: me...
104
click to vote
HPCA
2006
IEEE
16 years 2 months ago
2006
IEEE
Transactional memory (TM) simplifies parallel programming by guaranteeing that transactions appear to execute atomically and in isolation. Implementing these properties includes p...
130
Voted
ICCD
2006
IEEE
15 years 11 months ago
2006
IEEE
Pointer bugs associated with dynamically-allocated objects resulting in out-of-bounds memory access are an important class of software bugs. Because such bugs cannot be detected e...
136
Voted
ISPAN
2009
IEEE
15 years 9 months ago
2009
IEEE
— Scientific computing often requires the availability of a massive number of computers for performing large scale experiments. Traditionally, these needs have been addressed by ...