182 search results - page 19 / 37 » Benchmarking the Task Graph Scheduling Algorithms |
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
PATAT
2000
Springer
15 years 1 months ago
2000
Springer
Abstract The Examination Timetabling problem regards the scheduling for the exams of a set of university courses, avoiding the overlapping of exams having students in common, fairl...
107
click to vote
ISPAN
2002
IEEE
15 years 2 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
APPT
2007
Springer
15 years 3 months ago
2007
Springer
It is a great challenge to map network processing tasks to processing resources of advanced network processors, which are heterogeneous and multi-threading multiprocessor System-on...
HCW
1999
IEEE
15 years 1 months ago
1999
IEEE
A major challenge in Metacomputing Systems (Computational Grids) is to effectively use their shared resources, such as compute cycles, memory, communication network, and data repo...