Referenced Items are not available for this document.
Task scheduling in real-time systems is a concept by which we can schedule the tasks according to their priorities. In hard real-time systems, the task scheduling is more important due to the chance of system failure. We discuss EDF task scheduling which is an optimal technique for the uniprocessor systems. The existing result of the QPA algorithm was applied on the uniprocessor system to check the schedulability of the tasks in uniprocessor system. We have extended the QPA algorithm to check the schedulability of the task sets in multiprocessor systems. Our algorithm is based on QPA algorithm and the utilization balanced algorithm. The proposed algorithm checks the absolute deadlines much faster than the existing QPA algorithm for uniprocessor real-time systems.
Published in:
Computer Communication and Informatics (ICCCI), 2012 International Conference on
Date of Conference: 10-12 Jan. 2012
- Page(s):
- 1 - 9
- Print ISBN:
- 978-1-4577-1580-8
- INSPEC Accession Number:
- 12576572
- Conference Location :
- Coimbatore
- Digital Object Identifier :
- 10.1109/ICCCI.2012.6158912
- 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.
