Generating Random Dynamic Resource Scheduling Problems
2008
Dynamic scheduling refers to a class of scheduling problems in which dynamic events, such as delaying of a task, occur throughout execution. We develop a framework for dynamic resource scheduling implemented in Java with a random problem generator, a dynamic simulator and a scheduler. The problem generator is used to generate benchmark datasets that are read by the simulator, whose purpose is to notify the scheduler of the dynamic events when they occur. We perform a case-study on an oversubscribed dynamic resource scheduling problem in which we assign unit resources to tasks subject to temporal and precedence constraints.
Keywords:
- Deadline-monotonic scheduling
- Real-time computing
- Two-level scheduling
- Lottery scheduling
- Fair-share scheduling
- Dynamic priority scheduling
- Fixed-priority pre-emptive scheduling
- Stride scheduling
- Distributed computing
- Computer science
- Genetic algorithm scheduling
- Rate-monotonic scheduling
- Earliest deadline first scheduling
- Scheduling (computing)
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
7
References
2
Citations
NaN
KQI