252 search results - page 26 / 51 » Task Assignment and Scheduling under Memory Constraints |
149
Voted
ACPC
1999
Springer
15 years 7 months ago
1999
Springer
In this paper, we first present an Object Composition Petri Nets (OCPN) based model methodology for describing the dynamic behaviour of the multiple video objects and user interac...
122
Voted
RTSS
2005
IEEE
15 years 8 months ago
2005
IEEE
Periodic update transaction model has been used to maintain freshness (or temporal validity) of real-time data. Period and deadline assignment has been the main focus in the past ...
119
Voted
RTSS
2000
IEEE
15 years 7 months ago
2000
IEEE
In this paper, we study the problem of scheduling task sets with (m,k) constraints. In our approach, jobs of each task are partitioned into two sets: mandatory and optional. Manda...
103
Voted
IPPS
1999
IEEE
15 years 7 months ago
1999
IEEE
The paper introduces a family of scheduling problems called fault-tolerant programs scheduling FTPS. Since FTPS problems are, in general, computationally di cult, a challenge is to...
126
Voted
CATA
2003
15 years 4 months ago
2003
In this paper we present a new method of combining multiple precedence constraints for a single task to support software systems having client-server relationships. In these types...