380 search results - page 49 / 76 » Scheduling Distributed Real-Time Tasks in the DGMF Model |
137
Voted
DATE
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—Many application domains require adaptive realtime embedded systems that can change their functionality over time. In such systems it is not only necessary to guarantee ...
132
click to vote
RTAS
2005
IEEE
15 years 9 months ago
2005
IEEE
The increasing popularity of high-volume performancecritical Internet applications calls for a scalable server design that allows meeting individual response-time guarantees. Cons...
137
click to vote
ISPDC
2005
IEEE
15 years 9 months ago
2005
IEEE
An important scheduling problem is the one in which there are no dependencies between tasks and the tasks can be of arbitrary size. This is known as the divisible load scheduling ...
148
click to vote
JCM
2007
15 years 3 months ago
2007
—Divisible loads are those workloads that can be partitioned by a scheduler into any arbitrary chunks. The problem of scheduling divisible loads has been defined for a long time,...
140
click to vote
CP
1998
Springer
15 years 8 months ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...