On the public citation graph

Computational Complexity and Speedup Factors Analyses for Self-Suspending Tasks

https://doi.org/10.1109/rtss.2016.039

0 signed · 39 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01553887openalex-snapshot

A new algorithm for scheduling periodic, real-time tasks

inferredcites →https://doi.org/10.1007/s11241-015-9233-0openalex-snapshot

Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms

inferredcites →https://doi.org/10.1007/s11241-018-9316-9openalex-snapshot

Many suspensions, many problems: a review of self-suspending tasks in real-time systems

inferredcites →https://doi.org/10.1016/0166-5316(82)90024-4openalex-snapshot

On the complexity of fixed-priority scheduling of periodic, real-time tasks

inferredcites →https://doi.org/10.1109/ecrts.2015.15openalex-snapshot

Timing Analysis of Fixed Priority Self-Suspending Sporadic Tasks

inferredcites →https://doi.org/10.1109/ecrts.2015.32openalex-snapshot

Uniprocessor Feasibility of Sporadic Tasks with Constrained Deadlines Is Strongly coNP-Complete

inferredcites →https://doi.org/10.1109/ecrts.2016.31openalex-snapshot

A Unifying Response Time Analysis Framework for Dynamic Self-Suspending Tasks

inferredcites →https://doi.org/10.1109/emrts.2004.1311025openalex-snapshot

Fixed priority timing analysis of real-time systems with limited parallelism

inferredcites →https://doi.org/10.1109/real.1990.128748openalex-snapshot

Fixed priority scheduling of periodic task sets with arbitrary deadlines

inferredcites →https://doi.org/10.1109/real.1998.739728openalex-snapshot

Schedulability analysis for tasks with static and dynamic offsets

inferredcites →https://doi.org/10.1109/real.2004.35openalex-snapshot

Negative Results for Scheduling Independent Hard Real-Time Tasks with Self-Suspensions

inferredcites →https://doi.org/10.1109/rtas.2010.38openalex-snapshot

Scheduling Self-Suspending Real-Time Tasks with Rate-Monotonic Priorities

inferredcites →https://doi.org/10.1109/rtcsa.1995.528751openalex-snapshot

Real-time scheduling of tasks that contain the external blocking intervals

inferredcites →https://doi.org/10.1109/rtcsa.2005.48openalex-snapshot

Extended Analysis with Reduced Pessimism for Systems with Limited Parallelism

inferredcites →https://doi.org/10.1109/rtss.2013.32openalex-snapshot

Segment-Fixed Priority Scheduling for Self-Suspending Real-Time Tasks

inferredcites →https://doi.org/10.1109/rtss.2014.10openalex-snapshot

Bursty-Interference Analysis Techniques for Analyzing Complex Real-Time Task Models

inferredcites →https://doi.org/10.1109/rtss.2014.31openalex-snapshot

Fixed-Relative-Deadline Scheduling of Hard Real-Time Tasks with Self-Suspensions

inferredcites →https://doi.org/10.1109/rtss.2015.18openalex-snapshot

k2U: A General Framework from k-Point Effective Schedulability Analysis to Utilization-Based Tests

inferredcites →https://doi.org/10.1109/rttas.2004.1317285openalex-snapshot

Realistic analysis of limited parallel software / hardware implementations

inferredcites →https://doi.org/10.1109/tencon.1994.369148openalex-snapshot

On-line multiprocessor scheduling algorithms for real-time tasks

inferredcites →https://doi.org/10.1145/2744769.2744891openalex-snapshot

PASS

inferredcites →https://doi.org/10.1145/321738.321743openalex-snapshot

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

inferredcites →https://doi.org/10.1145/347476.347479openalex-snapshot

Speed is as powerful as clairvoyance

inferredcites →https://doi.org/10.1587/transinf.e92.d.1412openalex-snapshot

Effective Scheduling Algorithms for I/O Blocking with a Multi-Frame Task Model

inferredcites →https://doi.org/10.3850/9783981537079_0244openalex-snapshot

Self-Suspension Real-Time Tasks under Fixed-Relative-Deadline Fixed-Priority Scheduling

inferredcites →https://doi.org/10.4230/lites-v004-i001-a001openalex-snapshot

A Note on the Exact Schedulability Analysis for Segmented Self-Suspending Systems

inferredcites →https://doi.org/10.48550/arxiv.1605.00119openalex-snapshot

Automatic Parameter Derivations in k2U Framework

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s11241-018-9316-9openalex-snapshot

Many suspensions, many problems: a review of self-suspending tasks in real-time systems

inferred← citeshttps://doi.org/10.1007/s11241-022-09391-wopenalex-snapshot

Enhanced schedulability tests for real-time regularity-based virtualized systems with dependent and self-suspension tasks

inferred← citeshttps://doi.org/10.1109/rtas65571.2025.00010openalex-snapshot

Optimal Priority Assignment for Synchronous Harmonic Tasks with Dynamic Self-Suspension

inferred← citeshttps://doi.org/10.1109/rtcsa.2017.8046321openalex-snapshot

State of the art for scheduling and analyzing self-suspending sporadic real-time tasks

inferred← citeshttps://doi.org/10.1109/rtcsa.2017.8046328openalex-snapshot

Hybrid self-suspension models in real-time embedded systems

inferred← citeshttps://doi.org/10.1109/rtcsa.2018.00027openalex-snapshot

Schedulability Analysis and Priority Assignment for Segmented Self-Suspending Tasks

inferred← citeshttps://doi.org/10.1109/rtcsa52859.2021.00014openalex-snapshot

Enhanced Schedulability Tests for Real-Time Regularity-Based Virtualized Systems with Dependent and Self-Suspension Tasks

inferred← citeshttps://doi.org/10.1109/rtss52674.2021.00045openalex-snapshot

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

inferred← citeshttps://doi.org/10.1109/tcad.2020.3013095openalex-snapshot

Suspension-Aware Earliest-Deadline-First Scheduling Analysis

inferred← citeshttps://doi.org/10.1145/2997465.2997485openalex-snapshot

On Fixed-Priority Schedulability Analysis of Sporadic Tasks with Self-Suspension

inferred← citeshttps://doi.org/10.1145/2997465.2997497openalex-snapshot

Uniprocessor Scheduling Strategies for Self-Suspending Task Systems

inferred← citeshttps://doi.org/10.48550/arxiv.2001.05747openalex-snapshot

On Schedulability Analysis of EDF Scheduling by Considering Suspension as Blocking

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.