On the public citation graph
A Blocking Bound for Nested FIFO Spin Locks
0 signed · 41 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/bf00365393openalex-snapshot
Stack-based scheduling of realtime processes
inferredcites →https://doi.org/10.1007/s11241-012-9162-0openalex-snapshot
Analysis and implementation of the multiprocessor bandwidth inheritance protocol
inferredcites →https://doi.org/10.1049/sej.1993.0034openalex-snapshot
Applying new scheduling theory to static priority pre-emptive scheduling
inferredcites →https://doi.org/10.1109/ecrts.2006.10openalex-snapshot
Efficient Synchronization under Global EDF Scheduling on Multiprocessors
inferredcites →https://doi.org/10.1109/ecrts.2012.17openalex-snapshot
Supporting Nested Locking in Multiprocessor Real-Time Systems
inferredcites →https://doi.org/10.1109/ecrts.2013.37openalex-snapshot
A Schedulability Compatible Multiprocessor Resource Sharing Protocol -- MrsP
inferredcites →https://doi.org/10.1109/ecrts.2015.31openalex-snapshot
Supporting Component-Based Development in Partitioned Multiprocessor Real-Time Systems
inferredcites →https://doi.org/10.1109/ecrts.2016.30openalex-snapshot
Lightweight Real-Time Synchronization under P-EDF on Symmetric and Asymmetric Multiprocessors
inferredcites →https://doi.org/10.1109/icdcs.1990.89257openalex-snapshot
Real-time synchronization protocols for shared memory multiprocessors
inferredcites →https://doi.org/10.1109/ipdps.2014.29openalex-snapshot
Multi-resource Real-Time Reader/Writer Locks for Multiprocessors
inferredcites →https://doi.org/10.1109/real.2001.990598openalex-snapshot
Minimizing memory utilization of real-time task sets in single and multi-processor systems-on-a-chip
inferredcites →https://doi.org/10.1109/rtas.2013.6531087openalex-snapshot
Improved analysis and evaluation of real-time semaphore protocols for P-FP scheduling
inferredcites →https://doi.org/10.1109/rtcsa.1995.528766openalex-snapshot
Real-time scalability of nested spin locks
inferredcites →https://doi.org/10.1109/rtcsa.2007.8openalex-snapshot
A Flexible Real-Time Locking Protocol for Multiprocessors
inferredcites →https://doi.org/10.1109/rtss.2013.13openalex-snapshot
On Spin Locks in AUTOSAR: Blocking Analysis of FIFO, Unordered, and Priority-Ordered Spin Locks
inferredcites →https://doi.org/10.1109/rtss.2014.34openalex-snapshot
On the Complexity of Worst-Case Blocking Analysis of Nested Critical Sections
inferredcites →https://doi.org/10.1109/rtss.2015.8openalex-snapshot
Global Real-Time Semaphore Protocols: A Survey, Unified Analysis, and Comparison
inferredcites →https://doi.org/10.1109/rttas.2003.1203051openalex-snapshot
A comparison of mpcp and msrp when sharing resources in the janus multiple-processor on a chip platform
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.5053229openalex-extracted
A Fine-Grained Analysis for Parallel Tasks with Spin-Locks Under Global Fixed-Priority Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-319-60588-3_5openalex-snapshot
Supporting Nested Resources in MrsP
inferred← citeshttps://doi.org/10.1007/978-981-287-251-7_10openalex-snapshot
Multiprocessor Real-Time Locking Protocols
inferred← citeshttps://doi.org/10.1007/978-981-4585-87-3_10-1openalex-snapshot
Multiprocessor Real-Time Locking Protocols
inferred← citeshttps://doi.org/10.1007/s11241-019-09328-wopenalex-snapshot
Real-time multiprocessor locks with nesting: optimizing the common case
inferred← citeshttps://doi.org/10.1007/s11241-020-09361-0openalex-snapshot
Concurrency groups: a new way to look at real-time multiprocessor lock nesting
inferred← citeshttps://doi.org/10.1007/s11390-026-5377-8openalex-snapshot
A Fine-Grained Analysis for Parallel Tasks with Spin-Locks Under Global Fixed-Priority Scheduling
inferred← citeshttps://doi.org/10.1016/j.jss.2019.110449openalex-snapshot
A complete run-time overhead-aware schedulability analysis for MrsP under nested resources
inferred← citeshttps://doi.org/10.1016/j.sysarc.2021.102107openalex-snapshot
Blocking analysis of suspension-based protocols for parallel real-time tasks under global fixed-priority scheduling
inferred← citeshttps://doi.org/10.1109/dac18074.2021.9586270openalex-snapshot
A Finer-Grained Blocking Analysis for Parallel Real-Time Tasks with Spin-Locks
inferred← citeshttps://doi.org/10.1109/rtcsa.2017.8046311openalex-snapshot
New schedulability analysis for MrsP
inferred← citeshttps://doi.org/10.1109/rtcsa52859.2021.00023openalex-snapshot
Graph-Based Optimizations for Multiprocessor Nested Resource Sharing
inferred← citeshttps://doi.org/10.1109/rtss49844.2020.00021openalex-snapshot
Response-Time Analysis for Non-Preemptive Global Scheduling with FIFO Spin Locks
inferred← citeshttps://doi.org/10.1109/sbesc53686.2021.9628358openalex-snapshot
Migration-Based Synchronization
inferred← citeshttps://doi.org/10.1109/tc.2020.3029328openalex-snapshot
Precise Worst-Case Blocking Time of Tasks Under Priority Inheritance Protocol
inferred← citeshttps://doi.org/10.1109/tpds.2017.2777454openalex-snapshot
Blocking Analysis for Spin Locks in Real-Time Parallel Tasks
inferred← citeshttps://doi.org/10.1145/3126505openalex-snapshot
Response-Time Analysis for Task Chains with Complex Precedence and Blocking Relations
inferred← citeshttps://doi.org/10.1145/3477017openalex-snapshot
A Hierarchical Hybrid Locking Protocol for Parallel Real-Time Tasks
inferred← citeshttps://doi.org/10.1145/3717383.3717392openalex-snapshot
Worst-Case Response Time Analysis for Periodic Programs with Nested Locks
inferred← citeshttps://doi.org/10.17615/mn5t-yr27openalex-snapshot
Efficient Synchronization for Real-Time Systems with Nested Resource Access
inferred← citeshttps://doi.org/10.22028/d291-27388openalex-snapshot
Blocking analysis of spin locks under partitioned fixed-priority scheduling
inferred← citeshttps://doi.org/10.4230/lipics.ecrts.2020.6openalex-snapshot
Analysis of EDF for Real-Time Multiprocessor Systems with Resource Sharing
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.