534 search results - page 48 / 107 » On Scheduling Parallel Tasks at Twilight |
186
Voted
CORR
2010
Springer
15 years 6 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...
143
click to vote
IPPS
2006
IEEE
15 years 12 months ago
2006
IEEE
In this paper, we propose a methodology for developing component-based real-time systems based on the concept of hierarchical scheduling. Recently, much work has been devoted to t...
154
click to vote
HCW
1998
IEEE
15 years 10 months ago
1998
IEEE
With the advent of large scale heterogeneous environments, there is a need for matching and scheduling algorithms which can allow multiple DAG-structured applications to share the...
156
click to vote
ASPLOS
2010
ACM
16 years 21 days ago
2010
ACM
To make efficient use of CMPs with tens to hundreds of cores, it is often necessary to exploit fine-grain parallelism. However, managing tasks of a few thousand instructions is ...
156
click to vote
IPPS
2007
IEEE
16 years 4 days ago
2007
IEEE
The general approach to fault tolerance in uniprocessor systems is to maintain enough time redundancy in the schedule so that any task instance can be re-executed in presence of f...