6542 search results - page 342 / 1309 » The tao of parallelism in algorithms |
151
click to vote
JCC
2010
15 years 5 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...
173
click to vote
SPIRE
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expression...
179
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
This paper focuses on reducing memory usage in enumerative model checking, while maintaining the multi-core scalability obtained in earlier work. We present a multi-core tree-based...
190
click to vote
PPOPP
2010
ACM
16 years 1 months ago
2010
ACM
In processors with several levels of hardware resource sharing, like CMPs in which each core is an SMT, the scheduling process becomes more complex than in processors with a singl...
188
click to vote
ISCAS
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— Several network security and QoS applications require detecting multiple string matches in the packet payload by comparing it against predefined pattern set. This proc...