60 search results - page 6 / 12 » Communication Primitives for Minimally Synchronous Parallel ... |
IEEEPACT
2005
IEEE
14 years 20 days ago
2005
IEEE
Hiding communication latency is an important optimization for parallel programs. Programmers or compilers achieve this by using non-blocking communication primitives and overlappi...
IPPS
1994
IEEE
13 years 11 months ago
1994
IEEE
Synchronization primitives for large shared-memory multiprocessors need to minimize latency and contention. Software queue-based locks address these goals, but suffer if a process...
EGH
2009
Springer
13 years 4 months ago
2009
Springer
Stream compaction is a common parallel primitive used to remove unwanted elements in sparse data. This allows highly parallel algorithms to maintain performance over several proce...
ICS
1992
Tsinghua U.
13 years 11 months ago
1992
Tsinghua U.
CODE 2.0 is a graphical parallel programming system that targets the three goals of ease of use, portability, and production of efficient parallel code. Ease of use is provided by...
PARLE
1989
13 years 11 months ago
1989
We explore an algebraic language for networks consisting of a xed number of reactive units, communicating synchronously over a xed linking structure. The language has only two ope...