674 search results - page 30 / 135 » The computational complexity of the parallel knock-out probl... |
118
click to vote
ESWS
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The current state of the art regarding scalable reasoning consists of programs that run on a single machine. When the amount of data is too large, or the logic is too com...
117
click to vote
CLUSTER
2001
IEEE
15 years 5 months ago
2001
IEEE
This paper presents Clusterfile, a parallel file system that provides parallel file access on a cluster of computers. Existing parallel file systems offer little control over matc...
113
click to vote
STACS
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
122
click to vote
ICDCS
2009
IEEE
15 years 10 months ago
2009
IEEE
With the growing complexity in computer systems, it has been a real challenge to detect and diagnose problems in today’s large-scale distributed systems. Usually, the correlatio...
105
click to vote
IEEEPACT
2006
IEEE
15 years 7 months ago
2006
IEEE
A recent trend in computing are domain-specific program generators, designed to alleviate the effort of porting and reoptimizing libraries for fast-changing and increasingly com...