On the public citation graph
A new algorithm for scheduling periodic, real-time tasks
0 signed · 115 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.1016/0020-0190(80)90123-4openalex-snapshot
A note on preemptive scheduling of periodic, real-time tasks
inferredcites →https://doi.org/10.1016/0020-0190(81)90066-1openalex-snapshot
Scheduling periodically occurring tasks on multiple processors
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.1145/1478873.1478995openalex-snapshot
Scheduling of time critical processes
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/opre.26.1.127openalex-snapshot
On a Real-Time Scheduling Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.869openalex-snapshot
Simulation of resource synchronization in a dynamic real‐time distributed computing environment
inferred← citeshttps://doi.org/10.1007/11596356_50openalex-snapshot
Hardware Task Scheduling and Placement in Operating Systems for Dynamically Reconfigurable SoC
inferred← citeshttps://doi.org/10.1007/11807964_76openalex-snapshot
Predictability of Least Laxity First Scheduling Algorithm on Multiprocessor Real-Time Systems
inferred← citeshttps://doi.org/10.1007/bf01187034openalex-snapshot
Schedulers for larger classes of pinwheel instances
inferred← citeshttps://doi.org/10.1007/bf01940883openalex-snapshot
Proportionate Progress: A Notion of Fairness in Resource Allocation
inferred← citeshttps://doi.org/10.1007/bf01995675openalex-snapshot
Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor
inferred← citeshttps://doi.org/10.1007/bfb0029605openalex-snapshot
On preemptive scheduling of periodic, real-time tasks on one processor
inferred← citeshttps://doi.org/10.1007/s00453-001-0068-9openalex-snapshot
Optimal Time-Critical Scheduling via Resource Augmentation
inferred← citeshttps://doi.org/10.1007/s00453-002-0938-9openalex-snapshot
Pinwheel Scheduling: Achievable Densities
inferred← citeshttps://doi.org/10.1007/s004530010048openalex-snapshot
Errata: A New Algorithm for Scheduling Periodic, Real-Time Tasks
inferred← citeshttps://doi.org/10.1007/s11241-009-9073-xopenalex-snapshot
Optimal virtual cluster-based multiprocessor scheduling
inferred← citeshttps://doi.org/10.1007/s11241-011-9130-0openalex-snapshot
DP-Fair: a unifying theory for optimal hard real-time multiprocessor scheduling
inferred← citeshttps://doi.org/10.1007/s11241-012-9149-xopenalex-snapshot
FPSL, FPCL and FPZL schedulability analysis
inferred← citeshttps://doi.org/10.1007/s11241-012-9157-xopenalex-snapshot
Laxity dynamics and LLF schedulability analysis on multiprocessor platforms
inferred← citeshttps://doi.org/10.1007/s11241-017-9293-4openalex-snapshot
Automated competitive analysis of real-time scheduling with graph games
inferred← citeshttps://doi.org/10.1007/s11241-020-09360-1openalex-snapshot
Tardiness bounds for fixed-priority global scheduling without intra-task precedence constraints
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90360-6openalex-snapshot
Feasibility problems for recurring tasks on one processor
inferred← citeshttps://doi.org/10.1016/b978-0-12-809927-8.00021-xopenalex-snapshot
Scheduling packets
inferred← citeshttps://doi.org/10.1016/j.cja.2016.04.016openalex-snapshot
A hazard analysis via an improved timed colored petri net with time–space coupling safety constraint
inferred← citeshttps://doi.org/10.1016/j.comnet.2023.109632openalex-snapshot
Packet rank-aware active queue management for programmable flow scheduling
inferred← citeshttps://doi.org/10.1016/j.comnet.2023.110164openalex-snapshot
Inversion impact of approximate PIFO to Start-Time Fair Queueing
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2015.07.003openalex-snapshot
An unfair semi-greedy real-time multiprocessor scheduling algorithm
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.01.057openalex-snapshot
Efficient scheduling of periodic information monitoring requests
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.12.007openalex-snapshot
A new fair scheduling algorithm for periodic tasks on multiprocessors
inferred← citeshttps://doi.org/10.1016/j.jss.2011.07.002openalex-snapshot
Zero-laxity based real-time multiprocessor scheduling
inferred← citeshttps://doi.org/10.1016/j.jss.2013.09.029openalex-snapshot
Demand-based schedulability analysis for real-time multi-core scheduling
inferred← citeshttps://doi.org/10.1016/j.jss.2014.11.019openalex-snapshot
Capturing urgency and parallelism using quasi-deadlines for real-time multiprocessor scheduling
inferred← citeshttps://doi.org/10.1016/s0005-1098(96)00245-2openalex-snapshot
LSTF: A new scheduling policy for complex real-time tasks in multiple processor systems
inferred← citeshttps://doi.org/10.1016/s0045-7906(00)00025-2openalex-snapshot
Bounds on tardiness in scheduling of precedence-constrained unit real-time task systems
inferred← citeshttps://doi.org/10.1016/s0164-1212(02)00147-4openalex-snapshot
Genetic-algorithm-based real-time task scheduling with multiple goals
inferred← citeshttps://doi.org/10.1023/a:1008993532472openalex-snapshot
Multi-Valued Performance Metrics for Real-Time Embedded Systems
inferred← citeshttps://doi.org/10.1023/a:1025120124771openalex-snapshot
Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors
inferred← citeshttps://doi.org/10.1023/a:1025180310659openalex-snapshot
Reactive and Real-Time Systems Course: How to Get the Most Out of it
inferred← citeshttps://doi.org/10.1109/12.144627openalex-snapshot
General schedulers for the pinwheel problem based on double-integer reduction
inferred← citeshttps://doi.org/10.1109/12.729793openalex-snapshot
Minimum achievable utilization for fault-tolerant processing of periodic tasks
inferred← citeshttps://doi.org/10.1109/40.296154openalex-snapshot
Codesign of architectures for automotive powertrain modules
inferred← citeshttps://doi.org/10.1109/92.974897openalex-snapshot
Estimating probabilistic timing performance for real-time embedded systems
inferred← citeshttps://doi.org/10.1109/access.2020.3037965openalex-snapshot
A Study on Heuristic Task Scheduling Optimizing Task Deadline Violations in Heterogeneous Computational Environments
inferred← citeshttps://doi.org/10.1109/cdc.2003.1271832openalex-snapshot
Online scheduling: generalized pinwheel problem
inferred← citeshttps://doi.org/10.1109/ecrts.2010.34openalex-snapshot
DP-FAIR: A Simple Model for Understanding Optimal Multiprocessor Scheduling
inferred← citeshttps://doi.org/10.1109/emrts.1999.777472openalex-snapshot
Fault tolerant real-time global scheduling on multiprocessors
inferred← citeshttps://doi.org/10.1109/emwrt.1993.639067openalex-snapshot
An Event Model for Deadline Verification of Hard Real-Time Systems
inferred← citeshttps://doi.org/10.1109/iccc59590.2023.10507624openalex-snapshot
OWFQ: Reducing Packet Drops for Approximate Weighted Fair Queueing with Calendar Queues
inferred← citeshttps://doi.org/10.1109/icccn65249.2025.11134021openalex-snapshot
CT-PIFO: A Congruity Tree Based Packet Scheduler to Improve Flow Completion Time
inferred← citeshttps://doi.org/10.1109/iccect60629.2024.10545661openalex-snapshot
A Programmable Packet Scheduling Method Based on Traffic Rate
inferred← citeshttps://doi.org/10.1109/icdcs.2017.204openalex-snapshot
S3: Joint Scheduling and Source Selection for Background Traffic in Erasure-Coded Storage
inferred← citeshttps://doi.org/10.1109/isorc.2006.64openalex-snapshot
Predictability of Earliest Deadline Zero Laxity Algorithm for Multiprocessor Real-Time Systems
inferred← citeshttps://doi.org/10.1109/isorc.2018.00032openalex-snapshot
SITSA-RT: An Information Theory Inspired Real-Time Multiprocessor Scheduler
inferred← citeshttps://doi.org/10.1109/les.2017.2761540openalex-snapshot
Real-Time Multiprocessor Scheduling Algorithm Based on Information Theory Principles
inferred← citeshttps://doi.org/10.1109/mc.2002.999778openalex-snapshot
Deterministic preemptive scheduling of real-time tasks
inferred← citeshttps://doi.org/10.1109/real.1989.63554openalex-snapshot
Toward the deterministic scheduling of Ada tasks
inferred← citeshttps://doi.org/10.1109/real.1995.495201openalex-snapshot
Skip-Over: algorithms and complexity for overloaded systems that allow skips
inferred← citeshttps://doi.org/10.1109/real.2004.20openalex-snapshot
Feasibility Analysis of Preemptive Real-Time Systems upon Heterogeneous Multiprocessor Platforms
inferred← citeshttps://doi.org/10.1109/rtas61025.2024.00010openalex-snapshot
Integrating Sporadic Events in Time-triggered Systems via Affine Envelope Approximations
inferred← citeshttps://doi.org/10.1109/rtcsa.2000.896409openalex-snapshot
Fixed-priority preemptive multiprocessor scheduling: to partition or not to partition
inferred← citeshttps://doi.org/10.1109/rtcsa.2014.6910541openalex-snapshot
A hardware architecture to deploy complex multiprocessor scheduling algorithms
inferred← citeshttps://doi.org/10.1109/rtss.2009.15openalex-snapshot
Multi-layer Bus Optimization for Real-Time Task Scheduling with Chain-Based Precedence Constraints
inferred← citeshttps://doi.org/10.1109/rtss.2010.13openalex-snapshot
LLF Schedulability Analysis on Multiprocessor Platforms
inferred← citeshttps://doi.org/10.1109/rtss.2016.039openalex-snapshot
Computational Complexity and Speedup Factors Analyses for Self-Suspending Tasks
inferred← citeshttps://doi.org/10.1109/tc.2011.200openalex-snapshot
Multilayer Bus Optimization for Real-Time Embedded Systems
inferred← citeshttps://doi.org/10.1109/tc.2012.279openalex-snapshot
Preempt a Job or Not in EDF Scheduling of Uniprocessor Systems
inferred← citeshttps://doi.org/10.1109/tc.2014.2308183openalex-snapshot
Composition of Schedulability Analyses for Real-Time Multiprocessor Systems
inferred← citeshttps://doi.org/10.1109/tnet.2009.2017928openalex-snapshot
On Bandwidth Tiered Service
inferred← citeshttps://doi.org/10.1109/tnet.2024.3481152openalex-snapshot
Enabling Rank-Based P4 Programmable Schedulers: Requirements, Implementation, and Evaluation on BMv2 Switches
inferred← citeshttps://doi.org/10.1109/tnsm.2023.3304894openalex-snapshot
DR-PIFO: A Dynamic Ranking Packet Scheduler Using a Push-In-First-Out Queue
inferred← citeshttps://doi.org/10.1109/ton.2025.3531129openalex-snapshot
RIFO: Pushing the Efficiency of Programmable Packet Schedulers
inferred← citeshttps://doi.org/10.1109/tpds.2013.2297098openalex-snapshot
Improvement of Real-Time Multi-CoreSchedulability with Forced Non-Preemption
inferred← citeshttps://doi.org/10.1109/tpds.2016.2533615openalex-snapshot
Time-Reversibility for Real-Time Scheduling on Multiprocessor Systems
inferred← citeshttps://doi.org/10.1109/tpds.2018.2845845openalex-snapshot
Joint Scheduling and Source Selection for Background Traffic in Erasure-Coded Storage
inferred← citeshttps://doi.org/10.1109/trustcom.2016.0341openalex-snapshot
On the Definition of Real-Time: Applications and Systems
inferred← citeshttps://doi.org/10.1109/tse.2019.2898976openalex-snapshot
Generic Adaptive Scheduling for Efficient Context Inconsistency Detection
inferred← citeshttps://doi.org/10.1145/1375457.1375522openalex-snapshot
Exploring the throughput-fairness tradeoff of deadline scheduling in heterogeneous computing environments
inferred← citeshttps://doi.org/10.1145/2494530openalex-snapshot
Contention-free executions for real-time multiprocessor scheduling
inferred← citeshttps://doi.org/10.1145/2516821.2516848openalex-snapshot
Feasibility intervals for homogeneous multicores, asynchronous periodic tasks, and FJP schedulers
inferred← citeshttps://doi.org/10.1145/258533.258570openalex-snapshot
Optimal time-critical scheduling via resource augmentation (extended abstract)
inferred← citeshttps://doi.org/10.1145/2834050.2834106openalex-snapshot
Towards Programmable Packet Scheduling
inferred← citeshttps://doi.org/10.1145/2934872.2934899openalex-snapshot
Programmable Packet Scheduling at Line Rate
inferred← citeshttps://doi.org/10.1145/3063713openalex-snapshot
Scheduling for Cloud-Based Computing Systems to Support Soft Real-Time Applications
inferred← citeshttps://doi.org/10.1145/334012.334026openalex-snapshot
Fast performance prediction for periodic task systems
inferred← citeshttps://doi.org/10.1145/3447818.3460362openalex-snapshot
Delay sensitivity-driven congestion mitigation for HPC systems
inferred← citeshttps://doi.org/10.1145/3452296.3472887openalex-snapshot
Programmable packet scheduling with a single queue
inferred← citeshttps://doi.org/10.1145/3600006.3613170openalex-snapshot
RackBlox: A Software-Defined Rack-Scale Storage System with Network-Storage Co-Design
inferred← citeshttps://doi.org/10.1145/3622845openalex-snapshot
Formal Abstractions for Packet Scheduling
inferred← citeshttps://doi.org/10.1145/3774651openalex-snapshot
On-Demand Regular Expression Matching on FPGAs for Efficient Deep Packet Inspection
inferred← citeshttps://doi.org/10.14257/ijmue.2015.10.7.18openalex-snapshot
On-Line Dynamic Voltage Scaling for EDZL Scheduling on Symmetric Multiprocessor Real-Time Systems
inferred← citeshttps://doi.org/10.14801/jkiit.2018.16.2.29openalex-snapshot
Multi-Level Contention-Free Policy for Rate Monotonic Scheduling Algorithm on Real-Time Systems
inferred← citeshttps://doi.org/10.14801/jkiit.2019.17.9.31openalex-snapshot
Response-Time Analysis for Contention-Free Fixed-Priority Scheduling Algorithm
inferred← citeshttps://doi.org/10.1587/transcom.e92.b.2739openalex-snapshot
A Scheduling Algorithm for Minimizing Exclusive Window Durations in Time-Triggered Controller Area Network
inferred← citeshttps://doi.org/10.3233/fi-1999-402305openalex-snapshot
General Response Time Computation for the Deadline Driven Scheduling of Periodic Tasks
inferred← citeshttps://doi.org/10.3390/app131810131openalex-snapshot
A Comparative Study on the Schedulability of the EDZL Scheduling Algorithm on Multiprocessors
inferred← citeshttps://doi.org/10.3745/kipsta.2009.16a.6.437openalex-snapshot
A Laxity Based On-line Real-Time Scheduling Algorithm for Multiprocessor Systems
inferred← citeshttps://doi.org/10.3745/kipsta.2010.17a.6.259openalex-snapshot
A Real-Time Scheduling Algorithm for Tasks with Shared Resources on Multiprocessor Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1012.5929openalex-snapshot
Exact Schedulability Test for global-EDF Scheduling of Periodic Hard Real-Time Tasks on Identical Multiprocessors
inferred← citeshttps://doi.org/10.48550/arxiv.1101.1718openalex-snapshot
Precise Schedulability Analysis for unfeasible to notify separately for comprehensive - EDF Scheduling of interrupted Hard Real-Time Tasks on the similar Multiprocessors
inferred← citeshttps://doi.org/10.48550/arxiv.1510.03551openalex-snapshot
Universal Packet Scheduling
inferred← citeshttps://doi.org/10.48550/arxiv.1602.06045openalex-snapshot
Programmable Packet Scheduling
inferred← citeshttps://doi.org/10.48550/arxiv.2007.01375openalex-snapshot
LSTFCoDel: CoDel with LSTF-Style Priority Queuing
inferred← citeshttps://doi.org/10.70675/64b7c0bezd629z4211z9e45z7e2b1a6d6670openalex-snapshot
Using statistical methods to model and estimate the time variability of programs executed on multicore architectures
inferred← citeshttps://doi.org/10.70675/807a2565zc27fz441fzb8d8zfae60f0c133bopenalex-snapshot
Scheduling sequential or parallel hard real-time pre-emptive tasks upon identical multiprocessor platforms
inferred← citeshttps://doi.org/10.70675/8ea528dfz70f5z4f61z83f8z822b93d5be62openalex-snapshot
Sûreté temporelle pour les systèmes temps réel multiprocesseurs
inferred← citeshttps://doi.org/10.7603/s40601-013-0043-8openalex-snapshot
LLFRP: An Energy Efficient Variant of LLF with Reduced Pre-emptions for Real – Time 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.