On the public citation graph

pCOMPATS: Period-Compatible Task Allocation and Splitting on Multi-core Processors

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.
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/978-3-540-92221-6_7openalex-snapshot
Global Static-Priority Preemptive Multiprocessor Scheduling with Utilization Bound 38%
inferredcites →https://doi.org/10.1007/s11241-011-9126-9openalex-snapshot
Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme
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.6openalex-snapshot
An EDF-based Scheduling Algorithm for Multiprocessor Soft Real-Time Systems
inferredcites →https://doi.org/10.1109/ecrts.2008.9openalex-snapshot
Sporadic Multiprocessor Scheduling with Few Preemptions
inferredcites →https://doi.org/10.1109/ecrts.2009.22openalex-snapshot
Semi-partitioned Scheduling of Sporadic Task Systems on Multiprocessors
inferredcites →https://doi.org/10.1109/ecrts.2009.33openalex-snapshot
Partitioned Fixed-Priority Preemptive Scheduling for Multi-core Processors
inferredcites →https://doi.org/10.1109/emrts.2003.1212725openalex-snapshot
The utilization bounds of partitioned and pfair static-priority scheduling on multiprocessors are 50%
inferredcites →https://doi.org/10.1109/emrts.2003.1212737openalex-snapshot
A synthetic utilization bound for aperiodic tasks with resource requirements
inferredcites →https://doi.org/10.1109/ipdps.2008.4536299openalex-snapshot
Portioned static-priority scheduling on multiprocessors
inferredcites →https://doi.org/10.1109/ipps.1998.669964openalex-snapshot
An efficient RMS admission control and its application to multiprocessor scheduling
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/rtas.2009.9openalex-snapshot
Semi-partitioned Fixed-Priority Scheduling on Multiprocessors
inferredcites →https://doi.org/10.1109/rtas.2010.39openalex-snapshot
Fixed-Priority Multiprocessor Scheduling with Liu and Layland's Utilization Bound
inferredcites →https://doi.org/10.1109/rtcsa.2006.45openalex-snapshot
Multiprocessor Scheduling with Few Preemptions
inferredcites →https://doi.org/10.1109/rtcsa.2007.61openalex-snapshot
Real-Time Scheduling with Task Splitting on Multiprocessors
inferredcites →https://doi.org/10.1109/rtss.2008.44openalex-snapshot
Scheduling Arbitrary-Deadline Sporadic Task Systems on Multiprocessors
inferredcites →https://doi.org/10.1109/rttas.1999.777666openalex-snapshot
Portable RK: a portable resource kernel for guaranteed and enforced timing behavior
inferredcites →https://doi.org/10.1109/tpds.2008.104openalex-snapshot
Energy Efficient Scheduling of Real-Time Tasks on Multicore Processors
inferredcites →https://doi.org/10.1117/12.298417openalex-snapshot
Resource kernels: a resource-centric approach to real-time and multimedia systems
inferredcites →https://doi.org/10.1137/1.9780898717730openalex-snapshot
Linear and Nonlinear Optimization
inferredcites →https://doi.org/10.1145/1278480.1278667openalex-snapshot
Thousand core chips
inferredcites →https://doi.org/10.1145/1450058.1450078openalex-snapshot
Portioned EDF-based scheduling on 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.5626/jcse.2008.2.1.074openalex-snapshot
Sustainability in Real-time Scheduling

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-81-322-2009-1_20openalex-snapshot
First-Fit Semi-partitioned Scheduling Based on Rate Monotonic Algorithm
inferred← citeshttps://doi.org/10.1007/978-981-287-251-7_2openalex-snapshot
Semi-partitioned Multiprocessor Scheduling
inferred← citeshttps://doi.org/10.1007/978-981-4585-87-3_2-1openalex-snapshot
Semi-partitioned Multiprocessor Scheduling
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/csit.2014.6805983openalex-snapshot
Delayed rate monotonic with semi-partitioned technique adapted to multiprocessors
inferred← citeshttps://doi.org/10.1109/isqed.2014.6783338openalex-snapshot
Multi-core partitioned scheduling for fixed-priority periodic real-time tasks with enhanced RBound
inferred← citeshttps://doi.org/10.1109/tpds.2013.71openalex-snapshot
Harmonic-Aware Multi-Core Scheduling for Fixed-Priority Real-Time Systems
inferred← citeshttps://doi.org/10.1145/3064813openalex-snapshot
Harmonicity-Aware Task Partitioning for Fixed Priority Scheduling of Probabilistic Real-Time Tasks on Multi-Core Platforms
inferred← citeshttps://doi.org/10.1504/ijguc.2015.070674openalex-snapshot
Semi-partitioned scheduling for fixed-priority real-time tasks based on intelligent rate monotonic algorithm
inferred← citeshttps://doi.org/10.25148/etd.fi14040815openalex-snapshot
Real-Time Scheduling of Embedded Applications on Multi-Core Platforms
inferred← citeshttps://doi.org/10.25148/etd.fidc000077openalex-snapshot
Energy-aware Fault-tolerant Scheduling for Hard Real-time Systems
inferred← citeshttps://doi.org/10.5626/jcse.2014.8.1.43openalex-snapshot
SS-DRM: Semi-Partitioned Scheduling Based on Delayed Rate Monotonic on Multiprocessor 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.