On the public citation graph
k2U: A General Framework from k-Point Effective Schedulability Analysis to Utilization-Based Tests
0 signed · 58 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/11795490_24openalex-snapshot
New Schedulability Tests for Real-Time Task Sets Scheduled by Deadline Monotonic on Multiprocessors
inferredcites →https://doi.org/10.1007/978-0-387-74503-9openalex-snapshot
Linear and Nonlinear Programming
inferredcites →https://doi.org/10.1007/s11241-009-9079-4openalex-snapshot
Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling
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/0378-4754(86)90092-3openalex-snapshot
Linear and nonlinear programming.
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/32.637146openalex-snapshot
A multiframe model for real-time tasks
inferredcites →https://doi.org/10.1109/ecrts.2007.20openalex-snapshot
New Schedulability Conditions for Real-Time Multiframe Tasks
inferredcites →https://doi.org/10.1109/ecrts.2013.32openalex-snapshot
Feasibility Analysis in the Sporadic DAG Task Model
inferredcites →https://doi.org/10.1109/ecrts.2014.23openalex-snapshot
Analysis of Federated and Global Scheduling for Parallel Real-Time Tasks
inferredcites →https://doi.org/10.1109/ecrts.2015.16openalex-snapshot
Schedulability and optimization analysis for non-preemptive static priority scheduling based on task utilization and blocking factors
inferredcites →https://doi.org/10.1109/ecrts.2015.27openalex-snapshot
The Global EDF Scheduling of Systems of Conditional Sporadic DAG Tasks
inferredcites →https://doi.org/10.1109/ecrts.2016.26openalex-snapshot
Partitioned Multiprocessor Fixed-Priority Scheduling of Sporadic Real-Time Tasks
inferredcites →https://doi.org/10.1109/real.1989.63567openalex-snapshot
The rate monotonic scheduling algorithm: exact characterization and average case behavior
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/real.1990.128748openalex-snapshot
Fixed priority scheduling of periodic task sets with arbitrary deadlines
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.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/rtss.2009.10openalex-snapshot
Task Scheduling with Self-Suspensions in Soft Real-Time Multiprocessor Systems
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.2014.10openalex-snapshot
Bursty-Interference Analysis Techniques for Analyzing Complex Real-Time Task Models
inferredcites →https://doi.org/10.1109/rtss.2015.18openalex-snapshot
k2U: A General Framework from k-Point Effective Schedulability Analysis to Utilization-Based Tests
inferredcites →https://doi.org/10.1109/rtss.2016.041openalex-snapshot
k2Q: A Quadratic-Form Response Time and Schedulability Analysis Framework for Utilization-Based Analysis
inferredcites →https://doi.org/10.1109/tc.2003.1214341openalex-snapshot
Rate monotonic analysis: the hyperbolic bound
inferredcites →https://doi.org/10.1109/tc.2004.1261828openalex-snapshot
Enhanced utilization bounds for QoS management
inferredcites →https://doi.org/10.1109/tse.2003.1223647openalex-snapshot
Efficient online schedulability tests for real-time systems
inferredcites →https://doi.org/10.1145/321738.321743openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
inferredcites →https://doi.org/10.4230/lipics.ecrts.2017.9openalex-snapshot
Evaluate and Compare Two Utilization-Based Schedulability-Test Frameworks for Real-Time Systems
inferredcites →https://doi.org/10.48550/arxiv.1212.2778openalex-snapshot
Feasibility Tests for Recurrent Real-Time Tasks in the Sporadic DAG Model
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-47487-4openalex-snapshot
A Journey of Embedded and Cyber-Physical Systems : Essays Dedicated to Peter Marwedel on the Occasion of His 70th Birthday
inferred← citeshttps://doi.org/10.1007/978-3-030-47487-4_4openalex-snapshot
On the Formalism and Properties of Timing Analyses in Real-Time Embedded Systems
inferred← citeshttps://doi.org/10.1007/978-981-16-7443-3_7openalex-snapshot
A Survey of Real-Time Scheduling on Multiprocessor Systems
inferred← citeshttps://doi.org/10.1007/s11241-018-9316-9openalex-snapshot
Many suspensions, many problems: a review of self-suspending tasks in real-time systems
inferred← citeshttps://doi.org/10.1016/j.ipl.2016.08.001openalex-snapshot
Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling
inferred← citeshttps://doi.org/10.1109/access.2022.3143037openalex-snapshot
A Schedulability Test for Sporadic Task DM Scheduling Based on Density Upper Bound
inferred← citeshttps://doi.org/10.1109/dac56929.2023.10247807openalex-snapshot
Property-Based Timing Analysis and Optimization for Complex Cyber-Physical Real-Time Systems
inferred← citeshttps://doi.org/10.1109/ecrts.2015.16openalex-snapshot
Schedulability and optimization analysis for non-preemptive static priority scheduling based on task utilization and blocking factors
inferred← citeshttps://doi.org/10.1109/ecrts.2016.26openalex-snapshot
Partitioned Multiprocessor Fixed-Priority Scheduling of Sporadic Real-Time Tasks
inferred← citeshttps://doi.org/10.1109/rtas.2018.00026openalex-snapshot
Shared-Resource-Centric Limited Preemptive Scheduling: A Comprehensive Study of Suspension-Based Partitioning Approaches
inferred← citeshttps://doi.org/10.1109/rtcsa.2017.8046321openalex-snapshot
State of the art for scheduling and analyzing self-suspending sporadic real-time tasks
inferred← citeshttps://doi.org/10.1109/rtcsa55878.2022.00022openalex-snapshot
On the Trade-offs between Generalization and Specialization in Real-Time Systems
inferred← citeshttps://doi.org/10.1109/rtcsa55878.2022.00026openalex-snapshot
Segment-Level FP-Scheduling in FreeRTOS
inferred← citeshttps://doi.org/10.1109/rtss.2016.039openalex-snapshot
Computational Complexity and Speedup Factors Analyses for Self-Suspending Tasks
inferred← citeshttps://doi.org/10.1109/rtss.2016.040openalex-snapshot
Closing the Loop for the Selective Conversion Approach: A Utilization-Based Test for Hard Real-Time Suspending Task Systems
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/rtss.2018.00011openalex-snapshot
Real-Time Computing and the Evolution of Embedded System Designs
inferred← citeshttps://doi.org/10.1109/rtss46320.2019.00038openalex-snapshot
Predictable Data-Driven Resource Management: an Implementation using Autoware on Autonomous Platforms
inferred← citeshttps://doi.org/10.1109/sies.2017.7993392openalex-snapshot
Probabilistic schedulability tests for uniprocessor fixed-priority scheduling under soft errors
inferred← citeshttps://doi.org/10.1109/tc.2022.3202748openalex-snapshot
Type-Aware Federated Scheduling for Typed DAG Tasks on Heterogeneous Multicore Platforms
inferred← citeshttps://doi.org/10.1145/3139258.3139273openalex-snapshot
Parametric utilization bounds for implicit-deadline periodic tasks in automotive systems
inferred← citeshttps://doi.org/10.26599/tst.2025.9010031openalex-snapshot
Research on the Schedulability of Sporadic Tasks in Spaceborne Mixed Real-Time Operating System
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.1605.00119openalex-snapshot
Automatic Parameter Derivations in k2U Framework
inferred← citeshttps://doi.org/10.5821/dissertation-2117-131427openalex-snapshot
A time-predictable parallel programing model for real-time systems
showing the first 25 of 26 · page through all 26
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.