On the public citation graph
Improvement in feasibility testing for real-time tasks
0 signed · 146 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-56802-6_3openalex-snapshot
The olympus attitude and orbital control system A case study in hard real-time system design and implementation
inferredcites →https://doi.org/10.1007/bf01094342openalex-snapshot
Fixed priority pre-emptive scheduling: An historical perspective
inferredcites →https://doi.org/10.1007/bf01995675openalex-snapshot
Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor
inferredcites →https://doi.org/10.1016/0020-0190(80)90123-4openalex-snapshot
A note on preemptive scheduling of periodic, real-time tasks
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.1049/sej.1993.0034openalex-snapshot
Applying new scheduling theory to static priority pre-emptive scheduling
inferredcites →https://doi.org/10.1109/12.57058openalex-snapshot
Priority inheritance protocols: an approach to real-time synchronization
inferredcites →https://doi.org/10.1109/real.1990.128746openalex-snapshot
Preemptively scheduling hard-real-time sporadic tasks on one processor
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/tse.1989.559777openalex-snapshot
Some Results of the Earliest Deadline Scheduling Algorithm
inferredcites →https://doi.org/10.1145/103720.103723openalex-snapshot
Dynamic adaptation of real-time software
inferredcites →https://doi.org/10.1145/321738.321743openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
inferredcites →https://doi.org/10.13182/nse70-a19705openalex-snapshot
The Art of Computer Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11599555_17openalex-snapshot
On Using Locking Caches in Embedded Real-Time Systems
inferred← citeshttps://doi.org/10.1007/3-540-65193-4_21openalex-snapshot
On modeling real-time task systems
inferred← citeshttps://doi.org/10.1007/978-1-4615-5535-3_3openalex-snapshot
Fundamentals of EDF Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-540-24686-2_20openalex-snapshot
Schedulability Analysis in EDF Scheduler with Cache Memories
inferred← citeshttps://doi.org/10.1007/978-3-540-92221-6_25openalex-snapshot
Power-Aware Real-Time Scheduling upon Dual CPU Type Multiprocessor Platforms
inferred← citeshttps://doi.org/10.1007/978-3-540-92221-6_8openalex-snapshot
Deadline Monotonic Scheduling on Uniform Multiprocessors
inferred← citeshttps://doi.org/10.1007/978-3-642-01924-1_9openalex-snapshot
Combining EDF and FP Scheduling: Analysis and Implementation in Ada 2005
inferred← citeshttps://doi.org/10.1007/bfb0097916openalex-snapshot
From task scheduling in single processor environments to message scheduling in a PROFIBUS fieldbus network
inferred← citeshttps://doi.org/10.1007/s11227-022-04446-yopenalex-snapshot
Schedulability analysis of dynamic priority real-time systems with contention
inferred← citeshttps://doi.org/10.1007/s11241-006-9004-zopenalex-snapshot
Analysis of window-constrained execution time systems
inferred← citeshttps://doi.org/10.1007/s11241-006-9009-7openalex-snapshot
Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems
inferred← citeshttps://doi.org/10.1007/s11241-007-9047-9openalex-snapshot
Schedulability analysis of global edf
inferred← citeshttps://doi.org/10.1007/s11241-008-9055-4openalex-snapshot
On earliest deadline first scheduling for temporal consistency maintenance
inferred← citeshttps://doi.org/10.1007/s11241-011-9124-yopenalex-snapshot
Sensitivity analysis of arbitrary deadline real-time systems with EDF scheduling
inferred← citeshttps://doi.org/10.1007/s11241-011-9126-9openalex-snapshot
Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme
inferred← citeshttps://doi.org/10.1007/s11241-014-9204-xopenalex-snapshot
Unified overhead-aware schedulability analysis for slot-based task-splitting
inferred← citeshttps://doi.org/10.1007/s11241-015-9221-4openalex-snapshot
Architecture aware semi partitioned real-time scheduling on multicore platforms
inferred← citeshttps://doi.org/10.1007/s11241-015-9228-xopenalex-snapshot
Cache related pre-emption delays in hierarchical scheduling
inferred← citeshttps://doi.org/10.1007/s11241-015-9246-8openalex-snapshot
On the effectiveness of cache partitioning in hard real-time systems
inferred← citeshttps://doi.org/10.1007/s11241-017-9294-3openalex-snapshot
Exact speedup factors and sub-optimality for non-preemptive scheduling
inferred← citeshttps://doi.org/10.1007/s11241-018-9310-2openalex-snapshot
Uniprocessor scheduling of real-time synchronous dataflow tasks
inferred← citeshttps://doi.org/10.1007/s11241-023-09408-yopenalex-snapshot
Cutting-plane algorithms for preemptive uniprocessor scheduling problems
inferred← citeshttps://doi.org/10.1016/j.ifacol.2015.08.142openalex-snapshot
Schedulability Analysis of Hierarchical Systems with Arbitrary Scheduling in the Global Level
inferred← citeshttps://doi.org/10.1016/j.ifacol.2021.10.040openalex-snapshot
O(1)-online approximation of the slack for periodic task sets under EDF scheduling
inferred← citeshttps://doi.org/10.1016/j.jss.2009.01.040openalex-snapshot
Period sensitivity analysis and D–P domain feasibility region in dynamic priority systems
inferred← citeshttps://doi.org/10.1016/j.jss.2016.05.040openalex-snapshot
Real-time hierarchical systems with arbitrary scheduling at global level
inferred← citeshttps://doi.org/10.1016/j.riai.2013.03.006openalex-snapshot
Mejora de los Test de Planificabilidad para Asignación Incremental de Tareas en Sistemas Multiprocesadores de Tiempo Real
inferred← citeshttps://doi.org/10.1016/j.riai.2013.03.009openalex-snapshot
Selección del periodo para la minimización del hiperperiodo
inferred← citeshttps://doi.org/10.1016/j.scico.2014.05.014openalex-snapshot
Timed behavioural modelling and affine scheduling of embedded software architectures in the AADL using Polychrony
inferred← citeshttps://doi.org/10.1016/j.suscom.2019.02.002openalex-snapshot
Feasibility analysis of periodic real-time systems with energy harvesting capabilities
inferred← citeshttps://doi.org/10.1016/s0164-1212(03)00236-xopenalex-snapshot
Feasibility analysis of hard real-time periodic tasks
inferred← citeshttps://doi.org/10.1016/s0967-0661(97)00089-0openalex-snapshot
DYNAMIC SCHEDULING SOLUTIONS FOR REAL-TIME MULTIPROCESSOR SYSTEMS
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)36729-0openalex-snapshot
Deadline Assignment to Reduce Output Jitter of Real-Time Tasks
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)44874-9openalex-snapshot
The Real-Time Stealer 1
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)46357-9openalex-snapshot
Dynamic Scheduling Solutions for Real-Time Multiprocessor Systems
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)57454-6openalex-snapshot
Reducing Delays in RT Control: The Control Action Interval
inferred← citeshttps://doi.org/10.1016/s1697-7912(10)70046-7openalex-snapshot
Procedimiento de diseño para minimizar el consumo de potencia y los retrasos en WSAN
inferred← citeshttps://doi.org/10.1023/a:1007993819750openalex-snapshot
Real-Time Schedulability Tests for Preemptive Multitasking
inferred← citeshttps://doi.org/10.1023/a:1025120124771openalex-snapshot
Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors
inferred← citeshttps://doi.org/10.1023/b:time.0000029049.50766.faopenalex-snapshot
A Task Model to Reduce Control Delays
inferred← citeshttps://doi.org/10.1049/ip-sen:19990406openalex-snapshot
The stack resource protocol based on real-time transactions
inferred← citeshttps://doi.org/10.1109/32.601081openalex-snapshot
An optimal algorithm for scheduling soft aperiodic tasks in dynamic-priority preemptive systems
inferred← citeshttps://doi.org/10.1109/access.2023.3261130openalex-snapshot
Optimized Scheduling of Periodic Hard Real-Time Multicore Systems
inferred← citeshttps://doi.org/10.1109/cacsd-cca-isic.2006.4776812openalex-snapshot
Control loop timing analysis using truetime and jitterbug
inferred← citeshttps://doi.org/10.1109/cacsd.2006.285481openalex-snapshot
Control Loop Timing Analysis Using TrueTime and Jitterbug
inferred← citeshttps://doi.org/10.1109/ccece.2007.378openalex-snapshot
EDF Feasibility Analysis of Accelerated Tasks
inferred← citeshttps://doi.org/10.1109/csie.2009.1004openalex-snapshot
Energy-Aware Scheduling for Practical Mode Real-Time Systems with QoS Guarantee
inferred← citeshttps://doi.org/10.1109/date.2008.4484817openalex-snapshot
Improvements in Polynomial-Time Feasibility Testing for EDF
inferred← citeshttps://doi.org/10.1109/ecrts.2006.17openalex-snapshot
Optimal deadline assignment for periodic real-time tasks in dynamic priority systems
inferred← citeshttps://doi.org/10.1109/ecrts.2009.20openalex-snapshot
Improvement to Quick Processor-Demand Analysis for EDF-Scheduled Real-Time Systems
inferred← citeshttps://doi.org/10.1109/ecrts.2010.30openalex-snapshot
Constant-Time Admission Control for Partitioned EDF
inferred← citeshttps://doi.org/10.1109/ecrts.2011.27openalex-snapshot
Global-EDF Scheduling of Multimode Real-Time Systems Considering Mode Independent Tasks
inferred← citeshttps://doi.org/10.1109/ecrts.2016.30openalex-snapshot
Lightweight Real-Time Synchronization under P-EDF on Symmetric and Asymmetric Multiprocessors
inferred← citeshttps://doi.org/10.1109/emrts.2000.854009openalex-snapshot
Non pre-emptive scheduling of messages on SMTV token-passing networks
inferred← citeshttps://doi.org/10.1109/emrts.2002.1019181openalex-snapshot
Schedulability analysis of window-constrained execution time tasks for real-time control
inferred← citeshttps://doi.org/10.1109/emwrts.1998.685068openalex-snapshot
Using exact feasibility tests for allocating real-time tasks in multiprocessor systems
inferred← citeshttps://doi.org/10.1109/etfa.2010.5641283openalex-snapshot
Design procedure to minimize power consumption and delays in WSAN
inferred← citeshttps://doi.org/10.1109/etfa.2011.6059018openalex-snapshot
Platform-aware bandwidth-oriented energy management algorithm for real-time embedded systems
inferred← citeshttps://doi.org/10.1109/etfa.2011.6059178openalex-snapshot
Task period selection to minimize hyperperiod
inferred← citeshttps://doi.org/10.1109/euc.2011.39openalex-snapshot
Generating Bounded Task Periods for Experimental Schedulability Analysis
inferred← citeshttps://doi.org/10.1109/iccda.2010.5541363openalex-snapshot
Task parameter computations for constraint deadline real-time systems with EDF scheduling
inferred← citeshttps://doi.org/10.1109/iccsit.2010.5564885openalex-snapshot
Notice of Retraction: Sensitivity analysis of task period for EDF scheduled arbitrary deadline real-time systems
inferred← citeshttps://doi.org/10.1109/icctd.2010.5646058openalex-snapshot
Sensitivity analysis of scaling factor for a subset of real-time tasks
inferred← citeshttps://doi.org/10.1109/icdcs.1997.603275openalex-snapshot
A FIFO worst case analysis for a hard real-time distributed problem with consistency constraints
inferred← citeshttps://doi.org/10.1109/icdsc.2001.918951openalex-snapshot
Multiprocessor preprocessing algorithms for uniprocessor on-line scheduling
inferred← citeshttps://doi.org/10.1109/iceee.2005.1529564openalex-snapshot
A Library Framework for the POSIX Application-Defined Scheduling Proposal
inferred← citeshttps://doi.org/10.1109/icmee.2010.5558543openalex-snapshot
Notice of Retraction: Sensitivity analysis of relative deadline for EDF scheduled real-time systems
inferred← citeshttps://doi.org/10.1109/icsai.2014.7009309openalex-snapshot
A hard real-time scheduling algorithm based on elastic model
inferred← citeshttps://doi.org/10.1109/icste.2010.5608891openalex-snapshot
Dividing point value selections for Improved Quick Processor-demand Analysis
inferred← citeshttps://doi.org/10.1109/prdc.2010.16openalex-snapshot
Sensitivity Analysis of the Minimum Task Period for Arbitrary Deadline Real-Time Systems
inferred← citeshttps://doi.org/10.1109/real.2000.895999openalex-snapshot
An efficient feasibility test method for hard real-time periodic tasks
inferred← citeshttps://doi.org/10.1109/rtas.2013.6531081openalex-snapshot
Integrating cache related pre-emption delay analysis into EDF scheduling
inferred← citeshttps://doi.org/10.1109/rtcsa.1996.554989openalex-snapshot
Optimal aperiodic scheduling for dynamic-priority systems
inferred← citeshttps://doi.org/10.1109/rtcsa.2000.896382openalex-snapshot
On accepting aperiodic transactions in distributed systems
inferred← citeshttps://doi.org/10.1109/rtcsa.2000.896407openalex-snapshot
Multiprocessor algorithms for uniprocessor feasibility analysis
inferred← citeshttps://doi.org/10.1109/rtcsa.2000.896437openalex-snapshot
Control tasks delay reduction under static and dynamic scheduling policies
inferred← citeshttps://doi.org/10.1109/rtcsa.2006.41openalex-snapshot
Jitter Evaluation of Real-Time Control Systems
inferred← citeshttps://doi.org/10.1109/rtcsa.2009.40openalex-snapshot
Exact Response Time Analysis of Hierarchical Fixed-Priority Scheduling
inferred← citeshttps://doi.org/10.1109/rtcsa.2010.12openalex-snapshot
Sensitivity Analysis for EDF Scheduled Arbitrary Deadline Real-Time Systems
inferred← citeshttps://doi.org/10.1109/rtcsa.2010.25openalex-snapshot
Preemptive Uniprocessor Scheduling of Non-cyclic GMF Task Systems
inferred← citeshttps://doi.org/10.1109/rtcsa.2019.8864569openalex-snapshot
Cutting the Unnecessary Deadlines in EDF
inferred← citeshttps://doi.org/10.1109/rtss.2007.10openalex-snapshot
Implementing Hybrid Operating Systems with Two-Level Hardware Interrupts
inferred← citeshttps://doi.org/10.1109/rtss.2007.12openalex-snapshot
Analysis of Hierarchical EDF Pre-emptive Scheduling
inferred← citeshttps://doi.org/10.1109/rtss.2007.35openalex-snapshot
Techniques for Multiprocessor Global Schedulability Analysis
inferred← citeshttps://doi.org/10.1109/rtss.2007.48openalex-snapshot
Integrating Adaptive Components: An Emerging Challenge in Performance-Adaptive Systems and a Server Farm Case-Study
inferred← citeshttps://doi.org/10.1109/rtss.2008.32openalex-snapshot
The EDF Scheduling of Sporadic Task Systems on Uniform Multiprocessors
inferred← citeshttps://doi.org/10.1109/rtss.2010.18openalex-snapshot
An Algorithm for Scheduling Certifiable Mixed-Criticality Sporadic Task Systems
inferred← citeshttps://doi.org/10.1109/rtss.2010.19openalex-snapshot
The Non-cyclic Recurring Real-Time Task Model
inferred← citeshttps://doi.org/10.1109/rtss.2015.17openalex-snapshot
Quantifying the Exact Sub-optimality of Non-preemptive Scheduling
inferred← citeshttps://doi.org/10.1109/rtss.2016.012openalex-snapshot
Schedulability Analysis for a General Model of Mixed-Criticality Recurrent Real-Time Tasks
inferred← citeshttps://doi.org/10.1109/rttas.2001.929867openalex-snapshot
Resource partition for real-time systems
inferred← citeshttps://doi.org/10.1109/sbcci.1999.802972openalex-snapshot
A binary-tree architecture for scheduling real-time systems with hard and soft tasks
inferred← citeshttps://doi.org/10.1109/sbesc65055.2024.10771904openalex-snapshot
Fault Tolerance in Multiprocessor Real-Time Systems Under Partitioned EDF Scheduling
inferred← citeshttps://doi.org/10.1109/sies.2012.6356567openalex-snapshot
Certification-cognizant scheduling of tasks with pessimistic frequency specification
inferred← citeshttps://doi.org/10.1109/sies.2016.7509414openalex-snapshot
EDF schedulability test for the E-TDL time-triggered framework
inferred← citeshttps://doi.org/10.1109/sips.2014.6986102openalex-snapshot
Earliest-deadline first scheduling of multiple independent dataflow graphs
inferred← citeshttps://doi.org/10.1109/tc.2007.70787openalex-snapshot
Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems
inferred← citeshttps://doi.org/10.1109/tc.2009.58openalex-snapshot
Schedulability Analysis for Real-Time Systems with EDF Scheduling
inferred← citeshttps://doi.org/10.1109/tc.2012.243openalex-snapshot
Period Selection for Minimal Hyperperiod in Periodic Task Systems
inferred← citeshttps://doi.org/10.1109/tc.2014.2322619openalex-snapshot
A Deadline-Floor Inheritance Protocol for EDF Scheduled Embedded Real-Time Systems with Resource Sharing
inferred← citeshttps://doi.org/10.1109/tcad.2016.2527710openalex-snapshot
Solar Power Prediction Assisted Intra-task Scheduling for Nonvolatile Sensor Nodes
inferred← citeshttps://doi.org/10.1109/tvlsi.2006.878337openalex-snapshot
Energy minimization for real-time systems with (m,k)-guarantee
inferred← citeshttps://doi.org/10.1145/1403375.1403624openalex-snapshot
Improvements in polynomial-time feasibility testing for EDF
inferred← citeshttps://doi.org/10.1145/1550987.1550994openalex-snapshot
Minimizing CPU energy in real-time systems with discrete speed management
inferred← citeshttps://doi.org/10.1145/2442116.2442117openalex-snapshot
Schedulability analysis of EDF-scheduled embedded real-time systems with resource sharing
inferred← citeshttps://doi.org/10.1145/2465554.2465558openalex-snapshot
Buffer minimization in earliest-deadline first scheduling of dataflow graphs
inferred← citeshttps://doi.org/10.1145/2491899.2465558openalex-snapshot
Buffer minimization in earliest-deadline first scheduling of dataflow graphs
inferred← citeshttps://doi.org/10.1145/2492312.2492316openalex-snapshot
An EDF run-time profile based on ravenscar
inferred← citeshttps://doi.org/10.1145/2499369.2465558openalex-snapshot
Buffer minimization in earliest-deadline first scheduling of dataflow graphs
inferred← citeshttps://doi.org/10.1145/2659787.2659801openalex-snapshot
A Forward end-to-end delays Analysis for packet switched networks
inferred← citeshttps://doi.org/10.1145/2968478.2968488openalex-snapshot
Schedulability analysis of mixed-criticality systems with multiple frequency specifications
inferred← citeshttps://doi.org/10.1145/3273905.3273922openalex-snapshot
Timing analysis of AVB Ethernet network using the Forward end-to-end Delay Analysis
inferred← citeshttps://doi.org/10.1177/00375497221099548openalex-snapshot
Integrating I-DEVS and schedulability methods for analyzing real-time systems constraints
inferred← citeshttps://doi.org/10.1201/9780203489802-37openalex-snapshot
Scheduling real-time tasks: algorithms and complexity
inferred← citeshttps://doi.org/10.13140/rg.2.1.4117.9924openalex-snapshot
The Case for FIFO Real-Time Scheduling
inferred← citeshttps://doi.org/10.13328/j.cnki.jos.005025openalex-snapshot
Integer programming approach for schedulability of sporadic real-time systems
inferred← citeshttps://doi.org/10.17615/nyex-d314openalex-snapshot
The multiprocessor real-time scheduling of general task systems
inferred← citeshttps://doi.org/10.18419/opus-3370openalex-snapshot
Simulation of multi-core scheduling in real-time embedded systems
inferred← citeshttps://doi.org/10.22360/springsim.2016.tmsdevs.043openalex-snapshot
Scheduling Predictability In I-DEVS By Schedulability Analysis
inferred← citeshttps://doi.org/10.2498/cit.2000.03.06openalex-snapshot
A Hardware Architecture for Scheduling Complex Real-Time Task Sets
inferred← citeshttps://doi.org/10.3390/s18020628openalex-snapshot
A Model-Driven Co-Design Framework for Fusing Control and Scheduling Viewpoints
inferred← citeshttps://doi.org/10.3390/sym13081488openalex-snapshot
Dynamic Priority Real-Time Scheduling on Power Asymmetric Multicore Processors
inferred← citeshttps://doi.org/10.34626/nfq4-be32openalex-snapshot
Real-Time Scheduling on Multi-core: Theory and Practice
inferred← citeshttps://doi.org/10.4230/lites-v001-i001-a001openalex-snapshot
A Comparison between Fixed Priority and EDF Scheduling accounting for Cache Related Pre-emption Delays
inferred← citeshttps://doi.org/10.48550/arxiv.1205.0124openalex-snapshot
Schedulability Test for Soft Real-Time Systems under Multiprocessor Environment by using an Earliest Deadline First Scheduling Algorithm
inferred← citeshttps://doi.org/10.4995/thesis/10251/11552openalex-snapshot
Metodología de diseño para minimizar el consumo de potencia y los retrasos en redes inalámbricas de sensores y actuadores con retrasos acotados
inferred← citeshttps://doi.org/10.4995/thesis/10251/1934openalex-snapshot
Marco de referencia para la definición de planificadores a nivel de usuario en sistemas de tiempo-real
inferred← citeshttps://doi.org/10.70675/82225956z8862z4aeaz85f3z3f6eb0f5ac10openalex-snapshot
Etude et évaluation de politiques d'ordonnancement temps réel multiprocesseur
inferred← citeshttps://doi.org/10.70675/92eedee5z2c90z4166z8ebbz50275a05e4b0openalex-snapshot
Modélisation, évaluation et validation des systèmes temps réel distribués
inferred← citeshttps://doi.org/10.70675/c34f9bcez11d0z45afz93e6ze8882ad61c83openalex-snapshot
Conditions d’ordonnançabilité pour un langage dirigé par le temps
inferred← citeshttps://doi.org/10.70675/f440e352z52f5z4c4dz8879ze373d63c1825openalex-snapshot
Analyse et ordonnancement d’un système hiérarchique virtualisé composé d’applications temps réel strictes
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.