Referenced Items are not available for this document.
Many real-time systems are in fact isochronal, where both early and late responses are harmful to the system or lead to lower quality of service. Real-time task scheduling problems proved that are NP-hard problems. Therefore, it is necessary to apply a heuristic search strategy on these problems. In this paper, a multi-objective genetic algorithm is proposed for static task scheduling in non-overloaded isochronal soft real-time systems. Its objective is to maximize the total utility of jobs. Simulation results indicate that genetic algorithm could be a suitable heuristic search strategy for task scheduling in isochronal soft real-time systems.
Published in:
Computer and Information Science, 2009. ICIS 2009. Eighth IEEE/ACIS International Conference on
Date of Conference: 1-3 June 2009
- Page(s):
- 65 - 69
- Print ISBN:
- 978-0-7695-3641-5
- INSPEC Accession Number:
- 10859658
- Conference Location :
- Shanghai
- Digital Object Identifier :
- 10.1109/ICIS.2009.207
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
