On the public citation graph

Bounding Carry-in Interference to Improve Fixed-Priority Global Multiprocessor Scheduling Analysis

0 signed · 36 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.
Claim with ORCID
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.
See reference health

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-75664-4_26openalex-snapshot
Exact Schedulability Analysis for Static-Priority Global Multiprocessor Scheduling Using Model-Checking
inferredcites →https://doi.org/10.1007/978-3-540-77096-1_15openalex-snapshot
Global Deadline-Monotonic Scheduling of Arbitrary-Deadline Sporadic Task Systems
inferredcites →https://doi.org/10.1007/978-3-540-77096-1_5openalex-snapshot
Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks
inferredcites →https://doi.org/10.1007/978-3-540-77444-0_20openalex-snapshot
Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems
inferredcites →https://doi.org/10.1007/bf01940883openalex-snapshot
Proportionate Progress: A Notion of Fairness in Resource Allocation
inferredcites →https://doi.org/10.1016/j.sysarc.2010.08.003openalex-snapshot
Schedulability analysis for non-preemptive fixed-priority multiprocessor scheduling
inferredcites →https://doi.org/10.1016/j.sysarc.2013.05.012openalex-snapshot
Limited carry-in technique for real-time multi-core scheduling
inferredcites →https://doi.org/10.1093/comjnl/29.5.390openalex-snapshot
Finding Response Times in a Real-Time System
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.2008.27openalex-snapshot
Global EDF Schedulability Analysis of Arbitrary Sporadic Task Systems
inferredcites →https://doi.org/10.1109/emrts.2000.853990openalex-snapshot
Early-release fair scheduling
inferredcites →https://doi.org/10.1109/emrts.2001.934004openalex-snapshot
Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
inferredcites →https://doi.org/10.1109/isorc.2008.74openalex-snapshot
Schedulability Analysis of Global Fixed-Priority or EDF Multiprocessor Scheduling with Symbolic Model-Checking
inferredcites →https://doi.org/10.1109/real.2001.990610openalex-snapshot
Static-priority scheduling on multiprocessors
inferredcites →https://doi.org/10.1109/real.2003.1253260openalex-snapshot
Multiprocessor EDF and deadline monotonic schedulability analysis
inferredcites →https://doi.org/10.1109/rtcsa.2000.896405openalex-snapshot
Pfair scheduling: beyond periodic task systems
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/rtss.2012.56openalex-snapshot
Controlling Preemption for Better Schedulability in Multi-Core Systems
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.1016/j.sysarc.2018.12.006openalex-snapshot
Pessimism in multicore global schedulability analysis
inferred← citeshttps://doi.org/10.1109/dac56929.2023.10247970openalex-snapshot
Holistic WCRT Analysis for Global Fixed-Priority Preemptive Multiprocessor Scheduling
inferred← citeshttps://doi.org/10.1109/fruct-ispit.2016.7561502openalex-snapshot
The impact of blocking factor on real-time applications feasibility
inferred← citeshttps://doi.org/10.1109/les.2021.3112671openalex-snapshot
Infeasibility Test for Fixed-Priority Scheduling on Multiprocessor Platforms
inferred← citeshttps://doi.org/10.1109/rtas52030.2021.00018openalex-snapshot
ML for RT: Priority Assignment Using Machine Learning
inferred← citeshttps://doi.org/10.1109/rtcsa55878.2022.00022openalex-snapshot
On the Trade-offs between Generalization and Specialization in Real-Time Systems
inferred← citeshttps://doi.org/10.1109/tpds.2017.2679195openalex-snapshot
Improved Carry-in Workload Estimation for Global Multiprocessor Scheduling
inferred← citeshttps://doi.org/10.1109/tpds.2018.2843763openalex-snapshot
Execution-Efficient Response Time Analysis on Global Multiprocessor Platforms
inferred← citeshttps://doi.org/10.1145/3167132.3167195openalex-snapshot
Assessing the pessimism of current multicore global fixed-priority schedulability analysis
inferred← citeshttps://doi.org/10.1145/3360513openalex-snapshot
Response Time Analysis for Tasks with Fixed Preemption Points under Global Scheduling
inferred← citeshttps://doi.org/10.1145/3465474openalex-snapshot
An Efficient Execution Framework of Two-Part Execution Scenario Analysis
inferred← citeshttps://doi.org/10.1145/3477035openalex-snapshot
Excluding Parallel Execution to Improve Global Fixed Priority Response Time Analysis
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.