16128 search results - page 420 / 3226 » Distributed network scheduling |
135
click to vote
CIA
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. In this paper we investigate methods for analyzing the expected value of adding information in distributed task scheduling problems. As scheduling problems are NP-complet...
156
click to vote
HPCC
2007
Springer
15 years 11 months ago
2007
Springer
Advance Reservations(AR) make it possible to guarantee the QoS of Grid applications by reserving a particular resource capability over a defined time interval on local resources. H...
148
click to vote
ICPP
2005
IEEE
15 years 10 months ago
2005
IEEE
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
125
click to vote
IPPS
2005
IEEE
15 years 10 months ago
2005
IEEE
— Schedule synthesis based on reachability analysis of timed automata has received attention in the last few years. The main strength of this approach is that the expressiveness ...
152
click to vote
IPPS
2005
IEEE
15 years 10 months ago
2005
IEEE
We propose a cluster-based web server where a few computing nodes are separately reserved for high-performance computing applications, such as multimedia, SSL, and CGI. As an exam...