280 search results - page 8 / 56 » Quasi-Static Scheduling of Communicating Tasks |
TJS
2008
13 years 7 months ago
2008
Abstract Multiprocessor task scheduling is an important and computationally difficult problem. A large number of algorithms were proposed which represent various tradeoffs between ...
TCAD
2010
13 years 2 months ago
2010
For real-time applications, it is necessary to estimate the worst-case performance early in the design process without actual hardware implementation. While the non-preemptive task...
CLUSTER
2007
IEEE
14 years 1 months ago
2007
IEEE
— In this article we tackle the problem of scheduling a dynamically generated DAG of multi-processor tasks (M-tasks). At first, we outline the need of such a scheduling approach...
IPPS
1997
IEEE
13 years 11 months ago
1997
IEEE
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...
AMAST
2000
Springer
13 years 12 months ago
2000
Springer
Modelling multi-tasking behaviour is an important phase of real-time system design. It is shown how task scheduling principles can be captured in a CCS-based process algebra via ex...