822 search results - page 97 / 165 » Contention in shared memory algorithms |
141
Voted
ICPP
2006
IEEE
15 years 8 months ago
2006
IEEE
This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploi...
113
click to vote
IPPS
2005
IEEE
15 years 8 months ago
2005
IEEE
With the latest high-end computing nodes combining shared-memory multiprocessing with hardware multithreading, new scheduling policies are necessary for workloads consisting of mu...
141
Voted
CODES
2007
IEEE
15 years 8 months ago
2007
IEEE
Caches are notorious for their unpredictability. It is difficult or even impossible to predict if a memory access results in a definite cache hit or miss. This unpredictability i...
155
click to vote
AAAI
2000
15 years 3 months ago
2000
Researchers in the ontology-design field have developed the content for ontologies in many domain areas. Recently, ontologies have become increasingly common on the WorldWide Web ...
106
Voted
SPAA
1998
ACM
15 years 6 months ago
1998
ACM
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...