Sizing populations for serial and parallel genetic algorithms
Proceedings of the third international conference on Genetic algorithms
The design, implementation and evaluation of SMART: a scheduler for multimedia applications
Proceedings of the sixteenth ACM symposium on Operating systems principles
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
IEEE Transactions on Computers
Flexible Soft Real-Time Processing in Middleware
Real-Time Systems - Flexible Scheduling on Real-Time Systems
A Micro-Genetic Algorithm for Multiobjective Optimization
EMO '01 Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization
Scalable Scheduling Support for Loss and Delay Constrained Media Streams
RTAS '99 Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium
Window-Constrained Real-Time Periodic Task Scheduling
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Guaranteed On-Line Weakly-Hard Real-Time Systems
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Dynamic Window-Constrained Scheduling of Real-Time Streams in Media Servers
IEEE Transactions on Computers
Hard Real-time Computing Systems: Predictable Scheduling Algorithms And Applications (Real-Time Systems Series)
Representations for Genetic and Evolutionary Algorithms
Representations for Genetic and Evolutionary Algorithms
Analysis of a window-constrained scheduler for real-time and best-effort packet streams
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
| Hi-index | 0.00 |
Our work presents a micro-genetic algorithm (micro-GA) approach to window-constrained scheduling, suitable for weakly hard real-time systems. Earlier, Virtual deadline scheduling algorithm (VDS) is capable of generating a feasible window-constraint schedule that utilizes 100% of resources. But updating the service constraints for each job is required which is a bottleneck for the algorithm. In our work, micro-GA is able to generate a feasible window-constraint schedule that utilizes 100% resources. It does not have the problem of updating the service constraints. The mean service delays are reduced in the schedule produced by micro-GA. It also addresses the problem of context switch which is a conflicting criterion with delay and not addressed by VDS. Additionally, it is capable of producing a feasible window-constraint schedule when the service time of jobs varies and when the request period is not a multiple of service time.