On the public citation graph

Utilization Bounds for RM Scheduling on Uniform Multiprocessors

0 signed · 20 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.1023/b:time.0000033378.56741.14openalex-snapshot
Utilization Bounds for EDF Scheduling on Real-Time Multiprocessor Systems
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/ecrts.2005.31openalex-snapshot
Task Assignment on Uniform Heterogeneous Multiprocessors
inferredcites →https://doi.org/10.1109/emrts.2001.934003openalex-snapshot
Minimum and maximum utilization bounds for multiprocessor RM scheduling
inferredcites →https://doi.org/10.1109/icpp.2004.1327956openalex-snapshot
Partitioning real-time tasks among heterogeneous multiprocessors
inferredcites →https://doi.org/10.1109/icpp.2004.56openalex-snapshot
Partitioning real-time tasks among heterogeneous multiprocessors
inferredcites →https://doi.org/10.1109/real.2001.990609openalex-snapshot
On-line scheduling on uniform multiprocessors
inferredcites →https://doi.org/10.1109/real.2004.20openalex-snapshot
Feasibility Analysis of Preemptive Real-Time Systems upon Heterogeneous Multiprocessor Platforms

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-540-92221-6_8openalex-snapshot
Deadline Monotonic Scheduling on Uniform Multiprocessors
inferred← citeshttps://doi.org/10.1007/s11241-011-9121-1openalex-snapshot
Cluster scheduling for real-time systems: utilization bounds and run-time overhead
inferred← citeshttps://doi.org/10.1007/s11241-013-9191-3openalex-snapshot
Task assignment algorithms for two-type heterogeneous multiprocessors
inferred← citeshttps://doi.org/10.1007/s11241-013-9195-zopenalex-snapshot
Real-time scheduling with resource sharing on heterogeneous multiprocessors
inferred← citeshttps://doi.org/10.1016/j.jpdc.2011.06.003openalex-snapshot
An optimal boundary fair scheduling algorithm for multiprocessor real-time systems
inferred← citeshttps://doi.org/10.1016/j.jss.2014.09.010openalex-snapshot
Enhanced fixed-priority real-time scheduling on multi-core platforms by exploiting task period relationship
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370337openalex-snapshot
Competitive Analysis of Partitioned Scheduling on Uniform Multiprocessors
inferred← citeshttps://doi.org/10.1109/rtcsa.2007.31openalex-snapshot
Competitive Analysis of Static-Priority Partitioned Scheduling on Uniform Multiprocessors
inferred← citeshttps://doi.org/10.1109/rtss.2008.32openalex-snapshot
The EDF Scheduling of Sporadic Task Systems on Uniform Multiprocessors
inferred← citeshttps://doi.org/10.1155/2014/485361openalex-snapshot
Performance Evaluation of New Joint EDF-RM Scheduling Algorithm for Real Time Distributed System
inferred← citeshttps://doi.org/10.25148/etd.fi14040815openalex-snapshot
Real-Time Scheduling of Embedded Applications on Multi-Core Platforms
inferred← citeshttps://doi.org/10.5772/63278openalex-snapshot
Real-Time Systems
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.