904 search results - page 4 / 181 » Scheduling task graphs optimally with A |
ICCAD
2000
IEEE
13 years 12 months ago
2000
IEEE
Synchronous Data Flow (SDF) is a well-known model of computation that is widely used in the control engineering and digital signal processing domains. Existing scheduling methods ...
CCGRID
2010
IEEE
13 years 8 months ago
2010
IEEE
Applications structured as parallel task graphs exhibit both data and task parallelism, and arise in many domains. Scheduling these applications on parallel platforms has been a lo...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
Battery lifetime, a primary design constraint for mobile embedded systems, has been shown to depend heavily on the load current profile. This paper explores how scheduling guidel...
SAC
2005
ACM
14 years 1 months ago
2005
ACM
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
ISCAPDCS
2007
13 years 9 months ago
2007
We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the...