On the public citation graph
Schedulability Analysis and Priority Assignment for Global Job-Level Fixed-Priority Multiprocessor Scheduling
0 signed · 43 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/978-3-540-92221-6_7openalex-snapshot
Global Static-Priority Preemptive Multiprocessor Scheduling with Utilization Bound 38%
inferredcites →https://doi.org/10.1007/bf01940883openalex-snapshot
Proportionate Progress: A Notion of Fairness in Resource Allocation
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/b978-155860702-6/50016-8openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
inferredcites →https://doi.org/10.1016/s0020-0190(00)00165-4openalex-snapshot
On priority assignment in fixed priority scheduling
inferredcites →https://doi.org/10.1023/a:1025120124771openalex-snapshot
Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors
inferredcites →https://doi.org/10.1109/32.58762openalex-snapshot
Multiprocessor online scheduling of hard-real-time tasks
inferredcites →https://doi.org/10.1109/ecrts.2005.18openalex-snapshot
Improved Schedulability Analysis of EDF on Multiprocessor Platforms
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/real.2003.1253260openalex-snapshot
Multiprocessor EDF and deadline monotonic schedulability analysis
inferredcites →https://doi.org/10.1109/rtas.2011.30openalex-snapshot
Maximizing Contention-Free Executions in Multiprocessor Scheduling
inferredcites →https://doi.org/10.1109/rtcsa.2000.896409openalex-snapshot
Fixed-priority preemptive multiprocessor scheduling: to partition or not to partition
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.2008.44openalex-snapshot
Scheduling Arbitrary-Deadline Sporadic Task Systems on Multiprocessors
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/rtss.2010.13openalex-snapshot
LLF Schedulability Analysis on Multiprocessor Platforms
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.2005.88openalex-snapshot
An analysis of EDF schedulability on a multiprocessor
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/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/978-3-031-10461-9_15openalex-snapshot
A Hybrid Real-Time Scheduling Mechanism Based on Multiprocessor for Real-Time Tasks in Weakly Hard Specification
inferred← citeshttps://doi.org/10.1007/978-981-10-8797-4_40openalex-snapshot
Empirical Evaluation of a Real-Time Task Priority Procedure on Small/Medium-Scale Multi-core Systems
inferred← citeshttps://doi.org/10.1007/s11241-013-9190-4openalex-snapshot
Fair lateness scheduling: reducing maximum lateness in G-EDF-like scheduling
inferred← citeshttps://doi.org/10.1016/j.aci.2017.03.002openalex-snapshot
Combining loop unrolling strategies and code predication to reduce the worst-case execution time of real-time software
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.2014.11.019openalex-snapshot
Capturing urgency and parallelism using quasi-deadlines for real-time multiprocessor scheduling
inferred← citeshttps://doi.org/10.1016/j.jss.2015.12.004openalex-snapshot
Thread-level priority assignment in global multiprocessor scheduling for DAG tasks
inferred← citeshttps://doi.org/10.1109/csde53843.2021.9718499openalex-snapshot
Performance Evaluation of the Weakly Hard Real-Time Tasks for Global Multiprocessor Scheduling Approach
inferred← citeshttps://doi.org/10.1109/mysec.2015.7475207openalex-snapshot
A weakly hard real-time tasks on global scheduling of multiprocessor systems
inferred← citeshttps://doi.org/10.1109/rtss.2012.58openalex-snapshot
Extending Task-level to Job-level Fixed Priority Assignment and Schedulability Analysis Using Pseudo-deadlines
inferred← citeshttps://doi.org/10.1109/rtss55097.2022.00024openalex-snapshot
EDF-Like Scheduling for Self-Suspending Real-Time Tasks
inferred← citeshttps://doi.org/10.1109/soca.2013.65openalex-snapshot
A Reliable, Safe, and Secure Run-Time Platform for Cyber Physical Systems
inferred← citeshttps://doi.org/10.1109/tc.2025.3558079openalex-snapshot
Schedulability Analysis for Self-Suspending Tasks Under EDF-Like Scheduling
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.3390/math11163547openalex-snapshot
Contention-Free Scheduling for Single Preemption Multiprocessor Platforms
inferred← citeshttps://doi.org/10.3390/sym11050651openalex-snapshot
Task-Level Re-Execution Framework for Improving Fault Tolerance on Symmetry Multiprocessors
inferred← citeshttps://doi.org/10.5220/0005008903210329openalex-snapshot
A Necessary Test for Fixed-Priority Real-Time Multiprocessor Systems based on Lazy-adversary Simulation
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.