Sciweavers

252 search results - page 18 / 51
» Task Assignment and Scheduling under Memory Constraints
Sort
View
EOR
2002
105views more  EOR 2002»
13 years 7 months ago
Review of properties of different precedence graphs for scheduling problems
Precedence constraints are a part of a definition of any scheduling problem. After recalling, in precise graph-theoretical terms, the relations between task-on-arc and task-on-nod...
Jacek Blazewicz, Daniel Kobler
RTCSA
2005
IEEE
14 years 29 days ago
Optimization of Hierarchically Scheduled Heterogeneous Embedded Systems
We present an approach to the analysis and optimization of heterogeneous distributed embedded systems for hard real-time applications. The systems are heterogeneous not only in te...
Traian Pop, Paul Pop, Petru Eles, Zebo Peng
AIPS
2003
13 years 8 months ago
Quality and Utility - Towards a Generalization of Deadline and Anytime Scheduling
Scheduling algorithms for real-time systems can be characterized in various ways, one of the most important ones of which is the underlying task model. Many concepts of real-time ...
Thomas Schwarzfischer
AAAI
2004
13 years 8 months ago
The U.S. National Football League Scheduling Problem
We describe the problem of scheduling the television broadcasts of the U.S. National Football League (NFL). Unlike traditional round-robin tournament scheduling, the NFL problem i...
Bistra N. Dilkina, William S. Havens
RTSS
1998
IEEE
13 years 11 months ago
Statistical Rate Monotonic Scheduling
Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [10] for periodic tasks with highly variable execution times and s...
Alia Atlas, Azer Bestavros