373 search results - page 4 / 75 » Scheduling Conditional Task Graphs |
IPPS
2003
IEEE
13 years 11 months ago
2003
IEEE
In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, or...
DSN
2000
IEEE
13 years 10 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...
RTCSA
2009
IEEE
14 years 15 days ago
2009
IEEE
Soft real-time sporadic multiprocessor task systems are considered that include processing pipelines. Conditions are presented for guaranteeing bounded deadline tardiness in such ...
ICPP
1993
IEEE
13 years 10 months ago
1993
IEEE
Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. If the execution of the program is known ahead of time, then the tasks can be st...
DATE
1998
IEEE
13 years 10 months ago
1998
IEEE
We present an approach to process scheduling based on an abstract graph representation which captures both dataflow and the flow of control. Target architectures consist of severa...