3516 search results - page 419 / 704 » Programming Languages: Application and Interpretation |
194
click to vote
DATE
2002
IEEE
15 years 11 months ago
2002
IEEE
The design of application (-domain) specific instructionset processors (ASIPs), optimized for code size, has traditionally been accompanied by the necessity to program assembly, ...
298
Voted
ASPLOS
2009
ACM
16 years 7 months ago
2009
ACM
Parallel bit stream algorithms exploit the SWAR (SIMD within a register) capabilities of commodity processors in high-performance text processing applications such as UTF8 to UTF-...
174
click to vote
PLDI
2010
ACM
16 years 4 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
170
click to vote
PLDI
2011
ACM
14 years 9 months ago
2011
ACM
The performance benefits of GPU parallelism can be enormous, but unlocking this performance potential is challenging. The applicability and performance of GPU parallelizations is...
187
click to vote
PLDI
2011
ACM
14 years 9 months ago
2011
ACM
In writing parallel programs, programmers expose parallelism and optimize it to meet a particular performance goal on a single platform under an assumed set of workload characteri...