674 search results - page 24 / 135 » The computational complexity of the parallel knock-out probl... |
166
click to vote
CPE
1994
Springer
15 years 5 months ago
1994
Springer
When implementingparallel programs forparallel computer systems the performancescalability of these programs should be tested and analyzed on different computer configurations and...
PODC
2005
ACM
15 years 6 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
MFCS
2004
Springer
15 years 6 months ago
2004
Springer
We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...
111
click to vote
ICDCS
2010
IEEE
15 years 1 months ago
2010
IEEE
—In this paper, we classify multitolerant systems, i.e., systems that tolerate multiple classes of faults and provide potentially different levels of tolerance to them in terms o...
103
click to vote
CCGRID
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper we present a multicost algorithm for the joint time scheduling of the communication and computation resources that will be used by a task. The proposed algorithm sel...