On the public citation graph
Energy‐aware scheduling mandatory/optional tasks in multicore real‐time systems
0 signed · 48 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/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/s11241-005-0507-9openalex-snapshot
Measuring the Performance of Schedulability Tests
inferredcites →https://doi.org/10.1016/b978-0-7506-5546-0.x5000-2openalex-snapshot
Embedded Systems Design
inferredcites →https://doi.org/10.1016/j.jcss.2015.03.001openalex-snapshot
On multi-processor speed scaling with migration
inferredcites →https://doi.org/10.1016/j.jpdc.2011.01.004openalex-snapshot
Some observations on optimal frequency selection in DVFS-based energy consumption minimization
inferredcites →https://doi.org/10.1016/j.jss.2013.12.032openalex-snapshot
Power-aware fixed priority scheduling for sporadic tasks in hard real-time systems
inferredcites →https://doi.org/10.1016/j.suscom.2011.05.002openalex-snapshot
Tradeoff between energy and throughput for online deadline scheduling
inferredcites →https://doi.org/10.1016/j.tcs.2010.05.035openalex-snapshot
Deadline scheduling and power management for speed bounded processors
inferredcites →https://doi.org/10.1016/s1474-6670(17)51283-5openalex-snapshot
Hard Real-Time Scheduling: The Deadline-Monotonic Approach
inferredcites →https://doi.org/10.1080/01621459.1937.10503522openalex-snapshot
The Use of Ranks to Avoid the Assumption of Normality Implicit in the Analysis of Variance
inferredcites →https://doi.org/10.1109/12.372040openalex-snapshot
Algorithms for scheduling imprecise computations with timing constraints to minimize maximum error
inferredcites →https://doi.org/10.1109/12.57057openalex-snapshot
Scheduling periodic jobs that allow imprecise results
inferredcites →https://doi.org/10.1109/12.908988openalex-snapshot
Optimal reward-based scheduling for periodic real-time tasks
inferredcites →https://doi.org/10.1109/2.7053openalex-snapshot
Misconceptions about real-time computing: a serious problem for next-generation systems
inferredcites →https://doi.org/10.1109/2.76287openalex-snapshot
Algorithms for scheduling imprecise computations
inferredcites →https://doi.org/10.1109/32.58762openalex-snapshot
Multiprocessor online scheduling of hard-real-time tasks
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.1212744openalex-snapshot
Multiprocessor fixed-priority scheduling with restricted interprocessor migrations
inferredcites →https://doi.org/10.1109/icprime.2012.6208369openalex-snapshot
A dynamic voltage scaling with single power supply and varying speed factor for multiprocessor system using genetic algorithm
inferredcites →https://doi.org/10.1109/real.1988.51119openalex-snapshot
On-line scheduling of real-time tasks
inferredcites →https://doi.org/10.1109/rtcsa.2000.896409openalex-snapshot
Fixed-priority preemptive multiprocessor scheduling: to partition or not to partition
inferredcites →https://doi.org/10.1109/rttas.2003.1203051openalex-snapshot
A comparison of mpcp and msrp when sharing resources in the janus multiple-processor on a chip platform
inferredcites →https://doi.org/10.1109/tc.2004.1275298openalex-snapshot
Power-aware scheduling for periodic real-time tasks
inferredcites →https://doi.org/10.1145/1378533.1378580openalex-snapshot
Competitive non-migratory scheduling for flow time and energy
inferredcites →https://doi.org/10.1145/321738.321743openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
inferredcites →https://doi.org/10.1155/2014/287475openalex-snapshot
Energy‐Aware Real‐Time Task Scheduling for Heterogeneous Multiprocessors with Particle Swarm Optimization Algorithm
inferredcites →https://doi.org/10.17615/nyex-d314openalex-snapshot
The multiprocessor real-time scheduling of general task systems
inferredcites →https://doi.org/10.2307/3001968openalex-snapshot
Individual Comparisons by Ranking Methods
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-030-79701-0_2openalex-snapshot
Real-Time Scheduling: Background and Trends
inferred← citeshttps://doi.org/10.1007/s11227-024-06538-3openalex-snapshot
Self-aware decentralized security for real time approximate computing tasks in FPGA-based edge platforms
inferred← citeshttps://doi.org/10.1007/s12083-019-00749-9openalex-snapshot
Mapping imprecise computation tasks on cyber-physical systems
inferred← citeshttps://doi.org/10.1080/17445760.2019.1578880openalex-snapshot
RUN enhancement through Bayesian networks
inferred← citeshttps://doi.org/10.1109/iccd.2017.86openalex-snapshot
Decomposed Task Mapping to Maximize QoS in Energy-Constrained Real-Time Multicores
inferred← citeshttps://doi.org/10.1109/iciscois62701.2026.11447834openalex-snapshot
Machine Learning-Based Parkinson's Disease Detection Using Facial Features
inferred← citeshttps://doi.org/10.1109/jetcas.2018.2852005openalex-snapshot
Controllable QoS for Imprecise Computation Tasks on DVFS Multicores With Time and Energy Constraints
inferred← citeshttps://doi.org/10.1109/jiot.2020.3044910openalex-snapshot
Real-Time Imprecise Computation Tasks Mapping for DVFS-Enabled Networked Systems
inferred← citeshttps://doi.org/10.1109/sbesc.2015.32openalex-snapshot
Using Bioinspired Meta-heuristics to Solve Reward-Based Energy-Aware Mandatory/Optional Real-Time Tasks Scheduling
inferred← citeshttps://doi.org/10.1109/tcad.2018.2857300openalex-snapshot
Energy-Quality-Time Optimized Task Mapping on DVFS-Enabled Multicores
inferred← citeshttps://doi.org/10.1109/tcad.2022.3161407openalex-snapshot
ACCURATE: Accuracy Maximization for Real-Time Multicore Systems With Energy-Efficient Way-Sharing Caches
inferred← citeshttps://doi.org/10.1109/tcad.2022.3222293openalex-snapshot
Approximation-Aware Task Deployment on Heterogeneous Multicore Platforms With DVFS
inferred← citeshttps://doi.org/10.1109/tpds.2022.3228751openalex-snapshot
DELICIOUS: Deadline-Aware Approximate Computing in Cache-Conscious Multicore
inferred← citeshttps://doi.org/10.1111/itor.70176openalex-snapshot
An application of message routing in intermittent networks to precision agriculture
inferred← citeshttps://doi.org/10.1145/3476993openalex-snapshot
Prepare: P owe r -Awar e A p proximate Re a l-time Task Scheduling for Ene r gy-Adaptiv e QoS Maximization
inferred← citeshttps://doi.org/10.1145/3731599.3767563openalex-snapshot
Energy-Aware HPC Scheduling with LLM-Based Power Prediction
inferred← citeshttps://doi.org/10.1145/3821440openalex-snapshot
Optimal and Energy Efficient Imprecise Computation Task Deployment on Heterogeneous Multicore Platforms Combining DVFS and DPM
inferred← citeshttps://doi.org/10.23919/date.2019.8715077openalex-snapshot
Approximation-aware Task Deployment on Asymmetric Multicore Processors
inferred← citeshttps://doi.org/10.3390/en16020890openalex-snapshot
Energy-Aware Scheduling for High-Performance Computing Systems: A Survey
inferred← citeshttps://doi.org/10.3390/fi14020065openalex-snapshot
Flow Scheduling in Data Center Networks with Time and Energy Constraints: A Software-Defined Network Approach
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.