On the public citation graph
On Schedulability Bounds of Static Priority Schedulers
0 signed · 79 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.1002/ett.4460120413openalex-snapshot
Performance guarantees in communication networks
inferredcites →https://doi.org/10.1006/jpdc.1993.1086openalex-snapshot
A New Performance Measure for Scheduling Independent Real-Time Tasks
inferredcites →https://doi.org/10.1007/978-1-4471-0459-9openalex-snapshot
Performance Guarantees in Communication Networks
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/b978-155860702-6/50016-8openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
inferredcites →https://doi.org/10.1023/a:1008098013753openalex-snapshot
Utilization Bounds for N-Processor Rate Monotone Scheduling with Static Processor Assignment
inferredcites →https://doi.org/10.1023/b:time.0000045315.61234.1eopenalex-snapshot
Real Time Scheduling Theory: A Historical Perspective
inferredcites →https://doi.org/10.1109/12.272433openalex-snapshot
Guaranteeing synchronous message deadlines with the timed token medium access control protocol
inferredcites →https://doi.org/10.1109/12.477248openalex-snapshot
New strategies for assigning real-time tasks to multiprocessor systems
inferredcites →https://doi.org/10.1109/18.61109openalex-snapshot
A calculus for network delay. I. Network elements in isolation
inferredcites →https://doi.org/10.1109/18.61110openalex-snapshot
A calculus for network delay. II. Network analysis
inferredcites →https://doi.org/10.1109/18.669170openalex-snapshot
Application of network calculus to guaranteed service networks
inferredcites →https://doi.org/10.1109/18.669173openalex-snapshot
On deterministic traffic regulation and service guarantees: a systematic approach by filtering
inferredcites →https://doi.org/10.1109/32.637146openalex-snapshot
A multiframe model for real-time tasks
inferredcites →https://doi.org/10.1109/49.400660openalex-snapshot
Quality of service guarantees in virtual circuit switched networks
inferredcites →https://doi.org/10.1109/90.234856openalex-snapshot
A generalized processor sharing approach to flow control in integrated services networks: the single-node case
inferredcites →https://doi.org/10.1109/90.298432openalex-snapshot
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case
inferredcites →https://doi.org/10.1109/90.477719openalex-snapshot
An optimal synchronous bandwidth allocation scheme for guaranteeing synchronous message deadlines with the timed-token MAC protocol
inferredcites →https://doi.org/10.1109/90.556345openalex-snapshot
Exact admission control for networks with a bounded delay service
inferredcites →https://doi.org/10.1109/90.779197openalex-snapshot
Performance bounds for flow control protocols
inferredcites →https://doi.org/10.1109/emrts.2003.1212737openalex-snapshot
A synthetic utilization bound for aperiodic tasks with resource requirements
inferredcites →https://doi.org/10.1109/icccn.1995.540168openalex-snapshot
Scheduling for quality of service guarantees via service curves
inferredcites →https://doi.org/10.1109/icdcs.1992.235007openalex-snapshot
Guaranteeing synchronous message deadlines with the timed token protocol
inferredcites →https://doi.org/10.1109/icpp.1999.797433openalex-snapshot
New delay analysis in high speed networks
inferredcites →https://doi.org/10.1109/icpp.2000.876137openalex-snapshot
Utilization-based admission control for real-time applications
inferredcites →https://doi.org/10.1109/infcom.1998.665083openalex-snapshot
SCED+: efficient management of quality of service guarantees
inferredcites →https://doi.org/10.1109/lcn.1993.591219openalex-snapshot
Guaranteeing synchronous messages with arbitrary deadline constraints in an FDDI network
inferredcites →https://doi.org/10.1109/real.1990.128748openalex-snapshot
Fixed priority scheduling of periodic task sets with arbitrary deadlines
inferredcites →https://doi.org/10.1109/real.1991.160369openalex-snapshot
Load adjustment in adaptive real-time systems
inferredcites →https://doi.org/10.1109/real.1996.563696openalex-snapshot
A multiframe model for real-time tasks
inferredcites →https://doi.org/10.1109/real.1997.641267openalex-snapshot
A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms
inferredcites →https://doi.org/10.1109/real.2001.990609openalex-snapshot
On-line scheduling on uniform multiprocessors
inferredcites →https://doi.org/10.1109/real.2001.990610openalex-snapshot
Static-priority scheduling on multiprocessors
inferredcites →https://doi.org/10.1109/real.2003.1253260openalex-snapshot
Multiprocessor EDF and deadline monotonic schedulability analysis
inferredcites →https://doi.org/10.1109/rtas.2005.35openalex-snapshot
On Schedulability Bounds of Static Priority Schedulers
inferredcites →https://doi.org/10.1109/rtcsa.1995.528754openalex-snapshot
A generalized utilization bound test for fixed-priority real-time scheduling
inferredcites →https://doi.org/10.1109/rtcsa.1999.811201openalex-snapshot
Efficient global allocation of synchronous bandwidths for hard real-time communication with the timed token MAC protocol
inferredcites →https://doi.org/10.1109/rtcsa.2000.896409openalex-snapshot
Fixed-priority preemptive multiprocessor scheduling: to partition or not to partition
inferredcites →https://doi.org/10.1109/rttas.2001.929862openalex-snapshot
Schedulability analysis and utilization bounds for highly scalable real-time services
inferredcites →https://doi.org/10.1109/rttas.2003.1203049openalex-snapshot
Global multiprocessor scheduling of aperiodic tasks using time-independent priorities
inferredcites →https://doi.org/10.1109/tc.2003.1183948openalex-snapshot
An improved rate-monotonic admission control and its applications
inferredcites →https://doi.org/10.1109/tc.2003.1214341openalex-snapshot
Rate monotonic analysis: the hyperbolic bound
inferredcites →https://doi.org/10.1109/tc.2004.106openalex-snapshot
A Gaussian noise generator for hardware-based simulations
inferredcites →https://doi.org/10.1109/tc.2004.1261828openalex-snapshot
Enhanced utilization bounds for QoS management
inferredcites →https://doi.org/10.1109/tc.2004.1261839openalex-snapshot
A utilization bound for aperiodic tasks and priority driven scheduling
inferredcites →https://doi.org/10.1109/tnet.2004.826286openalex-snapshot
Providing Absolute Differentiated Services for Real-Time Applications in Static-Priority Scheduling Networks
inferredcites →https://doi.org/10.1145/317499.317538openalex-snapshot
Performance of real-time bus scheduling algorithms
inferredcites →https://doi.org/10.1145/317531.317538openalex-snapshot
Performance of real-time bus scheduling algorithms
inferredcites →https://doi.org/10.1145/321738.321743openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s11241-010-9104-7openalex-snapshot
Schedulability analysis in hard real-time systems under thermal constraints
inferred← citeshttps://doi.org/10.1007/s11241-011-9135-8openalex-snapshot
Multiprocessor extensions to real-time calculus
inferred← citeshttps://doi.org/10.1109/date.2009.5090641openalex-snapshot
Improved worst-case response-time calculations by upper-bound conditions
inferred← citeshttps://doi.org/10.1109/ds-rt.2008.21openalex-snapshot
Stochastic Analysis of Expected Schedulability for Real-Time Tasks on a Single Computing System
inferred← citeshttps://doi.org/10.1109/iccsnt.2011.6182423openalex-snapshot
End-to-End delay analysis of avionics Full Duplex switched Ethernet with different flow scheduling scheme
inferred← citeshttps://doi.org/10.1109/icdcs.2010.73openalex-snapshot
Reliability Calculus: A Theoretical Framework to Analyze Communication Reliability
inferred← citeshttps://doi.org/10.1109/icist.2011.5765199openalex-snapshot
On a laxity-based real-time scheduling policy for fixed-priority tasks and its non-utilization bound
inferred← citeshttps://doi.org/10.1109/infcom.2011.5935062openalex-snapshot
Scheduling design and analysis for end-to-end heterogeneous flows in an avionics network
inferred← citeshttps://doi.org/10.1109/infcomw.2011.5928898openalex-snapshot
Routing schemes for switch-based in-vehicle networks
inferred← citeshttps://doi.org/10.1109/rtas.2006.32openalex-snapshot
On Non-Utilization Bounds for Arbitrary Fixed Priority Policies
inferred← citeshttps://doi.org/10.1109/rtss.2005.42openalex-snapshot
Towards Feasible Region Calculus: An End-to-End Schedulability Analysis of Real-Time Multistage Execution
inferred← citeshttps://doi.org/10.1109/rtss.2007.26openalex-snapshot
Utilization-Bound Based Schedulability Analysis of Weighted Round Robin Schedulers
inferred← citeshttps://doi.org/10.1109/rtss.2009.29openalex-snapshot
Multiprocessor Extensions to Real-Time Calculus
inferred← citeshttps://doi.org/10.1109/rtss.2015.18openalex-snapshot
k2U: A General Framework from k-Point Effective Schedulability Analysis to Utilization-Based Tests
inferred← citeshttps://doi.org/10.1109/rtss.2016.041openalex-snapshot
k2Q: A Quadratic-Form Response Time and Schedulability Analysis Framework for Utilization-Based Analysis
inferred← citeshttps://doi.org/10.1109/tc.2010.31openalex-snapshot
A General Framework for Parameterized Schedulability Bound Analysis of Real-Time Systems
inferred← citeshttps://doi.org/10.1109/tpds.2012.51openalex-snapshot
Scheduling Heterogeneous Flows with Delay-Aware Deduplication for Avionics Applications
inferred← citeshttps://doi.org/10.1145/1952522.1952524openalex-snapshot
Nonutilization bounds and feasible regions for arbitrary fixed-priority policies
inferred← citeshttps://doi.org/10.1145/2185395.2185398openalex-snapshot
Sharp utilization thresholds for some realtime scheduling problems
inferred← citeshttps://doi.org/10.1201/9781315218793-19openalex-snapshot
Delay Performance and Management of VoIP System
inferred← citeshttps://doi.org/10.18419/opus-3370openalex-snapshot
Simulation of multi-core scheduling in real-time embedded systems
inferred← citeshttps://doi.org/10.4108/chinacom.2010.110openalex-snapshot
Topic-based resource allocation for real-time publish/subscribe communication systems
inferred← citeshttps://doi.org/10.4230/lipics.ecrts.2017.9openalex-snapshot
Evaluate and Compare Two Utilization-Based Schedulability-Test Frameworks for Real-Time Systems
inferred← citeshttps://doi.org/10.48550/arxiv.0912.3852openalex-snapshot
Sharp utilization thresholds for some real-time scheduling problems
inferred← citeshttps://doi.org/10.5555/1874620.1874646openalex-snapshot
Improved worst-case response-time calculations by upper-bound conditions
showing the first 27 of 28 · page through all 28
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.