373 search results - page 35 / 75 » Scheduling Conditional Task Graphs |
CLOUDCOM
2009
Springer
14 years 17 days ago
2009
Springer
Workflows are modeled as hierarchically structured directed acyclic graphs in which vertices represent computational tasks, referred to as requests, and edges represent precedent c...
RTSS
2000
IEEE
14 years 1 months ago
2000
IEEE
In this paper we propose a novel scheduling framework for a real-timeenvironmentthat experiences dynamic changes. Thisframework is capable of adjusting the system workload in incr...
JPDC
2007
13 years 8 months ago
2007
High quality of security is increasingly critical for applications running on heterogeneous distributed systems. However, existing scheduling algorithms for heterogeneous distribu...
RTCSA
2006
IEEE
14 years 2 months ago
2006
IEEE
(m,k)-firm constraints have been used to schedule tasks in soft/firm real-time systems under overloaded conditions. In general, they are provided by application designers to guara...
EMSOFT
2001
Springer
14 years 1 months ago
2001
Springer
: Run-time executives and operating system kernels for embedded systems have long relied exclusively on static priority scheduling of tasks to ensure timing constraints and other c...