10805 search results - page 283 / 2161 » Mapping Computation with No Memory |
162
click to vote
ANCS
2007
ACM
15 years 10 months ago
2007
ACM
Due to the advantages of easy re-configurability and scalability, the memory-based string matching architecture is widely adopted by network intrusion detection systems (NIDS). In...
170
click to vote
SPAA
1996
ACM
15 years 10 months ago
1996
ACM
In this paper, we analyze the performance of parallel multithreaded algorithms that use dag-consistent distributed shared memory. Specifically, we analyze execution time, page fau...
193
Voted
ICPADS
2006
IEEE
16 years 21 days ago
2006
IEEE
Symmetric Multiprocessors (SMPs), combined with modern interconnection technologies are commonly used to build cost-effective compute clusters. However, contention among processor...
179
click to vote
HIPC
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Simple and unified non-operational specifications of the three memory consistency models Total Store Ordering (TSO), Partial Store Ordering (PSO), and Relaxed Memory Orde...
162
click to vote
ICAC
2009
IEEE
16 years 1 months ago
2009
IEEE
We apply the concept of “games with a purpose” to NPcomplete mapping and scheduling problems in distributed systems and report our experiences. The particular context is a sch...