On the public citation graph

k2Q: A Quadratic-Form Response Time and Schedulability Analysis Framework for Utilization-Based Analysis

https://doi.org/10.1109/rtss.2016.041

0 signed · 56 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/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-005-4686-1openalex-snapshot

An Analysis of Fixed-Priority Schedulability on a Multiprocessor

inferredcites →https://doi.org/10.1007/s11241-010-9096-3openalex-snapshot

Improved multiprocessor global schedulability analysis

inferredcites →https://doi.org/10.1007/s11241-010-9106-5openalex-snapshot

Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems

inferredcites →https://doi.org/10.1023/a:1008030427220openalex-snapshot

Generalized Multiframe Tasks

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/12.477248openalex-snapshot

New strategies for assigning real-time tasks to multiprocessor systems

inferredcites →https://doi.org/10.1109/ecrts.2005.1openalex-snapshot

A Fully Polynomial-Time Approximation Scheme for Feasibility Analysis in Static-Priority Systems with Arbitrary Relative Deadlines

inferredcites →https://doi.org/10.1109/ecrts.2012.13openalex-snapshot

Hardness Results for Static Priority Real-Time Scheduling

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/real.1989.63567openalex-snapshot

The rate monotonic scheduling algorithm: exact characterization and average case behavior

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.1997.641267openalex-snapshot

A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms

inferredcites →https://doi.org/10.1109/real.1997.641270openalex-snapshot

Jitter concerns in periodic task systems

inferredcites →https://doi.org/10.1109/real.2001.990610openalex-snapshot

Static-priority scheduling on multiprocessors

inferredcites →https://doi.org/10.1109/real.2002.1181571openalex-snapshot

Approximate schedulability analysis

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/rtas.2011.15openalex-snapshot

The Digraph Real-Time Task Model

inferredcites →https://doi.org/10.1109/rtas.2014.6925990openalex-snapshot

Schedulability tests for tasks with Variable Rate-dependent Behaviour under fixed priority scheduling

inferredcites →https://doi.org/10.1109/rtcsa.1997.629177openalex-snapshot

Schedulability of generalized multiframe task sets under static priority assignment

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.2010.19openalex-snapshot

The Non-cyclic Recurring Real-Time Task Model

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.2014.20openalex-snapshot

Approximate Response Time Analysis of Real-Time Task Graphs

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.2015.9openalex-snapshot

A Quadratic-Time Response Time Upper Bound with a Tightness Property

inferredcites →https://doi.org/10.1109/tc.2003.1214341openalex-snapshot

Rate monotonic analysis: the hyperbolic bound

inferredcites →https://doi.org/10.1109/tc.2004.103openalex-snapshot

Schedulability analysis of periodic fixed priority systems

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/tc.2008.66openalex-snapshot

Efficient Exact Schedulability Tests for Fixed Priority Real-Time Systems

inferredcites →https://doi.org/10.1109/tc.2013.209openalex-snapshot

The Quadratic Utilization Upper Bound for Arbitrary Deadline Real-Time Tasks

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.1287/opre.26.1.127openalex-snapshot

On a Real-Time Scheduling Problem

inferredcites →https://doi.org/10.2307/2583458openalex-snapshot

Knapsack Problems: Algorithms and Computer Implementations

inferredcites →https://doi.org/10.4230/lipics.ecrts.2017.9openalex-snapshot

Evaluate and Compare Two Utilization-Based Schedulability-Test Frameworks for Real-Time Systems

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/dac56929.2023.10247807openalex-snapshot

Property-Based Timing Analysis and Optimization for Complex Cyber-Physical Real-Time Systems

inferred← citeshttps://doi.org/10.1109/rtcsa.2017.8046312openalex-snapshot

Fixed-priority scheduling of mixed soft and hare real-time tasks on multiprocessors

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.2015.9openalex-snapshot

A Quadratic-Time Response Time Upper Bound with a Tightness Property

inferred← citeshttps://doi.org/10.1109/rtss.2016.037openalex-snapshot

Systems with Dynamic Real-Time Guarantees in Uncertain and Faulty Execution Environments

inferred← citeshttps://doi.org/10.1109/tpds.2018.2843763openalex-snapshot

Execution-Efficient Response Time Analysis on Global Multiprocessor Platforms

inferred← citeshttps://doi.org/10.1145/3465474openalex-snapshot

An Efficient Execution Framework of Two-Part Execution Scenario Analysis

inferred← citeshttps://doi.org/10.1145/3696355.3696358openalex-snapshot

The Power of Duality: Response Time Analysis meets Integer Programming

inferred← citeshttps://doi.org/10.23919/date.2019.8715017openalex-snapshot

Simple and General Methods for Fixed-Priority Schedulability in Optimization Problems

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

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.