1257 search results - page 120 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
133
click to vote
MOBIHOC
2008
ACM
16 years 1 months ago
2008
ACM
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...
102
Voted
ICPP
2003
IEEE
15 years 7 months ago
2003
IEEE
In this paper we propose an efficient parallel algorithm with simple static and dynamic scheduling for generating combinations. It can use any number of processors (NP ≤ n − ...
130
Voted
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
Abstract. Nowadays genetic algorithms stand as a trend to solve NPcomplete and NP-hard problems. In this paper, we present a new hybrid metaheuristic which uses Parallel Genetic Al...
122
Voted
ICPP
1999
IEEE
15 years 6 months ago
1999
IEEE
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
107
click to vote
ISCAPDCS
2007
15 years 3 months ago
2007
We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the...