On the public citation graph

Weakly-hard Real-time Guarantees for Earliest Deadline First Scheduling of Independent Tasks

https://doi.org/10.1145/3356865
0 signed · 49 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.1002/nav.3800210113openalex-snapshot
Some simple scheduling algorithms
inferredcites →https://doi.org/10.1007/11572329_14openalex-snapshot
Scheduling Fixed-Priority Hard Real-Time Tasks in the Presence of Faults
inferredcites →https://doi.org/10.1007/s11241-005-0507-9openalex-snapshot
Measuring the Performance of Schedulability Tests
inferredcites →https://doi.org/10.1007/s11241-008-9053-6openalex-snapshot
Stochastic analysis of real-time systems under preemptive priority-driven scheduling
inferredcites →https://doi.org/10.1007/s11241-008-9060-7openalex-snapshot
The space of EDF deadlines: the exact region and a convex approximation
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.1016/s0898-1221(98)90205-xopenalex-snapshot
Hard real-time computing systems: Predictable scheduling algorithms and applications
inferredcites →https://doi.org/10.1049/ip-cdt:20045088openalex-snapshot
System level performance analysis – the SymTA/S approach
inferredcites →https://doi.org/10.1109/12.477249openalex-snapshot
A dynamic priority assignment technique for streams with (m, k)-firm deadlines
inferredcites →https://doi.org/10.1109/12.919277openalex-snapshot
Weakly hard real-time systems
inferredcites →https://doi.org/10.1109/71.774906openalex-snapshot
Overload management in real-time control applications using (m, k)-firm guarantee
inferredcites →https://doi.org/10.1109/date.2003.1253607openalex-snapshot
A general framework for analysing system properties in platform-based embedded system designs
inferredcites →https://doi.org/10.1109/ecrts.2015.29openalex-snapshot
Improved Deadline Miss Models for Real-Time Systems Using Typical Worst-Case Analysis
inferredcites →https://doi.org/10.1109/emrts.2003.1212720openalex-snapshot
Proceedings 15th Euromicro Conference on Real-Time Systems. ECRTS 2003
inferredcites →https://doi.org/10.1109/rtss.2012.67openalex-snapshot
Quantifying the Effect of Rare Timing Events with Settling-Time and Overshoot
inferredcites →https://doi.org/10.1109/rtss.2015.20openalex-snapshot
Response Time Analysis with Limited Carry-In for Global Earliest Deadline First Scheduling
inferredcites →https://doi.org/10.1109/sies.2017.7993392openalex-snapshot
Probabilistic schedulability tests for uniprocessor fixed-priority scheduling under soft errors
inferredcites →https://doi.org/10.1109/tac.1985.1103952openalex-snapshot
A unified method for evaluating real-time computer controllers and its application
inferredcites →https://doi.org/10.1109/tc.2009.58openalex-snapshot
Schedulability Analysis for Real-Time Systems with EDF Scheduling
inferredcites →https://doi.org/10.1109/tdsc.2004.2openalex-snapshot
Basic concepts and taxonomy of dependable and secure computing
inferredcites →https://doi.org/10.1109/tie.2015.2504339openalex-snapshot
The Impact of Deadline Misses on the Control Performance of High-End Motion Control Systems
inferredcites →https://doi.org/10.1145/2039370.2039396openalex-snapshot
Reliability analysis for MPSoCs with mixed-critical, hard real-time constraints
inferredcites →https://doi.org/10.1145/2656045.2656059openalex-snapshot
Extending typical worst-case analysis using response-time dependencies to bound deadline misses
inferredcites →https://doi.org/10.1145/2659787.2659823openalex-snapshot
Probabilistic Deadline Miss Analysis of Real-Time Systems Using Regenerative Transient Analysis
inferredcites →https://doi.org/10.1145/2717113openalex-snapshot
A Probabilistic Calculus for Probabilistic Real-Time Systems
inferredcites →https://doi.org/10.1145/3126497openalex-snapshot
Weakly Hard Schedulability Analysis for Fixed Priority Scheduling of Periodic Real-Time Tasks
inferredcites →https://doi.org/10.1145/321738.321743openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
inferredcites →https://doi.org/10.1287/moor.9.2.244openalex-snapshot
A Note on Approximation Schemes for Multidimensional Knapsack Problems
inferredcites →https://doi.org/10.23919/date.2017.7927054openalex-snapshot
Bounding deadline misses in weakly-hard real-time systems with task dependencies
inferredcites →https://doi.org/10.5555/2492708.2492836openalex-snapshot
Formal analysis of sporadic overload in real-time systems
inferredcites →https://doi.org/10.7873/date.2014.268openalex-snapshot
General and efficient Response Time Analysis for EDF scheduling

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-032-32537-2_20openalex-snapshot
Over-Approximation of Weakly-Hard Constraints for Control Systems Verification
inferred← citeshttps://doi.org/10.1007/s11241-025-09435-xopenalex-snapshot
Worst case response time analysis for completely fair scheduling in Linux systems
inferred← citeshttps://doi.org/10.1007/s43926-025-00134-4openalex-snapshot
Enhanced DDPG algorithm for latency and energy-efficient task scheduling in MEC systems
inferred← citeshttps://doi.org/10.1016/j.jpdc.2021.07.019openalex-snapshot
Dynamic fault tolerant scheduling with response time minimization for multiple failures in cloud
inferred← citeshttps://doi.org/10.1016/j.suscom.2023.100872openalex-snapshot
A systematic review on security aware real-time task scheduling
inferred← citeshttps://doi.org/10.1109/access.2024.3502400openalex-snapshot
Implementing Low Latency and High Energy Efficiency Task Scheduling in MEC Systems Using Improved DDPG Algorithm
inferred← citeshttps://doi.org/10.1109/etfa61755.2024.10711035openalex-snapshot
Guaranteeing Weakly-Hard Timing Constraints of Real-Time Server-Based Systems
inferred← citeshttps://doi.org/10.1109/jsen.2026.3661360openalex-snapshot
Modeling Real-Time Bicep Muscle Fatigue With IMU Sensors Using LSTM Regression
inferred← citeshttps://doi.org/10.1109/rtas61025.2024.00043openalex-snapshot
Work in Progress: Guaranteeing Weakly-Hard Timing Constraints in Server-Based Real-Time Systems
inferred← citeshttps://doi.org/10.1145/3672608.3707844openalex-snapshot
Efficient Scheduling of Weakly-Hard Real-Time Tasks with Sufficient Schedulability Condition
inferred← citeshttps://doi.org/10.1145/3728364openalex-snapshot
RESCUE: A Reconfigurable Scheduling Framework for Securing Multi-Core Real-Time Systems
inferred← citeshttps://doi.org/10.1145/3748329openalex-snapshot
P 2 SDS : A Polynomial-Time Pattern-Guided Stable Dynamic Scheduling for Weakly Hard Control Task Systems
inferred← citeshttps://doi.org/10.1145/3760528openalex-snapshot
A Formal Approach towards Safe and Stable Schedule Synthesis in Weakly Hard Control Systems
inferred← citeshttps://doi.org/10.1145/3770865.3770868openalex-snapshot
Sufficient Schedulability Condition for Scheduling Weakly-Hard Real-Time Tasks Considering Job-Kill and Skip-Next Strategies
inferred← citeshttps://doi.org/10.1145/3786342openalex-snapshot
Global Scheduling of Weakly-Hard Real-Time Tasks using Job-Level Priority Classes
inferred← citeshttps://doi.org/10.22028/d291-47711openalex-snapshot
Stability of Linear Systems Under Extended Weakly-Hard Constraints
inferred← citeshttps://doi.org/10.23919/date69613.2026.11539296openalex-snapshot
PREFACE: Proactive Re-executions for Fault-aware Mixed-criticality Environments
inferred← citeshttps://doi.org/10.3390/e25121640openalex-snapshot
Computational-Intelligence-Based Scheduling with Edge Computing in Cyber–Physical Production Systems
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.