58 search results - page 9 / 12 » Fast Optimal Task Graph Scheduling by Means of an Optimized ... |
144
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
127
click to vote
HICSS
1995
IEEE
15 years 6 months ago
1995
IEEE
Abstract. We reexamine the limits of parallelism available in programs, using runtime reconstruction of program data-flow graphs. While limits of parallelism have been examined in...
147
Voted
HPDC
1998
IEEE
15 years 7 months ago
1998
IEEE
In this paper we present a model for dynamically scheduling HTTP requests across clusters of servers, optimizing the use of client resources as well as the scattered server nodes....
116
Voted
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
Earlier work has developed the underpinnings of IC-Scheduling Theory, an algorithmic framework for scheduling computations having intertask dependencies for Internet-based computi...
141
Voted
TEC
2002
15 years 2 months ago
2002
Abstract--In this paper, we present an efficient graph-based evolutionary optimization technique called evolutionary graph generation (EGG) and the proposed approach is applied to ...