2432 search results - page 100 / 487 » Using simple abstraction to reinvent computing for paralleli... |
JCC
2010
14 years 8 months ago
2010
Abstract: Modern graphics processing units (GPUs) are flexibly programmable and have peak computational throughput significantly faster than conventional CPUs. Herein, we describ...
IEEEPACT
2008
IEEE
15 years 4 months ago
2008
IEEE
The memory access limits the performance of stream processors. By exploiting the reuse of data held in the Stream Register File (SRF), an on-chip storage, the number of memory acc...
PDP
2008
IEEE
15 years 4 months ago
2008
IEEE
Scheduling for speculative parallelization is a problem that remained unsolved despite its importance. Simple methods such as Fixed-Size Chunking (FSC) need several ‘dry-runs’...
EGC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We describe the idea of a Science Gateway, an applicationspecific task wrapped as a web service, and some examples of these that are being implemented on the US TeraGrid...
APCSAC
2001
IEEE
15 years 1 months ago
2001
IEEE
Java bytecodes can be executed with the following three methods: a Java interpretor running on a particular machine interprets bytecodes; a Just-In-Time (JIT) compiler translates ...