148 search results - page 30 / 30 » Exploiting Parallelism for Hard Problems in Abstract Argumen... |
MICRO
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract-- We consider the problem of how to improve memory latency tolerance in massively multithreaded GPGPUs when the thread-level parallelism of an application is not sufficien...
103
click to vote
INFOCOM
2011
IEEE
14 years 2 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
93
Voted
HIPC
2003
Springer
15 years 3 months ago
2003
Springer
Abstract— In this work, we demonstrate the power of providing a common set of operating system services to Grid Architectures, including high-performance I/O, communication, reso...