On the public citation graph
FPZL Schedulability Analysis
0 signed · 67 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/11795490_24openalex-snapshot
New Schedulability Tests for Real-Time Task Sets Scheduled by Deadline Monotonic on Multiprocessors
inferredcites →https://doi.org/10.1007/s11241-005-0507-9openalex-snapshot
Measuring the Performance of Schedulability Tests
inferredcites →https://doi.org/10.1007/s11241-010-9106-5openalex-snapshot
Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
inferredcites →https://doi.org/10.1016/j.ipl.2008.02.014openalex-snapshot
Schedulability issues for EDZL scheduling on real-time multiprocessor systems
inferredcites →https://doi.org/10.1016/s0020-0190(00)00165-4openalex-snapshot
On priority assignment in fixed priority scheduling
inferredcites →https://doi.org/10.1016/s0022-0000(73)80033-9openalex-snapshot
Time bounds for selection
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/ecrts.2009.25openalex-snapshot
Sustainable Multiprocessor Scheduling of Sporadic Task Systems
inferredcites →https://doi.org/10.1109/ecrts.2009.31openalex-snapshot
Implementation of a Speedup-Optimal Global EDF Schedulability Test
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/isorc.2006.64openalex-snapshot
Predictability of Earliest Deadline Zero Laxity Algorithm for Multiprocessor Real-Time Systems
inferredcites →https://doi.org/10.1109/real.2003.1253260openalex-snapshot
Multiprocessor EDF and deadline monotonic schedulability analysis
inferredcites →https://doi.org/10.1109/rtcsa.2008.11openalex-snapshot
Global EDF-Based Scheduling with Efficient Priority Promotion
inferredcites →https://doi.org/10.1109/rtss.2006.10openalex-snapshot
An Optimal Real-Time Scheduling Algorithm for Multiprocessors
inferredcites →https://doi.org/10.1109/rtss.2006.7openalex-snapshot
A Necessary and Sometimes Sufficient Condition for the Feasibility of Sets of Sporadic Hard-Deadline Tasks
inferredcites →https://doi.org/10.1109/rtss.2007.31openalex-snapshot
Response-Time Analysis for Globally Scheduled Symmetric Multiprocessor Platforms
inferredcites →https://doi.org/10.1109/rtss.2007.35openalex-snapshot
Techniques for Multiprocessor Global Schedulability Analysis
inferredcites →https://doi.org/10.1109/rtss.2007.41openalex-snapshot
Adapting Futures: Scalability for Real-World Computing
inferredcites →https://doi.org/10.1109/rtss.2009.11openalex-snapshot
New Response Time Bounds for Fixed Priority Multiprocessor Scheduling
inferredcites →https://doi.org/10.1109/rtss.2009.31openalex-snapshot
Priority Assignment for Global Fixed Priority Pre-Emptive Scheduling in Multiprocessor Real-Time Systems
inferredcites →https://doi.org/10.1109/tencon.1994.369148openalex-snapshot
On-line multiprocessor scheduling algorithms for real-time tasks
inferredcites →https://doi.org/10.1109/tpds.2008.129openalex-snapshot
Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms
inferredcites →https://doi.org/10.1145/1978802.1978814openalex-snapshot
A survey of hard real-time scheduling for multiprocessor systems
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-642-25873-2_24openalex-snapshot
Partially Non-Preemptive Dual Priority Multiprocessor Scheduling
inferred← citeshttps://doi.org/10.1007/978-981-16-7443-3_7openalex-snapshot
A Survey of Real-Time Scheduling on Multiprocessor Systems
inferred← citeshttps://doi.org/10.1007/s10626-019-00285-xopenalex-snapshot
Energy-efficient thermal-aware multiprocessor scheduling for real-time tasks using TCPN
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-014-9207-7openalex-snapshot
Scheduling algorithms to reduce the static energy consumption of real-time systems
inferred← citeshttps://doi.org/10.1007/s11241-021-09367-2openalex-snapshot
Dynamic power management under the RUN scheduling algorithm: a slack filling approach
inferred← citeshttps://doi.org/10.1007/s11786-019-00395-7openalex-snapshot
Processor Bounding for an Efficient Non-preemptive Task Scheduling Algorithm
inferred← citeshttps://doi.org/10.1016/j.ifacol.2018.06.307openalex-snapshot
Energy-Efficient Thermal-Aware Scheduling for RT Tasks Using TCPN
inferred← citeshttps://doi.org/10.1016/j.jpdc.2014.06.011openalex-snapshot
Using an adversary simulator to evaluate global EDF scheduling of sporadic task sets 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.2012.09.002openalex-snapshot
On using adversary simulators to evaluate global fixed-priority and FPZL scheduling of multiprocessors
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/j.jss.2019.04.067openalex-snapshot
Improved schedulability analysis of the contention-free policy for real-time systems
inferred← citeshttps://doi.org/10.1038/s41598-024-80910-4openalex-snapshot
Optimizing multiprocessor performance in real-time systems using an innovative genetic algorithm approach
inferred← citeshttps://doi.org/10.1109/access.2018.2886562openalex-snapshot
Flow Network-Based Real-Time Scheduling for Reducing Static Energy Consumption on Multiprocessors
inferred← citeshttps://doi.org/10.1109/cbsec.2012.9openalex-snapshot
A Heterogeneous Preemptive and Non-preemptive Scheduling Approach for Real-Time Systems on Multiprocessors
inferred← citeshttps://doi.org/10.1109/etfa.2011.6059012openalex-snapshot
Laxity-based restricted-migration scheduling
inferred← citeshttps://doi.org/10.1109/jac-ecc48896.2019.9051189openalex-snapshot
An Evolutionary Fuzzy based Scheduling Algorithm for Soft Real-Time Multiprocessor Systems
inferred← citeshttps://doi.org/10.1109/rtas.2012.33openalex-snapshot
Schedulability Analysis and Priority Assignment for Global Job-Level Fixed-Priority Multiprocessor Scheduling
inferred← citeshttps://doi.org/10.1109/rtcsa.2013.6732198openalex-snapshot
Global fixed priority scheduling with deferred pre-emption
inferred← citeshttps://doi.org/10.1109/rtss.2017.00038openalex-snapshot
Beyond Implicit-Deadline Optimality: A Multiprocessor Scheduling Framework for Constrained-Deadline Tasks
inferred← citeshttps://doi.org/10.1109/synasc.2015.32openalex-snapshot
An Improved Upper-Bound Algorithm for Non-preemptive Task Scheduling
inferred← citeshttps://doi.org/10.1109/synasc.2016.035openalex-snapshot
Resource Bounding for Non-Preemptive Task Scheduling on a Multiprocessor Platform
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/tpds.2016.2533615openalex-snapshot
Time-Reversibility for Real-Time Scheduling on Multiprocessor Systems
inferred← citeshttps://doi.org/10.1145/2245276.2232029openalex-snapshot
On using adversary simulators to obtain tight lower bounds for response times
inferred← citeshttps://doi.org/10.1145/2494530openalex-snapshot
Contention-free executions for real-time multiprocessor scheduling
inferred← citeshttps://doi.org/10.1145/2516821.2516839openalex-snapshot
A scheduling algorithm to reduce the static energy consumption of multiprocessor real-time systems
inferred← citeshttps://doi.org/10.1145/2739954openalex-snapshot
Global and Partitioned Multiprocessor Fixed Priority Scheduling with Deferred Preemption
inferred← citeshttps://doi.org/10.1145/3269482.3269486openalex-snapshot
Bounding execution resources for the task scheduling problem in cyber-physical systems
inferred← citeshttps://doi.org/10.2478/s13537-011-0023-zopenalex-snapshot
Genealogy of hard real-time preemptive scheduling algorithms for identical multiprocessors
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.3390/math11163547openalex-snapshot
Contention-Free Scheduling for Single Preemption Multiprocessor Platforms
inferred← citeshttps://doi.org/10.34626/nfq4-be32openalex-snapshot
Real-Time Scheduling on Multi-core: Theory and Practice
inferred← citeshttps://doi.org/10.5220/0005008903210329openalex-snapshot
A Necessary Test for Fixed-Priority Real-Time Multiprocessor Systems based on Lazy-adversary Simulation
inferred← citeshttps://doi.org/10.70675/4f374b8dz5fb0z4537zb8eaz04f320422ae5openalex-snapshot
Aide à la validation temporelle et au dimensionnement de systèmes temps réels dans une démarche dirigée par modèles
inferred← citeshttps://doi.org/10.70675/8ea528dfz70f5z4f61z83f8z822b93d5be62openalex-snapshot
Sûreté temporelle pour les systèmes temps réel multiprocesseurs
showing the first 39 of 40 · page through all 40
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.