674 search results - page 52 / 135 » The computational complexity of the parallel knock-out probl... |
103
click to vote
CLUSTER
2001
IEEE
15 years 5 months ago
2001
IEEE
In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a po...
126
click to vote
ICDCS
1998
IEEE
15 years 5 months ago
1998
IEEE
Exceptions are one of the most pervasive problems in process support systems. In installations expected to handle a large number of processes, having exceptions is bound to be a n...
ISSAC
2007
Springer
15 years 7 months ago
2007
Springer
Supercomputing applications usually involve the repeated parallel application of discretized differential operators. Difficulties arise with higher-order discretizations of opera...
108
click to vote
PPAM
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. This paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard,...
114
click to vote
IPPS
1998
IEEE
15 years 5 months ago
1998
IEEE
Locally and functionally distributed applications realized on different system architectures demand a universal, portable and intuitive software utility for interprocess communica...