2438 search results - page 95 / 488 » Scheduling problems for parallel and distributed systems |
120
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 ...
127
click to vote
JSA
1998
15 years 4 months ago
1998
In this paper, we present a network conscious approach to designing distributed real-time systems. Given a task graph design of the system, the end-to-end constraints on the input...
119
click to vote
SRDS
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, we argue that the reliability of large-scale storage systems can be significantly improved by using better reliability metrics and more efficient policies for rec...
166
click to vote
ISPDC
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract— In this article, we propose a fully distributed algorithm for finding all primes in an given interval [2..n] (or (L, R), more generally), based on the SMER — Schedul...
117
click to vote
HPDC
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper investigates the scheduling of mixed-parallel applications, which exhibit both task and data parallelism, in advance reservations settings. Both the problem of minimizi...