• Home
  • Search
  • Worst Case Response Time Analysis of Sporadic Graph Tasks with Fixed Priority Scheduling on a Uniprocessor
  • Cite Icon9
  • https://doi.org/10.1109/rtcsa.2005.103Copy DOI Icon

Worst Case Response Time Analysis of Sporadic Graph Tasks with Fixed Priority Scheduling on a Uniprocessor

  • Aug 17, 2005
  • Hui Xue Zhao +2 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

This paper considers the problem of hard real-time fixed priority scheduling of sporadic graph tasks on a uniprocessor. We study feasibility conditions based on the computation of the worst case response times of the graph tasks. A sporadic graph task associated to an application is characterized by a set of subtasks under precedence constraints. We investigate the late deadline constraint. We extend already published papers established in the preemptive case to the nonpreemptive case and to the hybrid case of an application composed of preemptive and nonpreemptive subtasks.

Similar Papers
  • Research Article
  • Citations1

A New Scheduling Algorithm for Shortening Response Time of Static Priority Task

  • Jun 11, 2022
  • ECTI Transactions on Computer and Information Technology (ECTI-CIT)
  • Takaharu Suzuki +1
  • Research Article
  • Citations38

Real-Time scheduling and analysis of parallel tasks on heterogeneous multi-cores

  • Dec 23, 2019
  • Journal of Systems Architecture
  • Shuangshuang Chang +3
  • Conference Article
  • Citations24

Probabilistic Response Time and Joint Analysis of Periodic Tasks

  • Jul 01, 2015
  • Bogdan Tanasa +3
  • Conference Article
  • Citations3

Work in Progress: Response Time Analysis of Real-Time Quantum Computing Systems

  • May 01, 2023
  • Albert M K Cheng
  • Research Article
  • Citations3

Carry-Out Interference Optimization in WCRT Analysis for Global Fixed-Priority Multiprocessor Scheduling

  • Mar 25, 2021
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • Guoqi Xie +2
  • Conference Article
  • Citations3

Probabilistic worst case response time estimation for multi-core real-time systems

  • Jun 01, 2015
  • Matthias Mucha +2
  • Video Transcripts

Suspension-Aware Fixed-Priority Schedulability Test with Arbitrary Deadlines And Arrival Curves

  • Jan 16, 2021
  • Underline Science Inc.
  • Mario Günzel +2
  • Conference Article
  • Citations5

Integration of Preemption Threshold and Quantum-Based Scheduling for Schedulability Enhancement of Fixed Priority Tasks

  • Aug 01, 2009
  • Moonju Park +2
  • Conference Article
  • Citations10

Quantum-Based Fixed Priority Scheduling

  • Dec 01, 2008
  • Moonju Park +3
  • Research Article
  • Citations2

A new algorithm to prove the schedulability of real-time systems

  • May 22, 2000
  • Control Engineering Practice
  • Shuhua Wang +1
  • Research Article

Online dispatching and parallel processing algorithms for saving money in systems with heterogeneous, single-buffered, speed-scalable processors

  • Sep 16, 2014
  • Applied Mathematical Modelling
  • Rashid Khogali +2
  • Conference Article
  • Citations1

Time analysis for fault-tolerant real-time group-based scheduling

  • Apr 04, 2005
  • Wang Lei +2
  • Research Article
  • Citations17

Response-Time Analysis for Controller Area Networks With Randomly Occurring Messages

  • Apr 01, 2020
  • IEEE Transactions on Vehicular Technology
  • Ryohei Sato +1
  • Conference Article
  • Citations23

An end-to-end approach to schedule tasks with shared resources in multiprocessor systems

  • May 18, 1994
  • Jun Sun +2
  • Research Article
  • Citations123

Attention allocation in the dual-task paradigm as measured through behavioral and psychophysiological responses.

  • Dec 17, 2003
  • Psychophysiology
  • Canan Karatekin +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.