A new sufficient schedulability analysis for hybrid scheduling

Abstract Earliest deadline first (EDF) and fixed priority (FP) are the most commonly used and studied scheduling algorithms for real-time systems. This paper focuses on combining the EDF and FP strategies in one system. We provide a new sufficient schedulability analysis for real-time hybrid task systems which are scheduled by EDF and FP. The proposed analysis has a polynomial time complexity and no restrictions on task parameters, where the relative deadline of each task could be less than, equal to, or greater than its period. By extensive experiments, we show that our proposed analysis significantly improves the acceptance ratio compared with the existing results of the sufficient schedulability test for hybrid scheduling systems.

• Publication year

  2016

• Venue

  International Journal of Applied Mathematics and Computer Sciences

• Publication date

  2016-09-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1515/amcs-2016-0047
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Robust sensor fault estimation for descriptor-LPV systems with unmeasurable gain scheduling functions: Application to an anaerobic bioreactor

  2015cited by this paper
• Intelligent Fault Diagnosis in Nonlinear Systems

  2014cited by this paper
• Efficient schedulability tests for real-time embedded systems with urgent routines

  2013cited by this paper
• Survey and application of sensor fault detection and isolation schemes

  2011cited by this paper
• A Survey of Fault Detection, Isolation, and Reconfiguration Methods

  2010cited by this paper
• Schedulability Analysis for Real-Time Systems with EDF Scheduling

  2009cited by this paper
• Real-Time Systems and Programming Languages - Ada, Real-Time Java and C / Real-Time POSIX, Fourth Edition

  2009cited by this paper
• Efficient Exact Schedulability Tests for Fixed Priority Real-Time Systems

  2008cited by this paper
• Analysis of Hierarchical EDF Pre-emptive Scheduling

  2007cited by this paper
• Hierarchical fixed priority pre-emptive scheduling

  2005cited by this paper
• Measuring the Performance of Schedulability Tests

  2005cited by this paper
• An event stream driven approximation for the analysis of real-time systems

  2004cited by this paper
• An improved schedulability test for uniprocessor periodic task systems

  2003influential reference
• Response time analysis for tasks scheduled under EDF within fixed priorities

  2003cited by this paper
• Approximate schedulability analysis

  2002cited by this paper
• A hyperbolic bound for the rate monotonic algorithm

  2001cited by this paper
• A fixed-priority-driven open environment for real-time applications

  1999cited by this paper
• Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications

  1997cited by this paper
• Aperiodic servers in a deadline scheduling environment

  1995cited by this paper
• An extendible approach for analyzing fixed priority hard real-time tasks

  1994cited by this paper
• Holistic schedulability analysis for distributed hard real-time systems

  1994cited by this paper
• Applying new scheduling theory to static priority pre-emptive scheduling

  1993cited by this paper
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

  1989cited by this paper
• Finding Response Times in a Real-Time System

  1986cited by this paper
• On the complexity of fixed-priority scheduling of periodic, real-time tasks

  1982cited by this paper
• Control Robotics: The Procedural Control of Physical Processes

  1974cited by this paper

• Hybrid Switching Controller Design for the Maneuvering and Transit of a Training Ship

  2017cites this paper