On the public citation graph

Resource Sharing in EDF-Scheduled Systems: A Closer Look

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

0 signed · 86 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/0-387-27578-9openalex-snapshot

Hard Real-Time Computing Systems

inferredcites →https://doi.org/10.1007/978-1-4614-0676-1openalex-snapshot

Hard Real-Time Computing Systems

inferredcites →https://doi.org/10.1007/978-1-4615-2796-1openalex-snapshot

A Practitioner’s Handbook for Real-Time Analysis

inferredcites →https://doi.org/10.1007/978-1-4757-3472-0_2openalex-snapshot

Cooperating Sequential Processes

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

Replication Techniques in Distributed Systems

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

Stack-based scheduling of realtime processes

inferredcites →https://doi.org/10.1007/s11241-005-0506-xopenalex-snapshot

Feasibility Analysis of Real-Time Periodic Tasks with Offsets

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/0304-3975(93)90360-6openalex-snapshot

Feasibility problems for recurring tasks on one processor

inferredcites →https://doi.org/10.1016/b978-155860702-6/50016-8openalex-snapshot

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

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.1016/s1383-7621(99)00009-0openalex-snapshot

Schedulability analysis of periodic and aperiodic tasks with resource constraints

inferredcites →https://doi.org/10.1023/b:time.0000048932.30002.d9openalex-snapshot

Rate Monotonic vs. EDF: Judgment Day

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.1093/comjnl/29.5.390openalex-snapshot

Finding Response Times in a Real-Time System

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.2004.22openalex-snapshot

Fixed or Dynamic Priority? That is the Question

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

Sustainable Scheduling Analysis

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/358818.358824openalex-snapshot

Experience with processes and monitors in Mesa

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-030-99336-8_11openalex-snapshot

Static Race Detection for Periodic Programs

inferred← citeshttps://doi.org/10.1007/978-3-031-45410-3_7openalex-snapshot

Resource Access Protocols

inferred← citeshttps://doi.org/10.1007/s00186-016-0543-3openalex-snapshot

Minimality of EDF networks with resource sharing

inferred← citeshttps://doi.org/10.1007/s00186-017-0598-9openalex-snapshot

Edge minimality of EDF resource sharing networks

inferred← citeshttps://doi.org/10.1007/s11134-017-9553-yopenalex-snapshot

Stability of linear EDF networks with resource sharing

inferred← citeshttps://doi.org/10.1007/s11241-008-9057-2openalex-snapshot

Resource holding times: computation and optimization

inferred← citeshttps://doi.org/10.1007/s11241-009-9066-9openalex-snapshot

An earlier time for inserting and/or accelerating tasks

inferred← citeshttps://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

inferred← citeshttps://doi.org/10.1007/s11241-018-9301-3openalex-snapshot

A design flow for supporting component-based software development in multiprocessor real-time systems

inferred← citeshttps://doi.org/10.1016/j.automatica.2009.07.011openalex-snapshot

Supervisory control for real-time scheduling of periodic and sporadic tasks with resource constraints

inferred← citeshttps://doi.org/10.1016/j.jlamp.2014.10.001openalex-snapshot

An optimal resource sharing protocol for generalized multiframe tasks

inferred← citeshttps://doi.org/10.1016/j.sysarc.2010.02.003openalex-snapshot

A capacity sharing and stealing strategy for open real-time systems

inferred← citeshttps://doi.org/10.1109/access.2024.3432811openalex-snapshot

Worst-Case Blocking Time Optimization in WCRT Analysis for vMPCP on Multi-Core Virtual Machines

inferred← citeshttps://doi.org/10.1109/compsac.2008.113openalex-snapshot

An Overrun Method to Support Composition of Semi-independent Real-Time Components

inferred← citeshttps://doi.org/10.1109/ecrts.2011.33openalex-snapshot

Resource Sharing Protocols for Real-Time Task Graph Systems

inferred← citeshttps://doi.org/10.1109/ecrts.2014.39openalex-snapshot

Optimal Design for Reservation Servers under Shared Resources

inferred← citeshttps://doi.org/10.1109/ecrts.2015.31openalex-snapshot

Supporting Component-Based Development in Partitioned Multiprocessor Real-Time Systems

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/etfa.2008.4638456openalex-snapshot

Scheduling of semi-independent real-time components: Overrun methods and resource holding times.

inferred← citeshttps://doi.org/10.1109/etfa.2010.5641272openalex-snapshot

Protocol-transparent resource sharing in hierarchically scheduled real-time systems

inferred← citeshttps://doi.org/10.1109/etfa.2012.6489570openalex-snapshot

Target-sensitive systems: Analysis and implementation issues

inferred← citeshttps://doi.org/10.1109/etfa.2013.6648046openalex-snapshot

Limited preemptive scheduling of mixed time-triggered and event-triggered tasks

inferred← citeshttps://doi.org/10.1109/etfa.2014.7005065openalex-snapshot

