On the public citation graph

A formalization of priority inversion

https://doi.org/10.1007/bf01088832
0 signed · 35 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/bf00289247openalex-snapshot
Scheduling according to job priority with prevention of deadlock and permanent blocking
inferredcites →https://doi.org/10.1109/12.57058openalex-snapshot
Priority inheritance protocols: an approach to real-time synchronization
inferredcites →https://doi.org/10.1109/tc.1987.5009518openalex-snapshot
Preemptive Scheduling Under Time and Resource Constraints
inferredcites →https://doi.org/10.1145/214451.214456openalex-snapshot
Distributed snapshots
inferredcites →https://doi.org/10.1145/320071.320076openalex-snapshot
A Majority consensus approach to concurrency control for multiple copy databases
inferredcites →https://doi.org/10.1145/321738.321743openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
inferredcites →https://doi.org/10.1145/358818.358824openalex-snapshot
Experience with processes and monitors in Mesa
inferredcites →https://doi.org/10.1147/sj.72.0074openalex-snapshot
Avoiding deadlock in multitasking systems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cpe.6549openalex-snapshot
Concurrency control for real‐time and mobile transactions: Historical view, challenges, and evolution of practices
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_79openalex-snapshot
Reasoning about programs by exploiting the environment
inferred← citeshttps://doi.org/10.1007/3-540-60688-2_56openalex-snapshot
Duration calculus specification of scheduling for tasks with shared resources
inferred← citeshttps://doi.org/10.1007/3-540-69687-3_11openalex-snapshot
Reflective ORBs: Supporting Robust, Time-critical Distribution
inferred← citeshttps://doi.org/10.1007/978-3-030-70873-3_31openalex-snapshot
How to Extend Single-Processor Approach to Explicitly Many-Processor Approach
inferred← citeshttps://doi.org/10.1007/978-3-319-41540-6_4openalex-snapshot
A Practical Verification Framework for Preemptive OS Kernels
inferred← citeshttps://doi.org/10.1007/bfb0013863openalex-snapshot
Real time systems: A tutorial
inferred← citeshttps://doi.org/10.1016/j.cosrev.2019.100215openalex-snapshot
Transaction scheduling protocols for controlling priority inversion: A review
inferred← citeshttps://doi.org/10.1016/j.sysarc.2016.11.008openalex-snapshot
Reservation based protocol for resolving priority inversions in composable conveyor systems
inferred← citeshttps://doi.org/10.1109/csci49370.2019.00283openalex-snapshot
The Need for Modern Computing Paradigm: Science Applied to Computing
inferred← citeshttps://doi.org/10.1109/etfa.2012.6489587openalex-snapshot
Towards collaborative resource sharing under real-time conditions in multitasking and multicore environments
inferred← citeshttps://doi.org/10.1109/rtcsa.2009.65openalex-snapshot
Dynamic Hinting: Real-Time Resource Management in Wireless Sensor/Actor Networks
inferred← citeshttps://doi.org/10.1109/rtoss.1994.292552openalex-snapshot
A mixed locking/abort protocol for hard real-time systems
inferred← citeshttps://doi.org/10.1145/1064303.1064304openalex-snapshot
Priority inversion in multi processor systems due to protected actions
inferred← citeshttps://doi.org/10.1145/2523616.2523624openalex-snapshot
Natjam
inferred← citeshttps://doi.org/10.1145/2930957.2930960openalex-snapshot
Timing analysis of P-FRP systems
inferred← citeshttps://doi.org/10.1145/3385412.3386013openalex-snapshot
Responsive parallelism with futures and state
inferred← citeshttps://doi.org/10.1145/3498708openalex-snapshot
Static prediction of parallel computation graphs
inferred← citeshttps://doi.org/10.1145/3591249openalex-snapshot
Responsive Parallelism with Synchronization
inferred← citeshttps://doi.org/10.1145/3597635.3598026openalex-snapshot
Static Prediction of Parallel Computation Graphs (Abstract)
inferred← citeshttps://doi.org/10.1145/3632859openalex-snapshot
Pipelines and Beyond: Graph Types for ADTs with Futures
inferred← citeshttps://doi.org/10.1145/3767329openalex-snapshot
SLO-aware Prioritization of Orchestration Times for Containerized Services
inferred← citeshttps://doi.org/10.15760/etd.114openalex-snapshot
Extending Relativistic Programming to Multiple Writers
inferred← citeshttps://doi.org/10.17148/ijarcce.2015.45158openalex-snapshot
Survey on Optimal Schedulability Test for Hard Real Time Scheduling
inferred← citeshttps://doi.org/10.23919/date54114.2022.9774673openalex-snapshot
Counting Priority Inversions: Computing Maximum Additional Core Requests of DAG Tasks
inferred← citeshttps://doi.org/10.25046/aj040114openalex-snapshot
Can parallelization save the (computing) world?
inferred← citeshttps://doi.org/10.3390/app15115805openalex-snapshot
On Implementing Technomorph Biology for Inefficient Computing
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.