Skip to main content
Article thumbnail
Location of Repository

Project Report of CSCE790i Performance of Algorithms for Scheduling Soft Real-Time System

By Linwei Niu

Abstract

In this research project the performance of two well-known scheduling policies for Real Time Systems based on fixed priority, namely Enhanced (m,k)-firm Guarantee and Weakly hard scheduling, will be compared in terms of the overall schedulibility of a number of randomly generated task sets. Both methods are based on the common assumptions. A new scheduling alogrithm will then be derived by combining the advantages of both algorithm for the purpose of improving the overall schedulibility of the real time system

Topics: task, job, Real-time system, Weakly hard, Constraints, Schedu- lability, Interference, WCIP, Independent Job
Year: 2008
OAI identifier: oai:CiteSeerX.psu:10.1.1.133.9997
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cse.sc.edu/~songwan... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.