628 search results - page 88 / 126 » Tying Memory Management to Parallel Programming Models |
122
click to vote
ISPASS
2009
IEEE
15 years 5 months ago
2009
IEEE
Modern Graphic Processing Units (GPUs) provide sufficiently flexible programming models that understanding their performance can provide insight in designing tomorrow’s manyco...
ACG
2009
Springer
15 years 4 months ago
2009
Springer
With the recent success of Monte-Carlo tree search algorithms in Go and other games, and the increasing number of cores in standard CPUs, the efficient parallelization of the sear...
80
Voted
FPL
2001
Springer
15 years 2 months ago
2001
Springer
This paper presents new achievements on the automatic mapping of algorithms, written in imperative software programming languages, to custom computing machines. The reconfigurable ...
HPCA
2007
IEEE
15 years 10 months ago
2007
IEEE
With the advent of ubiquitous multi-core architectures, a major challenge is to simplify parallel programming. One way to tame one of the main sources of programming complexity, n...
ASPLOS
2010
ACM
15 years 5 months ago
2010
ACM
To make efficient use of CMPs with tens to hundreds of cores, it is often necessary to exploit fine-grain parallelism. However, managing tasks of a few thousand instructions is ...