674 search results - page 40 / 135 » The computational complexity of the parallel knock-out probl... |
244
click to vote
PODC
2011
ACM
14 years 8 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
155
click to vote
HIPC
2004
Springer
15 years 11 months ago
2004
Springer
This paper summarizes the design and implementation of a parallel algorithm for state assignment of large Finite State Machines (FSMs). High performance CAD tools are necessary to...
201
click to vote
EUROPAR
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Today’s parallel computers with SMP nodes provide both multithreading and message passing as their modes of parallel execution. As a consequence, performance analysis a...
184
click to vote
CCGRID
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract-- The development of high performance parallel applications for clusters is considered a complex task. This can happen because the influence of the execution environment a...
141
click to vote
SC
1991
ACM
15 years 9 months ago
1991
ACM
In cache based multiprocessors a protocol must maintain coherence among replicated copies of shared writable data. In delayed consistency protocols the effect of out-going and in-...