3148 search results - page 221 / 630 » On the Dynamic Initialization of Parallel Computers |
150
click to vote
CONCUR
2008
Springer
15 years 5 months ago
2008
Springer
We present an algorithm for partial order reduction in the context of a countable universe of deterministic actions, of which finitely many are enabled at any given state. This mea...
137
Voted
CCGRID
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorit...
151
Voted
PPSN
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. There is a variety of methods for ranking objectives in multiobjective optimization and some are difficult to define because they require information a priori (e.g. esta...
138
Voted
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
Transactional memory is an alternative programming model for managing contention in accessing shared in-memory data objects. Distributed transactional memory (TM) promises to alle...
160
click to vote
HPCA
2012
IEEE
13 years 11 months ago
2012
IEEE
The least recently used (LRU) replacement policy performs poorly in the last-level cache (LLC) because temporal locality of memory accesses is filtered by first and second level...