On the public citation graph
Competitive Analysis of Partitioned Scheduling on Uniform Multiprocessors
0 signed · 37 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/s00453-001-0068-9openalex-snapshot
Optimal Time-Critical Scheduling via Resource Augmentation
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.1109/ecrts.2005.31openalex-snapshot
Task Assignment on Uniform Heterogeneous Multiprocessors
inferredcites →https://doi.org/10.1109/emrts.2000.853986openalex-snapshot
Scheduling periodic tasks on uniform multiprocessors
inferredcites →https://doi.org/10.1109/icdcs.2003.1203485openalex-snapshot
Rate-monolithic scheduling on uniform multiprocessors
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.2001.990610openalex-snapshot
Static-priority scheduling on multiprocessors
inferredcites →https://doi.org/10.1109/real.2004.20openalex-snapshot
Feasibility Analysis of Preemptive Real-Time Systems upon Heterogeneous Multiprocessor Platforms
inferredcites →https://doi.org/10.1109/rtcsa.2006.63openalex-snapshot
Utilization Bounds for RM Scheduling on Uniform Multiprocessors
inferredcites →https://doi.org/10.1109/rttas.2004.1317301openalex-snapshot
Task partitioning upon heterogeneous multiprocessor platforms
inferredcites →https://doi.org/10.1109/tc.2003.1214344openalex-snapshot
Rate-monotonic scheduling on uniform multiprocessors
inferredcites →https://doi.org/10.1145/321738.321743openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
inferredcites →https://doi.org/10.1145/322047.322055openalex-snapshot
Preemptive Scheduling of Uniform Processor Systems
inferredcites →https://doi.org/10.1145/347476.347479openalex-snapshot
Speed is as powerful as clairvoyance
inferredcites →https://doi.org/10.1287/opre.26.1.127openalex-snapshot
On a Real-Time Scheduling Problem
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/978-3-642-31594-7_56openalex-snapshot
Assigning Sporadic Tasks to Unrelated Parallel Machines
inferred← citeshttps://doi.org/10.1007/s10107-014-0786-9openalex-snapshot
Assigning sporadic tasks to unrelated machines
inferred← citeshttps://doi.org/10.1007/s11241-012-9161-1openalex-snapshot
Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors
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.suscom.2023.100854openalex-snapshot
An optimal semi-partitioned algorithm for scheduling real-time applications on uniform multicore processors
inferred← citeshttps://doi.org/10.1016/j.sysarc.2021.102229openalex-snapshot
Combining admission tests for heuristic partitioning of real-time tasks on ARM big.LITTLE multi-processor architectures
inferred← citeshttps://doi.org/10.1109/icppw.2009.32openalex-snapshot
How Hard is Partitioning for the Sporadic Task Model?
inferred← citeshttps://doi.org/10.1109/ipdps.2016.47openalex-snapshot
Partitioned Feasibility Tests for Sporadic Tasks on Heterogeneous Machines
inferred← citeshttps://doi.org/10.1109/isorc49007.2020.00015openalex-snapshot
Heuristic partitioning of real-time tasks on multi-processors
inferred← citeshttps://doi.org/10.1109/nrsc.2013.6587935openalex-snapshot
C28. Energy-Efficient Task Assignment on Asymmetric Multiprocessor Platforms
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.1109/rtss.2010.32openalex-snapshot
Assigning Real-Time Tasks on Heterogeneous Multiprocessors with Two Unrelated Types of Processors
inferred← citeshttps://doi.org/10.1109/rtss.2017.00039openalex-snapshot
An O(Log Log m)-Competitive Algorithm for Online Machine Minimization
inferred← citeshttps://doi.org/10.1145/2392987.2393003openalex-snapshot
Real-time scheduling with resource sharing on uniform multiprocessors
inferred← citeshttps://doi.org/10.1145/2544375.2544391openalex-snapshot
Energy-efficient task allocation techniques for asymmetric multiprocessor embedded systems
inferred← citeshttps://doi.org/10.3390/sym13081488openalex-snapshot
Dynamic Priority Real-Time Scheduling on Power Asymmetric Multicore Processors
inferred← citeshttps://doi.org/10.5120/13159-0932openalex-snapshot
Energy and Synchronization-Aware Mapping of Real-Time Tasks on Asymmetric Multicore Platforms
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.