2703 search results - page 175 / 541 » Optimizing memory transactions |
213
Voted
VLDB
2006
ACM
16 years 2 months ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
140
click to vote
HIPC
2007
Springer
15 years 8 months ago
2007
Springer
Traditional directory-based cache coherence protocols suffer from long-latency cache misses as a consequence of the indirection introduced by the home node, which must be accessed...
110
click to vote
HPCC
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
125
click to vote
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
Parallel programming models should attempt to satisfy two conflicting goals. On one hand, they should hide architectural details so that algorithm designers can write simple, port...
120
click to vote
PADS
1996
ACM
15 years 6 months ago
1996
ACM
We investigate conservative parallel discrete event simulations for logical circuits on shared-memory multiprocessors. For a first estimation of the possible speedup, we extend th...