721 search results - page 63 / 145 » Exploiting Meta-Level information in a Distributed Schedulin... |
IPPS
1996
IEEE
14 years 27 days ago
1996
IEEE
Many irregular scientific computing problems can be modeled by directed acyclic task graphs (DAGs). In this paper, we present an efficient run-time system for executing general as...
COMPSAC
2002
IEEE
14 years 1 months ago
2002
IEEE
Services for locating mobile objects are often organized as a distributed search tree. The advantage of such an organization is that the service can easily scale as a distributed ...
ICPPW
2006
IEEE
14 years 2 months ago
2006
IEEE
Abstract— Most image processing applications are characterized by computation-intensive operations, and high memory and performance requirements. Parallelized implementation on s...
COCOON
2007
Springer
14 years 21 days ago
2007
Springer
This paper deals with problems which fall into the domain of selfish scheduling: a protocol is in charge of building a schedule for a set of tasks without directly knowing their l...
CONCUR
2009
Springer
14 years 3 months ago
2009
Springer
We present a compositional method for deriving control constraints on a network of interconnected, partially observable and partially controllable plant components. The constraint ...