Performance evaluation of analysis methods for arbitrating non-preemptive resource access in compositional real-time systems

inferred← citeshttps://doi.org/10.1109/icces.2008.4773003openalex-snapshot

Energy-efficient multi-speed algorithm for scheduling dependent real-time tasks

inferred← citeshttps://doi.org/10.1109/icppw.2009.44openalex-snapshot

Multiprocessor Synchronization and Hierarchical Scheduling

inferred← citeshttps://doi.org/10.1109/ipdps.2008.4536568openalex-snapshot

Shared resources and precedence constraints with capacity sharing and stealing

inferred← citeshttps://doi.org/10.1109/iscc55528.2022.9912792openalex-snapshot

Real-time Resource Management in Smart Energy-Harvesting Systems

inferred← citeshttps://doi.org/10.1109/rtas.2007.32openalex-snapshot

Resource-Locking Durations in EDF-Scheduled Systems

inferred← citeshttps://doi.org/10.1109/rtas.2008.7openalex-snapshot

Hybrid-priority Scheduling of Resource-Sharing Sporadic Task Systems

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

Work in Progress: Security-Aware Preemptive Scheduling with Partial Trust for Safety-Critical Embedded Systems

inferred← citeshttps://doi.org/10.1109/rtas68450.2026.00020openalex-snapshot

Work in Progress: Efficient EDF scheduling using COTS hardware acceleration

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

Dependable Resource Sharing for Compositional Real-Time Systems

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

Integration of resource synchronization and preemption-thresholds into EDF-based mixed-criticality scheduling algorithm

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

Optimal and fast composition of resource-sharing components in hierarchical real-time systems

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.23openalex-snapshot

The Design of an EDF-Scheduled Resource-Sharing Open Environment

inferred← citeshttps://doi.org/10.1109/rtss.2007.49openalex-snapshot

Energy-Aware Scheduling for Streaming Applications on Chip Multiprocessors

inferred← citeshttps://doi.org/10.1109/rtss.2011.15openalex-snapshot

Execution Stack Management for Hard Real-Time Computation in a Component-Based OS

inferred← citeshttps://doi.org/10.1109/sies.2011.5953690openalex-snapshot

Towards an efficient approach for resource sharing in real-time multiprocessor 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.2014.2322619openalex-snapshot

A Deadline-Floor Inheritance Protocol for EDF Scheduled Embedded Real-Time Systems with Resource Sharing

inferred← citeshttps://doi.org/10.1109/tc.2015.2444833openalex-snapshot

Schedulability Analysis of Hierarchical Real-Time Systems under Shared Resources

inferred← citeshttps://doi.org/10.1109/tii.2009.2026051openalex-snapshot

Resource-Sharing Servers for Open Environments

inferred← citeshttps://doi.org/10.1109/tii.2009.2037918openalex-snapshot

Overrun Methods and Resource Holding Times for Hierarchical Scheduling of Semi-Independent Real-Time Systems

inferred← citeshttps://doi.org/10.1109/tii.2010.2049654openalex-snapshot

Limited Preemption EDF Scheduling of Sporadic Task Systems

inferred← citeshttps://doi.org/10.1109/tii.2011.2172448openalex-snapshot

Transparent Synchronization Protocols for Compositional Real-Time Systems

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

Reducing stack with intra-task threshold priorities in real-time systems

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

Using allopoietic agents in replicated software to respond to errors, faults, and attacks

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/2492312.2492316openalex-snapshot

An EDF run-time profile based on ravenscar

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

Supporting Global Resource Sharing in RUN-scheduled Multiprocessor Systems

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

Resource Synchronization and Preemption Thresholds Within Mixed-Criticality Scheduling

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

Resource reservation for real-time self-suspending tasks

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

Minimizing Stack Memory for Hard Real-Time Applications on Multicore Platforms with Partitioned Fixed-Priority or EDF Scheduling

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

Cache-Partitioned Preemption Threshold Scheduling

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

Partitioning and Interface Synthesis in Hierarchical Multiprocessor Real-Time Systems

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

Choosing preemption points to minimize typical running times

inferred← citeshttps://doi.org/10.11591/eei.v4i3.457openalex-snapshot

Heuristic Approach for Scheduling Dependent Real-Time Tasks

inferred← citeshttps://doi.org/10.11591/ijece.v5i4.pp701-713openalex-snapshot

Processor Speed Control for Power Reduction of Real-Time Systems

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

REORDER: Securing Dynamic-Priority Real-Time Systems Using Schedule Obfuscation

inferred← citeshttps://doi.org/10.5626/jcse.2008.2.1.074openalex-snapshot

Sustainability in Real-time Scheduling

inferred← citeshttps://doi.org/10.5772/62691openalex-snapshot

Uniform Interfaces for Resource-Sharing Components in Hierarchically Scheduled Real-Time Systems

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/f014a22dz9571z4411z8e49ze4f7741f81b6openalex-snapshot

Real-time and energy constrained cobotic 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.