On the public citation graph

Extending Task-level to Job-level Fixed Priority Assignment and Schedulability Analysis Using Pseudo-deadlines

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

0 signed · 40 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/bf01940883openalex-snapshot

Proportionate Progress: A Notion of Fairness in Resource Allocation

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.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.1016/s0020-0190(02)00231-4openalex-snapshot

Deadline-based scheduling of periodic task systems on multiprocessors

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

Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors

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

Multiprocessor online scheduling of hard-real-time tasks

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

Improved Schedulability Analysis of EDF on Multiprocessor Platforms

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

DP-FAIR: A Simple Model for Understanding Optimal Multiprocessor Scheduling

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

Maximizing Contention-Free Executions in Multiprocessor Scheduling

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

Schedulability Analysis and Priority Assignment for Global Job-Level Fixed-Priority Multiprocessor Scheduling

inferredcites →https://doi.org/10.1109/rtss.2007.31openalex-snapshot

Response-Time Analysis for Globally Scheduled Symmetric Multiprocessor Platforms

inferredcites →https://doi.org/10.1109/rtss.2007.35openalex-snapshot

Techniques for Multiprocessor Global Schedulability Analysis

inferredcites →https://doi.org/10.1109/rtss.2007.41openalex-snapshot

Adapting Futures: Scalability for Real-World Computing

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

Priority Assignment for Global Fixed Priority Pre-Emptive Scheduling in Multiprocessor Real-Time Systems

inferredcites →https://doi.org/10.1109/rtss.2010.13openalex-snapshot

LLF Schedulability Analysis on Multiprocessor Platforms

inferredcites →https://doi.org/10.1109/rtss.2011.17openalex-snapshot

RUN: Optimal Multiprocessor Real-Time Scheduling via Reduction to Uniprocessor

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

Optimal utilization bounds for the fixed-priority scheduling of periodic task systems on identical multiprocessors

inferredcites →https://doi.org/10.1109/tpds.2005.88openalex-snapshot

An analysis of EDF schedulability on a multiprocessor

inferredcites →https://doi.org/10.1109/tpds.2008.129openalex-snapshot

Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms

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/978-3-319-27198-9openalex-snapshot

Techniques for Building Timing-Predictable Embedded Systems

inferred← citeshttps://doi.org/10.1007/s00607-017-0562-9openalex-snapshot

Real-time uniprocessor scheduling with fewer preemptions

inferred← citeshttps://doi.org/10.1007/s11241-013-9190-4openalex-snapshot

Fair lateness scheduling: reducing maximum lateness in G-EDF-like scheduling

inferred← citeshttps://doi.org/10.1016/j.jss.2013.09.029openalex-snapshot

Demand-based schedulability analysis for real-time multi-core scheduling

inferred← citeshttps://doi.org/10.1016/j.jss.2015.12.004openalex-snapshot

Thread-level priority assignment in global multiprocessor scheduling for DAG tasks

inferred← citeshttps://doi.org/10.1016/j.sysarc.2013.05.012openalex-snapshot

Limited carry-in technique for real-time multi-core scheduling

inferred← citeshttps://doi.org/10.1016/j.sysarc.2016.04.002openalex-snapshot

A review of priority assignment in real-time systems

inferred← citeshttps://doi.org/10.1109/ecrts.2013.14openalex-snapshot

Global EDF Schedulability Analysis for Synchronous Parallel Tasks on Multicore Platforms

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

Beyond Implicit-Deadline Optimality: A Multiprocessor Scheduling Framework for Constrained-Deadline Tasks

inferred← citeshttps://doi.org/10.1109/soca.2013.65openalex-snapshot

A Reliable, Safe, and Secure Run-Time Platform for Cyber Physical Systems

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

Improvement of Real-Time Multi-CoreSchedulability with Forced Non-Preemption

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

Global EDF Schedulability Analysis for Parallel Tasks on Multi-Core Platforms

inferred← citeshttps://doi.org/10.14801/jkiit.2018.16.2.29openalex-snapshot

Multi-Level Contention-Free Policy for Rate Monotonic Scheduling Algorithm on Real-Time Systems

inferred← citeshttps://doi.org/10.14801/jkiit.2019.17.9.31openalex-snapshot

Response-Time Analysis for Contention-Free Fixed-Priority Scheduling Algorithm

inferred← citeshttps://doi.org/10.3390/math11163547openalex-snapshot

Contention-Free Scheduling for Single Preemption Multiprocessor Platforms

inferred← citeshttps://doi.org/10.4316/aece.2017.02016openalex-snapshot

Real-Time Scheduling for Preventing Information Leakage with Preemption Overheads

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.