On the public citation graph
Static Approximation Algorithms for Regularity-based Resource Partitioning
0 signed · 31 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/bf01940883openalex-snapshot
Proportionate Progress: A Notion of Fairness in Resource Allocation
inferredcites →https://doi.org/10.1109/ecrts.2008.28openalex-snapshot
Hierarchical Scheduling Framework for Virtual Clustering of Multiprocessors
inferredcites →https://doi.org/10.1109/ecrts.2008.9openalex-snapshot
Sporadic Multiprocessor Scheduling with Few Preemptions
inferredcites →https://doi.org/10.1109/ipps.1995.395946openalex-snapshot
Fast scheduling of periodic tasks on multiple resources
inferredcites →https://doi.org/10.1109/real.2001.990604openalex-snapshot
Towards compositionality in real-time resource partitioning based on regularity bounds
inferredcites →https://doi.org/10.1109/real.2003.1253249openalex-snapshot
Periodic resource model for compositional real-time guarantees
inferredcites →https://doi.org/10.1109/rtas.2009.9openalex-snapshot
Semi-partitioned Fixed-Priority Scheduling on Multiprocessors
inferredcites →https://doi.org/10.1109/rtcsa.1999.811212openalex-snapshot
On the schedulability conditions on partial time slots
inferredcites →https://doi.org/10.1109/rtcsa.2012.40openalex-snapshot
Regularity-Based Partitioning of Uniform Resources in Real-Time Systems
inferredcites →https://doi.org/10.1109/rtss.2007.17openalex-snapshot
A Comprehensive Worst-Case Calculus for Wireless Sensor Networks with In-Network Processing
inferredcites →https://doi.org/10.1109/rtss.2012.66openalex-snapshot
Static Approximation Algorithms for Regularity-based Resource Partitioning
inferredcites →https://doi.org/10.1109/rttas.2001.929867openalex-snapshot
Resource partition for real-time systems
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-021-09364-5openalex-snapshot
Online reconfiguration of regularity-based resource partitions in cyber-physical systems
inferred← citeshttps://doi.org/10.1007/s11241-022-09391-wopenalex-snapshot
Enhanced schedulability tests for real-time regularity-based virtualized systems with dependent and self-suspension tasks
inferred← citeshttps://doi.org/10.1109/hpcc.2014.124openalex-snapshot
A Temporal Partition-Based Linux CPU Scheduler
inferred← citeshttps://doi.org/10.1109/rtas52030.2021.00063openalex-snapshot
Work-In-Progress: Fault Tolerance in a Two-State Regularity-Based Checkpointing System
inferred← citeshttps://doi.org/10.1109/rtcsa.2019.8864575openalex-snapshot
Fault-Tolerant Regularity-Based Real-Time Virtual Resources
inferred← citeshttps://doi.org/10.1109/rtcsa52859.2021.00014openalex-snapshot
Enhanced Schedulability Tests for Real-Time Regularity-Based Virtualized Systems with Dependent and Self-Suspension Tasks
inferred← citeshttps://doi.org/10.1109/rtss.2017.00011openalex-snapshot
Regular Composite Resource Partition in Open Systems
inferred← citeshttps://doi.org/10.1109/rtss46320.2019.00050openalex-snapshot
Online Reconfiguration of Regularity-Based Resource Partitions in Cyber-Physical Systems
inferred← citeshttps://doi.org/10.1109/rtss46320.2019.00065openalex-snapshot
Work-in-Progress: Simplifying CPS Development with Real-Time Virtual Resources
inferred← citeshttps://doi.org/10.1109/rtss49844.2020.00042openalex-snapshot
Work-In-Progress: Fault Tolerance in a Two-State Checkpointing Regularity-Based System
inferred← citeshttps://doi.org/10.1109/rtss59052.2023.00040openalex-snapshot
Resource Virtualization with End-to-End Timing Guarantees for Multi-Hop Multi-Channel Real-Time Wireless Networks
inferred← citeshttps://doi.org/10.1109/synasc.2015.32openalex-snapshot
An Improved Upper-Bound Algorithm for Non-preemptive Task Scheduling
inferred← citeshttps://doi.org/10.1109/tc.2015.2449857openalex-snapshot
Transparent Real-Time Task Scheduling on Temporal Resource Partitions
inferred← citeshttps://doi.org/10.1109/tc.2021.3138019openalex-snapshot
Regularity-Based Virtualization Under the ARINC 653 Standard for Embedded Systems
inferred← citeshttps://doi.org/10.1145/3092945openalex-snapshot
Toward a Practical Regularity-based Model
inferred← citeshttps://doi.org/10.1145/3461648.3463854openalex-snapshot
ARINC 653-inspired regularity-based resource partitioning on xen
inferred← citeshttps://doi.org/10.1515/cait-2017-0018openalex-snapshot
A Novel Probabilistic Strategy for Delay Corrected Allocation in Shared Resource Systems
showing the first 17 of 18 · page through all 18
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.