1605 search results - page 17 / 321 » Designing Parallel Operating Systems via Parallel Programmin... |
PPOPP
2009
ACM
15 years 5 months ago
2009
ACM
Abstract. Transactional memory (TM) promises to simplify construction of parallel applications by allowing programmers to reason about interactions between concurrently executing c...
PPOPP
2003
ACM
15 years 3 months ago
2003
ACM
In an intelligent memory architecture, the main memory of a computer is enhanced with many simple processors. The result is a highly-parallel, heterogeneous machine that is able t...
SPAA
2006
ACM
15 years 4 months ago
2006
ACM
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...
105
click to vote
CODES
2010
IEEE
14 years 7 months ago
2010
IEEE
In high-level synthesis, pipelined designs are often restricted by the number of memory banks available to the synthesis system. Using multiple memory banks can improve the perfor...
PARELEC
2006
IEEE
15 years 4 months ago
2006
IEEE
High performance computing in heterogeneous environments is a dynamically developing area. A number of highly efficient heterogeneous parallel algorithms have been designed over l...