On the public citation graph
Nonpreemptive Scheduling of Periodic Tasks in Uni- and Multiprocessor Systems
0 signed · 61 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.1016/0020-0190(80)90123-4openalex-snapshot
A note on preemptive scheduling of periodic, real-time tasks
inferredcites →https://doi.org/10.1016/0020-0190(81)90066-1openalex-snapshot
Scheduling periodically occurring tasks on multiple processors
inferredcites →https://doi.org/10.1016/0020-0190(83)90002-9openalex-snapshot
Preemptive scheduling of periodic jobs in uniform multiprocessor systems
inferredcites →https://doi.org/10.1016/0166-5316(82)90024-4openalex-snapshot
On the complexity of fixed-priority scheduling of periodic, real-time tasks
inferredcites →https://doi.org/10.1109/12.57057openalex-snapshot
Scheduling periodic jobs that allow imprecise results
inferredcites →https://doi.org/10.1109/real.1991.160366openalex-snapshot
On non-preemptive scheduling of period and sporadic tasks
inferredcites →https://doi.org/10.1109/taes.1976.308251openalex-snapshot
Periodic Job Scheduling in a Distributed Processor System
inferredcites →https://doi.org/10.1109/tse.1987.233201openalex-snapshot
Scheduling Tasks with Resource Requirements in Hard Real-Time Systems
inferredcites →https://doi.org/10.1145/321738.321743openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
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-030-64843-5_8openalex-snapshot
On the Complexity of a Periodic Scheduling Problem with Precedence Relations
inferred← citeshttps://doi.org/10.1007/s11241-006-4961-9openalex-snapshot
The Non-preemptive Scheduling of Periodic Tasks upon Multiprocessors
inferred← citeshttps://doi.org/10.1007/s11241-014-9203-yopenalex-snapshot
Precautious-RM: a predictable non-preemptive scheduling algorithm for harmonic tasks
inferred← citeshttps://doi.org/10.1007/s11276-013-0593-xopenalex-snapshot
Deadline-aware scheduling of cooperative relayers in TDMA-based wireless industrial networks
inferred← citeshttps://doi.org/10.1007/s11786-019-00395-7openalex-snapshot
Processor Bounding for an Efficient Non-preemptive Task Scheduling Algorithm
inferred← citeshttps://doi.org/10.1016/j.comcom.2009.11.005openalex-snapshot
Task-execution scheduling schemes for network measurement and monitoring
inferred← citeshttps://doi.org/10.1016/j.cor.2025.107072openalex-snapshot
Periodic chains scheduling on dedicated resources - A crucial problem in time-sensitive networks
inferred← citeshttps://doi.org/10.1016/j.ipl.2019.105867openalex-snapshot
Polynomial Time Schedulability Test for Periodic Non-Preemptive 2-Task System
inferred← citeshttps://doi.org/10.1016/j.sysarc.2007.10.002openalex-snapshot
Analyzing composability of applications on MPSoC platforms
inferred← citeshttps://doi.org/10.1016/j.sysarc.2018.01.005openalex-snapshot
Job-shifting: An algorithm for online admission of non-preemptive aperiodic tasks in safety critical systems
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00221-xopenalex-snapshot
Scheduling cyclic tasks with binary periods
inferred← citeshttps://doi.org/10.1016/s0305-0548(99)00048-9openalex-snapshot
Scheduling multiprocessor tasks for mean flow time criterion
inferred← citeshttps://doi.org/10.1109/compsac.2014.54openalex-snapshot
Integrated Modular Avionics (IMA) Partition Scheduling with Conflict-Free I/O for Multicore Avionics Systems
inferred← citeshttps://doi.org/10.1109/date.2010.5457205openalex-snapshot
Transition-aware real-time task scheduling for reconfigurable embedded systems
inferred← citeshttps://doi.org/10.1109/ecrts.2014.31openalex-snapshot
A Framework to Construct Customized Harmonic Periods for Real-Time Systems
inferred← citeshttps://doi.org/10.1109/ecrts.2016.11openalex-snapshot
Non-work-conserving Non-preemptive Scheduling: Motivations, Challenges, and Potential Solutions
inferred← citeshttps://doi.org/10.1109/ecrts.2016.15openalex-snapshot
A New Approach for Limited Preemptive Scheduling in Systems with Preemption Overhead
inferred← citeshttps://doi.org/10.1109/estmed.2006.321271openalex-snapshot
Resource Manager for Non-preemptive Heterogeneous Multiprocessor System-on-chip
inferred← citeshttps://doi.org/10.1109/icess.2016.41openalex-snapshot
A Non-Work-Conserving Model for P-FRP Fixed Priority Scheduling
inferred← citeshttps://doi.org/10.1109/newcas.2014.6934073openalex-snapshot
An efficient scheduling algorithm of non-preemptive independent tasks for biomedical systems
inferred← citeshttps://doi.org/10.1109/rtas.2017.34openalex-snapshot
Offline Equivalence: A Non-preemptive Scheduling Technique for Resource-Constrained Embedded Real-Time Systems (Outstanding Paper)
inferred← citeshttps://doi.org/10.1109/rtas.2018.00035openalex-snapshot
FIFO with Offsets: High Schedulability with Low Overheads
inferred← citeshttps://doi.org/10.1109/rtcsa.2012.39openalex-snapshot
A Method for Improving Delay-Sensitive Accuracy in Real-Time Embedded Systems
inferred← citeshttps://doi.org/10.1109/rtcsa.2017.8046318openalex-snapshot
Online admission of non-preemptive aperiodic mixed-critical tasks in hierarchic schedules
inferred← citeshttps://doi.org/10.1109/rtss46320.2019.00025openalex-snapshot
From Code to Weakly Hard Constraints: A Pragmatic End-to-End Toolchain for Timed C
inferred← citeshttps://doi.org/10.1109/rtss55097.2022.00019openalex-snapshot
A Utilization-based Test for Non-preemptive Gang Tasks on Multiprocessors
inferred← citeshttps://doi.org/10.1109/rtss62706.2024.00033openalex-snapshot
FLEX: Adaptive Task Batch Scheduling with Elastic Fusion in Multi-Modal Multi-View Machine Perception
inferred← citeshttps://doi.org/10.1109/samos.2011.6045454openalex-snapshot
Distributed resource management for concurrent execution of multimedia applications on MPSoC platforms
inferred← citeshttps://doi.org/10.1109/synasc.2010.81openalex-snapshot
An Efficient Scheduling Algorithm for the Multiprocessor Platform
inferred← citeshttps://doi.org/10.1109/synasc.2011.21openalex-snapshot
Estimating the Number of Processors towards an Efficient Non-preemptive Scheduling Algorithm
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/synasc.2016.035openalex-snapshot
Resource Bounding for Non-Preemptive Task Scheduling on a Multiprocessor Platform
inferred← citeshttps://doi.org/10.1109/synasc54541.2021.00025openalex-snapshot
Designing a New Soft-Hard Task Model for Scheduling Real-Time Systems on a Multiprocessor Platform
inferred← citeshttps://doi.org/10.1109/tc.2017.2722443openalex-snapshot
Time-Triggered Co-Scheduling of Computation and Communication with Jitter Requirements
inferred← citeshttps://doi.org/10.1109/tc.2020.3003083openalex-snapshot
Control Performance Optimization for Application Integration on Automotive Architectures
inferred← citeshttps://doi.org/10.1109/tpds.2016.2571281openalex-snapshot
Elastic Reliability Optimization Through Peer-to-Peer Checkpointing in Cloud Computing
inferred← citeshttps://doi.org/10.1109/wowmom.2014.6918962openalex-snapshot
An optimal model to partition the evolution of periodic tasks in wireless sensor networks
inferred← citeshttps://doi.org/10.1142/s0218126615501406openalex-snapshot
Timing Analysis of TTEthernet Traffic
inferred← citeshttps://doi.org/10.1145/1064979.1064986openalex-snapshot
A programmable microkernel for real-time systems
inferred← citeshttps://doi.org/10.1145/2659787.2659806openalex-snapshot
On the Optimality of RM and EDF for Non-Preemptive Real-Time Harmonic Tasks
inferred← citeshttps://doi.org/10.1145/2834848.2834856openalex-snapshot
Non-work-conserving scheduling of non-preemptive hard real-time tasks based on fixed priorities
inferred← citeshttps://doi.org/10.1145/3236011openalex-snapshot
Schedule Adaptation for Ensuring Reliability in RT-WiFi-Based Networked Embedded Systems
inferred← citeshttps://doi.org/10.1145/3269482.3269486openalex-snapshot
Bounding execution resources for the task scheduling problem in cyber-physical systems
inferred← citeshttps://doi.org/10.1145/3431232openalex-snapshot
Survey on Periodic Scheduling for Time-triggered Hard Real-time Systems
inferred← citeshttps://doi.org/10.1504/ijguc.2012.051422openalex-snapshot
An efficient scheduling algorithm for the non-preemptive independent multiprocessor platform
inferred← citeshttps://doi.org/10.21236/ada603329openalex-snapshot
A Programmable Microkernel for Real-Time Systems
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.699.840openalex-snapshot
Energy Efficient Scheduling Algorithm for Soft Real Time System with High Deadline Meeting Rate on Overload
inferred← citeshttps://doi.org/10.48550/arxiv.2011.01898openalex-snapshot
Periodic Scheduling and Packing Problems
inferred← citeshttps://doi.org/10.5555/1322109.1322122openalex-snapshot
Resource Manager for Non-preemptive Heterogeneous Multiprocessor System-on-chip
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.