On the public citation graph
Algorithms and optimality of scheduling soft aperiodic requests in fixed-priority preemptive systems
0 signed · 66 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/bf02341920openalex-snapshot
Aperiodic task scheduling for Hard-Real-Time systems
inferredcites →https://doi.org/10.1109/real.1988.51120openalex-snapshot
Exploiting unused periodic time for aperiodic service using the extended priority exchange algorithm
inferredcites →https://doi.org/10.1109/real.1989.63567openalex-snapshot
The rate monotonic scheduling algorithm: exact characterization and average case behavior
inferredcites →https://doi.org/10.1109/real.1992.242671openalex-snapshot
An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systems
inferredcites →https://doi.org/10.1109/real.1993.393496openalex-snapshot
Scheduling slack time in fixed priority pre-emptive systems
inferredcites →https://doi.org/10.1109/real.1993.393504openalex-snapshot
On-line scheduling of hard deadline aperiodic tasks in fixed-priority systems
inferredcites →https://doi.org/10.1145/321738.321743openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-44681-8_108openalex-snapshot
Optimal Scheduling of Aperiodic Jobs on Cluster
inferred← citeshttps://doi.org/10.1007/978-0-85729-318-3_5openalex-snapshot
Network Technologies for Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-1-4419-8158-5_3openalex-snapshot
Handling Non-Periodic Events in Real-Time Java Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-75836-3_19openalex-snapshot
Idle Time Administration on FreeRTOS Using Slack Stealing
inferred← citeshttps://doi.org/10.1007/978-3-319-78081-8_3openalex-snapshot
Delay-Efficient Multiclass Packet Scheduler
inferred← citeshttps://doi.org/10.1007/978-3-540-45212-6_6openalex-snapshot
Rate Monotonic vs. EDF: Judgment Day
inferred← citeshttps://doi.org/10.1007/s11241-006-4962-8openalex-snapshot
Dynamic Real-time Scheduling of Firm Periodic Tasks with Hard and Soft Aperiodic Tasks
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00200-iopenalex-snapshot
Optimal priority assignment for aperiodic tasks with firm deadlines in fixed priority pre-emptive systems
inferred← citeshttps://doi.org/10.1016/j.sysarc.2018.01.005openalex-snapshot
Job-shifting: An algorithm for online admission of non-preemptive aperiodic tasks in safety critical systems
inferred← citeshttps://doi.org/10.1016/s0140-3664(00)00276-0openalex-snapshot
Schemes for scheduling control messages by hierarchical protocols
inferred← citeshttps://doi.org/10.1016/s0164-1212(03)00079-7openalex-snapshot
New methods for redistributing slack time in real-time systems: applications and comparative evaluations
inferred← citeshttps://doi.org/10.1016/s1383-7621(99)00009-0openalex-snapshot
Schedulability analysis of periodic and aperiodic tasks with resource constraints
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)36351-6openalex-snapshot
A Scheduling Simulator for Real-Time Distributed System
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)44873-7openalex-snapshot
Scheduling Aperiodic Tasks in Fixed-Priority Preemptive Systems
inferred← citeshttps://doi.org/10.1023/a:1008093629946openalex-snapshot
The EDL Server for Scheduling Periodic and Soft Aperiodic Tasks with Resource Constraints
inferred← citeshttps://doi.org/10.1023/b:time.0000045315.61234.1eopenalex-snapshot
Real Time Scheduling Theory: A Historical Perspective
inferred← citeshttps://doi.org/10.1023/b:time.0000048932.30002.d9openalex-snapshot
Rate Monotonic vs. EDF: Judgment Day
inferred← citeshttps://doi.org/10.1093/comjnl/43.1.65openalex-snapshot
The Reduced Ceiling Protocol for Concurrency Control in Real-time Databases with Mixed Transactions
inferred← citeshttps://doi.org/10.1109/12.805154openalex-snapshot
Optimal deadline assignment for scheduling soft aperiodic tasks in hard real-time environments
inferred← citeshttps://doi.org/10.1109/32.979988openalex-snapshot
Engineering dynamic real-time distributed systems: architecture, system description language, and middleware
inferred← citeshttps://doi.org/10.1109/aina.2013.103openalex-snapshot
Scheduling of Sporadic Tasks with Deadline Constrains in Cloud Environments
inferred← citeshttps://doi.org/10.1109/ecrts.2007.32openalex-snapshot
Supporting Deliberative Real-Time AI Systems: A Fixed Priority Scheduling Approach
inferred← citeshttps://doi.org/10.1109/emrts.2001.933990openalex-snapshot
Three obstacles to flexible scheduling
inferred← citeshttps://doi.org/10.1109/iceccs.1997.622295openalex-snapshot
Optimal deadline assignment for scheduling soft aperiodic tasks in hard real-time environments
inferred← citeshttps://doi.org/10.1109/icpp.2011.69openalex-snapshot
Combining Hard Periodic and Soft Aperiodic Real-Time Task Scheduling on Heterogeneous Compute Resources
inferred← citeshttps://doi.org/10.1109/infcom.1998.665111openalex-snapshot
Schemes for scheduling of control messages by hierarchical protocols
inferred← citeshttps://doi.org/10.1109/lpe.2003.1231934openalex-snapshot
Dynamic voltage scaling algorithm for fixed-priority real-time systems using work-demand analysis
inferred← citeshttps://doi.org/10.1109/milcom.2016.7795345openalex-snapshot
A delay efficient multiclass packet scheduler for heterogeneous M2M uplink
inferred← citeshttps://doi.org/10.1109/real.1995.495199openalex-snapshot
Value vs. deadline scheduling in overload conditions
inferred← citeshttps://doi.org/10.1109/real.1999.818856openalex-snapshot
Sharing resources among periodic and aperiodic tasks with dynamic deadlines
inferred← citeshttps://doi.org/10.1109/real.2001.990607openalex-snapshot
Aperiodic servers with resource constraints
inferred← citeshttps://doi.org/10.1109/rtas.2006.46openalex-snapshot
Zygaria: Storage Performance as a Managed Resource
inferred← citeshttps://doi.org/10.1109/rtcsa.1998.726425openalex-snapshot
Simulation and tracing of hybrid task sets on distributed systems
inferred← citeshttps://doi.org/10.1109/rtcsa.1999.811293openalex-snapshot
Soft aperiodic task scheduling on hard real-time multiprocessor 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.2014.6910548openalex-snapshot
An adaptive server-based scheduling framework with capacity reclaiming and borrowing
inferred← citeshttps://doi.org/10.1109/rtcsa.2017.8046318openalex-snapshot
Online admission of non-preemptive aperiodic mixed-critical tasks in hierarchic schedules
inferred← citeshttps://doi.org/10.1109/rtss.2005.26openalex-snapshot
Improving Soft Real-Time Performance through Better Slack Reclaiming
inferred← citeshttps://doi.org/10.1109/rtss.2006.14openalex-snapshot
Compliance Enforcement of Temporal and Dosage Constraints
inferred← citeshttps://doi.org/10.1109/rttas.1995.516213openalex-snapshot
Probabilistic performance guarantee for real-time tasks with varying computation times
inferred← citeshttps://doi.org/10.1109/rttas.1999.777656openalex-snapshot
A responsiveness approach for scheduling fault recovery in real-time systems
inferred← citeshttps://doi.org/10.1109/rttas.2002.1137380openalex-snapshot
Supporting a low delay best-effort class in the presence of real-time traffic
inferred← citeshttps://doi.org/10.1109/sase-case.2015.7295845openalex-snapshot
FreeRTOS user mode scheduler for mixed critical 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/syscon.2016.7490665openalex-snapshot
An online delay efficient packet scheduler for M2M traffic in industrial automation
inferred← citeshttps://doi.org/10.1109/tc.2002.1024741openalex-snapshot
Using application benefit for proactive resource allocation in asynchronous real-time distributed systems
inferred← citeshttps://doi.org/10.1109/tse.2011.95openalex-snapshot
Analyzing the Effect of Gain Time on Soft-Task Scheduling Policies in Real-Time Systems
inferred← citeshttps://doi.org/10.1145/240799.240802openalex-snapshot
Scheduling soft aperiodic tasks in adaptable fixed-priority systems
inferred← citeshttps://doi.org/10.1145/871506.871605openalex-snapshot
Dynamic voltage scaling algorithm for fixed-priority real-time systems using work-demand analysis
inferred← citeshttps://doi.org/10.26599/tst.2025.9010031openalex-snapshot
Research on the Schedulability of Sporadic Tasks in Spaceborne Mixed Real-Time Operating System
inferred← citeshttps://doi.org/10.3390/electronics8111286openalex-snapshot
Online Slack-Stealing Scheduling with Modified laEDF in Real-Time Systems
inferred← citeshttps://doi.org/10.3390/su15053972openalex-snapshot
Earliest Deadline First Scheduling for Real-Time Computing in Sustainable Sensors
inferred← citeshttps://doi.org/10.3850/9783981537079_0739openalex-snapshot
Improving Performance by Monitoring While Maintaining Worst-Case Guarantees
inferred← citeshttps://doi.org/10.3929/ethz-a-004613044openalex-snapshot
System-level timing analysis and scheduling for embedded packet processors
inferred← citeshttps://doi.org/10.3929/ethz-a-005328667openalex-snapshot
Modular performance analysis and interface-based design for embedded real-time systems
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.651-653.1933openalex-snapshot
Schedulability Analysis of Fixed Priority Servers for Scheduling Aperiodic Real-Time Tasks – A Review
inferred← citeshttps://doi.org/10.5821/dissertation-2117-93344openalex-snapshot
Planificación global en sistemas multiprocesador de tiempo real
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.