On the public citation graph
Predictability of Earliest Deadline Zero Laxity Algorithm for Multiprocessor Real-Time Systems
0 signed · 37 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/bf01553887openalex-snapshot
A new algorithm for scheduling periodic, real-time tasks
inferredcites →https://doi.org/10.1007/s004530010048openalex-snapshot
Errata: A New Algorithm for Scheduling Periodic, Real-Time Tasks
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/s0020-0190(02)00231-4openalex-snapshot
Deadline-based scheduling of periodic task systems on multiprocessors
inferredcites →https://doi.org/10.1023/a:1025120124771openalex-snapshot
Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors
inferredcites →https://doi.org/10.1093/ietisy/e88-d.3.658openalex-snapshot
Comparison of Deadline-Based Scheduling Algorithms for Periodic Real-Time Tasks on Multiprocessor
inferredcites →https://doi.org/10.1109/32.58762openalex-snapshot
Multiprocessor online scheduling of hard-real-time tasks
inferredcites →https://doi.org/10.1109/icdcs.1994.302407openalex-snapshot
Validating timing constraints in multiprocessor and distributed real-time systems
inferredcites →https://doi.org/10.1109/mc.2003.1193230openalex-snapshot
A formal approach to mpsoc performance verification
inferredcites →https://doi.org/10.1109/real.2003.1253270openalex-snapshot
Scheduling analysis integration for heterogeneous multiprocessor SoC
inferredcites →https://doi.org/10.1109/tc.2004.16openalex-snapshot
Optimal utilization bounds for the fixed-priority scheduling of periodic task systems on identical multiprocessors
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.2139/ssrn.3331997openalex-extracted
Developing the Best Scheduling Algorithm From Existing Algorithms for Real Time Operating Systems
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/978-3-540-77096-1_5openalex-snapshot
Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks
inferred← citeshttps://doi.org/10.1007/s11241-009-9089-2openalex-snapshot
Generalized tardiness bounds for global multiprocessor scheduling
inferred← citeshttps://doi.org/10.1007/s11241-012-9149-xopenalex-snapshot
FPSL, FPCL and FPZL schedulability analysis
inferred← citeshttps://doi.org/10.1016/j.sysarc.2011.01.002openalex-snapshot
Global EDF-based scheduling with laxity-driven priority promotion
inferred← citeshttps://doi.org/10.1109/ecrts.2009.25openalex-snapshot
Sustainable Multiprocessor Scheduling of Sporadic Task Systems
inferred← citeshttps://doi.org/10.1109/rtas.2010.35openalex-snapshot
A Bandwidth Reservation Strategy for Multiprocessor Real-Time Scheduling
inferred← citeshttps://doi.org/10.1109/rtcsa.2007.34openalex-snapshot
Current Results on EDZL Scheduling for Multiprocessor Real-Time Systems
inferred← citeshttps://doi.org/10.1109/rtcsa.2008.11openalex-snapshot
Global EDF-Based Scheduling with Efficient Priority Promotion
inferred← citeshttps://doi.org/10.1109/rtcsa.2008.13openalex-snapshot
An Implementation of the PCP, SRP, D-PCP, M-PCP, and FMLP Real-Time Synchronization Protocols in LITMUS^RT
inferred← citeshttps://doi.org/10.1109/rtss.2007.26openalex-snapshot
Utilization-Bound Based Schedulability Analysis of Weighted Round Robin Schedulers
inferred← citeshttps://doi.org/10.1109/rtss.2007.33openalex-snapshot
Generalized Tardiness Bounds for Global Multiprocessor Scheduling
inferred← citeshttps://doi.org/10.1109/rtss.2011.17openalex-snapshot
RUN: Optimal Multiprocessor Real-Time Scheduling via Reduction to Uniprocessor
inferred← citeshttps://doi.org/10.1142/s0129054116500015openalex-snapshot
EDZL Scheduling and Schedulability Analysis for Performance Asymmetric Multiprocessors
inferred← citeshttps://doi.org/10.1145/1450058.1450078openalex-snapshot
Portioned EDF-based scheduling on multiprocessors
inferred← citeshttps://doi.org/10.1145/1978802.1978814openalex-snapshot
A survey of hard real-time scheduling for multiprocessor systems
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.3390/app131810131openalex-snapshot
A Comparative Study on the Schedulability of the EDZL Scheduling Algorithm on Multiprocessors
inferred← citeshttps://doi.org/10.5120/12834-9974openalex-snapshot
Aggregation of EDF and ACO for Enhancing Real Time System Performance
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.