48 search results - page 2 / 10 » An ACO-Based Approach for Scheduling Task Graphs with Commun... |
DATE
2007
IEEE
13 years 11 months ago
2007
IEEE
We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders decomposition, our techniq...
DSN
2000
IEEE
13 years 9 months ago
2000
IEEE
In this paper, we propose new scheduling algorithms to achieve fault security in multiprocessor systems. We consider scheduling of parallel programs represented by directed acycli...
CP
2005
Springer
13 years 10 months ago
2005
Springer
This paper describes an efficient, complete approach for solving a complex allocation and scheduling problem for Multi-Processor System-on-Chip (MPSoC). Given a throughput constra...
IEEEPACT
1998
IEEE
13 years 9 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
EMSOFT
2005
Springer
13 years 10 months ago
2005
Springer
Abstract— This paper explores the problem of efficiently ordering interprocessor communication operations in both statically and dynamically-scheduled multiprocessors for iterat...