Sciweavers

904 search results - page 83 / 181
» Scheduling task graphs optimally with A
Sort
View
CODES
2003
IEEE
14 years 2 months ago
Design optimization of mixed time/event-triggered distributed embedded systems
Distributed embedded systems implemented with mixed, eventtriggered and time-triggered task sets, which communicate over bus protocols consisting of both static and dynamic phases...
Traian Pop, Petru Eles, Zebo Peng
EOR
2007
101views more  EOR 2007»
13 years 8 months ago
Searching for multiobjective preventive maintenance schedules: Combining preferences with evolutionary algorithms
Heavy industry maintenance facilities at aircraft service centers or railroad yards must contend with scheduling preventive maintenance tasks to ensure critical equipment remains ...
Gang Quan, Garrison W. Greenwood, Donglin Liu, Xia...
SBACPAD
2005
IEEE
177views Hardware» more  SBACPAD 2005»
14 years 2 months ago
Automatic Data-Flow Graph Generation of MPI Programs
The Data-Flow Graph (DFG) of a parallel application is frequently used to take scheduling decisions, based on the information that it models (dependencies among the tasks and volu...
Rafael Ennes Silva, Guilherme P. Pezzi, Nicolas Ma...
EUROPAR
2005
Springer
14 years 2 months ago
A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing t...
Erik G. Boman, Doruk Bozdag, Ümit V. Ç...
CLUSTER
2008
IEEE
14 years 3 months ago
Redistribution aware two-step scheduling for mixed-parallel applications
— Applications raising in many scientific fields exhibit both data and task parallelism that have to be exploited efficiently. A classic approach is to structure those applica...
Sascha Hunold, Thomas Rauber, Frédér...