On the public citation graph
On the Complexity of Worst-Case Blocking Analysis of Nested Critical Sections
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.
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/11513988_4openalex-snapshot
SMT-COMP: Satisfiability Modulo Theories Competition
inferredcites →https://doi.org/10.1007/978-3-642-14165-2_26openalex-snapshot
Scheduling Periodic Tasks in a Hard Real-Time Environment
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.1016/0020-0190(80)90123-4openalex-snapshot
A note on preemptive scheduling of periodic, real-time tasks
inferredcites →https://doi.org/10.1016/j.tcs.2013.12.013openalex-snapshot
Complexity results for rainbow matchings
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/12.57058openalex-snapshot
Priority inheritance protocols: an approach to real-time synchronization
inferredcites →https://doi.org/10.1109/2.386982openalex-snapshot
Implications of classical scheduling results for real-time systems
inferredcites →https://doi.org/10.1109/32.469457openalex-snapshot
Semaphore queue priority assignment for real-time multiprocessor synchronization
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.2014.26openalex-snapshot
The FMLP+: An Asymptotically Optimal Real-Time Locking Protocol for Suspension-Aware Analysis
inferredcites →https://doi.org/10.1109/icdcs.1990.89257openalex-snapshot
Real-time synchronization protocols for shared memory 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/rtss.2008.25openalex-snapshot
Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard
inferredcites →https://doi.org/10.1109/rtss.2010.17openalex-snapshot
Optimality Results for Multiprocessor Real-Time Locking
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.1137/1.9781611973075.83openalex-snapshot
EDF-schedulability of synchronous periodic task systems is coNP-hard
inferredcites →https://doi.org/10.1145/2038642.2038656openalex-snapshot
Task synchronization and allocation for many-core real-time systems
inferredcites →https://doi.org/10.1145/322154.322158openalex-snapshot
The serializability of concurrent database updates
inferredcites →https://doi.org/10.1145/322326.322333openalex-snapshot
A Theory of Safe Locking Policies in Database Systems
inferredcites →https://doi.org/10.1201/9780203489802-37openalex-snapshot
Scheduling real-time tasks: algorithms and complexity
inferredcites →https://doi.org/10.3233/emc-2006-00069openalex-snapshot
Some results on scheduling tasks with self-suspensions
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-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.1109/rtcsa.2017.8046310openalex-snapshot
An optimal spin-lock priority assignment algorithm for real-time multi-core systems
inferred← citeshttps://doi.org/10.1109/rtss.2015.8openalex-snapshot
Global Real-Time Semaphore Protocols: A Survey, Unified Analysis, and Comparison
inferred← citeshttps://doi.org/10.1109/rtss.2016.036openalex-snapshot
A Blocking Bound for Nested 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.1145/2834848.2834874openalex-snapshot
A contention-sensitive fine-grained locking protocol for multiprocessor real-time systems
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.