On the public citation graph

Contention-free executions for real-time multiprocessor scheduling

https://doi.org/10.1145/2494530
0 signed · 39 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/bf01553887openalex-snapshot
A new algorithm for scheduling periodic, real-time tasks
inferredcites →https://doi.org/10.1007/bf01940883openalex-snapshot
Proportionate Progress: A Notion of Fairness in Resource Allocation
inferredcites →https://doi.org/10.1007/s11241-008-9061-6openalex-snapshot
EDZL scheduling analysis
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/j.jss.2011.07.002openalex-snapshot
Zero-laxity based real-time multiprocessor scheduling
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.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.2005.18openalex-snapshot
Improved Schedulability Analysis of EDF on Multiprocessor Platforms
inferredcites →https://doi.org/10.1109/ecrts.2009.22openalex-snapshot
Semi-partitioned Scheduling of Sporadic Task Systems on Multiprocessors
inferredcites →https://doi.org/10.1109/real.1990.128746openalex-snapshot
Preemptively scheduling hard-real-time sporadic tasks on one processor
inferredcites →https://doi.org/10.1109/rtas.2011.30openalex-snapshot
Maximizing Contention-Free Executions in Multiprocessor Scheduling
inferredcites →https://doi.org/10.1109/rtas.2011.31openalex-snapshot
FPZL Schedulability Analysis
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.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.2007.48openalex-snapshot
Integrating Adaptive Components: An Emerging Challenge in Performance-Adaptive Systems and a Server Farm Case-Study
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.11openalex-snapshot
New Response Time Bounds for Fixed Priority Multiprocessor Scheduling
inferredcites →https://doi.org/10.1109/rtss.2010.13openalex-snapshot
LLF Schedulability Analysis on Multiprocessor Platforms
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.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
inferredcites →https://doi.org/10.1145/321738.321743openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
inferredcites →https://doi.org/10.5555/1266366.1266723openalex-snapshot
Accounting for cache-related preemption delay in dynamic priority schedulability analysis
inferredcites →https://doi.org/10.5555/1874620.1874924openalex-snapshot
Multi-core for mobile phones
inferredcites →https://doi.org/10.5626/jcse.2008.2.1.074openalex-snapshot
Sustainability in Real-time Scheduling

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.jss.2017.11.027openalex-snapshot
Multi-level contention-free policy 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.1109/access.2020.2992868openalex-snapshot
Response-Time Analysis for Multi-Mode Tasks in Real-Time Multiprocessor Systems
inferred← citeshttps://doi.org/10.1109/cads.2015.7377777openalex-snapshot
LTS: Linear task scheduling on multiprocessor through equation of the line
inferred← citeshttps://doi.org/10.1109/ikt.2015.7288767openalex-snapshot
DARTS: DynAmic Real-time Task Scheduling
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/transinf.2017edl8260openalex-snapshot
Proof and Evaluation of Improved Slack Reclamation for Response Time Analysis of Real-Time Multiprocessor Systems
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.3390/sym12091515openalex-snapshot
Contention-Free Scheduling for Mixed-Criticality Multiprocessor Real-Time System
inferred← citeshttps://doi.org/10.4018/ijertcs.2020100104openalex-snapshot
Synchronization-Aware Task Allocation Techniques for Preemption Control to Reduce Blocking Time in Multiprocessor Real-Time System
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.