On the public citation graph

Limited Pre-emptive Global Fixed Task Priority

https://doi.org/10.1109/rtss.2013.26
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.
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/s11241-009-9071-zopenalex-snapshot
Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption
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.1007/s11241-010-9113-6openalex-snapshot
Feasibility analysis under fixed priority scheduling with limited preemptions
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.1109/ecrts.2005.32openalex-snapshot
The limited-preemption uniprocessor scheduling of sporadic task systems
inferredcites →https://doi.org/10.1109/ecrts.2007.38openalex-snapshot
Worst-Case Response Time Analysis of Real-Time Tasks under Fixed-Priority Scheduling with Deferred Preemption Revisited
inferredcites →https://doi.org/10.1109/ecrts.2011.28openalex-snapshot
Optimal Selection of Preemption Points to Minimize Preemption Overhead
inferredcites →https://doi.org/10.1109/etfa.2010.5641199openalex-snapshot
Comparative evaluation of limited preemptive methods
inferredcites →https://doi.org/10.1109/real.2003.1253260openalex-snapshot
Multiprocessor EDF and deadline monotonic schedulability analysis
inferredcites →https://doi.org/10.1109/rtcsa.2009.44openalex-snapshot
Bounding the Maximum Length of Non-preemptive Regions under Fixed Priority Scheduling
inferredcites →https://doi.org/10.1109/rtcsa.2013.6732198openalex-snapshot
Global fixed priority scheduling with deferred pre-emption
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.1109/rtss.2012.57openalex-snapshot
Optimal Fixed Priority Scheduling with Deferred Pre-emption
inferredcites →https://doi.org/10.1145/1168857.1168880openalex-snapshot
A performance counter architecture for computing accurate CPI components
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/977091.977115openalex-snapshot
Reflections on the memory wall

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-030-27535-8_50openalex-snapshot
Resource Planning for UAV Swarms Based on NSGA-II
inferred← citeshttps://doi.org/10.1007/978-3-319-39083-3_11openalex-snapshot
An Empirical Investigation of Eager and Lazy Preemption Approaches in Global Limited Preemptive Scheduling
inferred← citeshttps://doi.org/10.1007/978-81-322-2523-2_61openalex-snapshot
Scheduling Real-Time Transactions Using Deferred Preemptive Technique
inferred← citeshttps://doi.org/10.1016/j.micpro.2015.06.004openalex-snapshot
P-SOCRATES: A parallel software framework for time-critical many-core systems
inferred← citeshttps://doi.org/10.1109/access.2018.2857503openalex-snapshot
A Motif-Based Rescue Mission Planning Method for UAV Swarms Usingan Improved PICEA
inferred← citeshttps://doi.org/10.1109/isorc.2017.9openalex-snapshot
An Analysis of Lazy and Eager Limited Preemption Approaches under DAG-Based Global Fixed Priority Scheduling
inferred← citeshttps://doi.org/10.1109/rtss49844.2020.00020openalex-snapshot
Non-Preemptive Real-Time Multiprocessor Scheduling Beyond Work-Conserving
inferred← citeshttps://doi.org/10.1109/tc.2017.2704083openalex-snapshot
Improved Schedulability Analysis Using Carry-In Limitation for Non-Preemptive Fixed-Priority Multiprocessor Scheduling
inferred← citeshttps://doi.org/10.1145/2659787.2659811openalex-snapshot
Optimizing Preemption-Overhead Accounting in 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/2834848.2834855openalex-snapshot
Multiprocessor fixed priority scheduling with limited preemptions
inferred← citeshttps://doi.org/10.2991/ijcis.11.1.81openalex-snapshot
Solving A Multi-objective Mission Planning Problem for UAV Swarms with An Improved NSGA-III Algorithm
inferred← citeshttps://doi.org/10.34626/hstm-w464openalex-snapshot
Real-time Limited Preemptive Scheduling
inferred← citeshttps://doi.org/10.3850/9783981537079_0150openalex-snapshot
Response-Time Analysis of DAG Tasks under Fixed Priority Scheduling with Limited Preemptions
inferred← citeshttps://doi.org/10.5821/dissertation-2117-131427openalex-snapshot
A time-predictable parallel programing model for real-time systems
inferred← citeshttps://doi.org/10.70675/7b4aff50z7e9dz4b1ez9e6ez9043a5ba7cb4openalex-snapshot
Towards Efficient Reuse of Software Programmable Streaming Coarse Grained Reconfigurable Architectures
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.