On the public citation graph
Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor
0 signed · 506 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.1002/nav.3800210113openalex-snapshot
Some simple scheduling algorithms
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/bf01553887openalex-snapshot
A new algorithm for scheduling periodic, real-time tasks
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/0166-5316(82)90024-4openalex-snapshot
On the complexity of fixed-priority scheduling of periodic, real-time tasks
inferredcites →https://doi.org/10.1016/s0304-0208(08)73231-6openalex-snapshot
Selected Topics in Scheduling Theory
inferredcites →https://doi.org/10.1016/s0304-0208(13)73561-8openalex-snapshot
Annals of Discrete Mathematics
inferredcites →https://doi.org/10.1109/real.1990.128746openalex-snapshot
Preemptively scheduling hard-real-time sporadic tasks on one processor
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/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.1287/moor.8.4.538openalex-snapshot
Integer Programming with a Fixed Number of Variables
inferredcites →https://doi.org/10.13182/nse70-a19705openalex-snapshot
The Art of Computer Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118601365.ch7openalex-snapshot
Scheduling in Distributed Real‐Time Systems
inferred← citeshttps://doi.org/10.1002/9781118984413.ch2openalex-snapshot
Uniprocessor Architecture Solutions
inferred← citeshttps://doi.org/10.1002/dac.688openalex-snapshot
End-to-end response time with fixed priority scheduling: trajectory approach versus holistic approach
inferred← citeshttps://doi.org/10.1002/spe.2373openalex-snapshot
Design and analysis of target-sensitive real-time systems
inferred← citeshttps://doi.org/10.1002/spe.2840openalex-snapshot
Timing isolation and improved scheduling of deep neural networks for real‐time systems
inferred← citeshttps://doi.org/10.1006/inco.1995.1028openalex-snapshot
On Non-preemptive Scheduling of Recurring Tasks Using Inserted Idle Times
inferred← citeshttps://doi.org/10.1007/0-8176-4404-0_8openalex-snapshot
Real-Time Scheduling for Embedded Systems
inferred← citeshttps://doi.org/10.1007/11560333_12openalex-snapshot
A Compositional Framework for Real-Time Embedded Systems
inferred← citeshttps://doi.org/10.1007/11668855_17openalex-snapshot
The Trajectory Approach for the End-to-End Response Times with Non-preemptive FP/EDF*
inferred← citeshttps://doi.org/10.1007/11767077_1openalex-snapshot
Hierarchical Scheduling with Ada 2005
inferred← citeshttps://doi.org/10.1007/11823063_4openalex-snapshot
A Compositional Framework for Real-Time Guarantees
inferred← citeshttps://doi.org/10.1007/3-540-44463-7_35openalex-snapshot
Keeping a Very Large Website Up-to-date: Some Feasibility Results
inferred← citeshttps://doi.org/10.1007/3-540-44634-6_5openalex-snapshot
On the Complexity of Scheduling Conditional Real-Time Code
inferred← citeshttps://doi.org/10.1007/3-540-45739-9_3openalex-snapshot
Real-Time Operating Systems: Problems and Novel Solutions
inferred← citeshttps://doi.org/10.1007/3-540-48309-8_101openalex-snapshot
On the Feasibility of Website Refresh Queries
inferred← citeshttps://doi.org/10.1007/3-540-56891-3_37openalex-snapshot
Task scheduling with restricted preemptions
inferred← citeshttps://doi.org/10.1007/978-0-85729-318-3_5openalex-snapshot
Network Technologies for Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-1-4615-5535-3_3openalex-snapshot
Fundamentals of EDF Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-030-13435-8_22openalex-snapshot
Geometrical Closure of Binary $$V_{3/2}$$ Languages
inferred← citeshttps://doi.org/10.1007/978-3-030-99336-8_11openalex-snapshot
Static Race Detection for Periodic Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-41969-0_3openalex-snapshot
Real-Time Scheduling and Reconfiguration
inferred← citeshttps://doi.org/10.1007/978-3-031-41969-0_5openalex-snapshot
Priority-Free Conditionally-Preemptive Real-Time Scheduling Based on R-W Method
inferred← citeshttps://doi.org/10.1007/978-3-031-41969-0_6openalex-snapshot
Modular Scheduling/Reconfiguration with Exact Execution Time Based on R-W Method
inferred← citeshttps://doi.org/10.1007/978-3-031-45410-3_9openalex-snapshot
Handling Overload Conditions
inferred← citeshttps://doi.org/10.1007/978-3-031-67114-2_10openalex-snapshot
Static Race Detection for Periodic Real-Time Programs with IPCP Locks
inferred← citeshttps://doi.org/10.1007/978-3-031-73751-0_10openalex-snapshot
A Closer Look at Pseudo-polynomial Time and Its Use in Real-Time Scheduling Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-03871-1_6openalex-snapshot
A Real-Time Medium Access Protocol Supporting Dynamic Spectrum Allocation in Industrial Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-10262-7_6openalex-snapshot
Reliability Enhancement for Hard Real-Time Communication in Industrial Packet-Switched Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-65831-5_2openalex-snapshot
PARAD Repository: On the Capitalization of the Performance Analysis Process for AADL Designs
inferred← citeshttps://doi.org/10.1007/978-3-319-94493-7_5openalex-snapshot
Treatment of Interrupts in Embedded and Real Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-24675-6_8openalex-snapshot
Deterministic End-to-End Guarantees for Real-Time Applications in a DiffServ-MPLS Domain
inferred← citeshttps://doi.org/10.1007/978-3-540-31956-6_35openalex-snapshot
Holistic and Trajectory Approaches for Distributed Non-preemptive FP/DP* Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-540-45212-6_6openalex-snapshot
Rate Monotonic vs. EDF: Judgment Day
inferred← citeshttps://doi.org/10.1007/978-3-540-70844-5_8openalex-snapshot
Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L)
inferred← citeshttps://doi.org/10.1007/978-3-540-71493-4_30openalex-snapshot
On Self-triggered Full-Information H-Infinity Controllers
inferred← citeshttps://doi.org/10.1007/978-3-540-74442-9_48openalex-snapshot
Fast Calculation of Permissible Slowdown Factors for Hard Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-77092-3_13openalex-snapshot
Revisiting Fixed Priority Techniques
inferred← citeshttps://doi.org/10.1007/978-3-540-77092-3_15openalex-snapshot
Real-Time Scheduling Under Time-Interval Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-92221-6_43openalex-snapshot
Uniprocessor EDF Scheduling with Mode Change
inferred← citeshttps://doi.org/10.1007/978-3-642-13089-2_15openalex-snapshot
Geometricity of Binary Regular Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-15781-3_20openalex-snapshot
Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-18098-9_8openalex-snapshot
Regular Geometrical Languages and Tiling the Plane
inferred← citeshttps://doi.org/10.1007/978-3-642-37974-1_10openalex-snapshot
Increased Communication Reliability for Delay-Sensitive Platooning Applications on Top of IEEE 802.11p
inferred← citeshttps://doi.org/10.1007/978-3-642-38853-8_17openalex-snapshot
Compositional Timing Analysis of Real-Time Systems Based on Resource Segregation Abstraction
inferred← citeshttps://doi.org/10.1007/978-94-007-1192-1_16openalex-snapshot
On the Implementation of Dependable Real-Time Systems with Non-Preemptive EDF
inferred← citeshttps://doi.org/10.1007/978-94-007-2105-0_32openalex-snapshot
An Efficient Deadline and Period Assignment Scheme for Maintaining Temporal Consistency Under EDF
inferred← citeshttps://doi.org/10.1007/978-981-10-7179-9_2openalex-snapshot
TS-Preemption Threshold and Priority Optimization for the Process Scheduling in Integrated Modular Avionics
inferred← citeshttps://doi.org/10.1007/978-981-15-6401-7_5-1openalex-snapshot
Real-Time Scheduling for Computing Architectures
inferred← citeshttps://doi.org/10.1007/978-981-287-251-7_3openalex-snapshot
Practical Considerations in Optimal Multiprocessor Scheduling
inferred← citeshttps://doi.org/10.1007/978-981-287-251-7_35openalex-snapshot
Complexity of Uniprocessor Scheduling Analysis
inferred← citeshttps://doi.org/10.1007/978-981-4585-87-3_3-1openalex-snapshot
Practical Considerations in Optimal Multiprocessor Scheduling
inferred← citeshttps://doi.org/10.1007/978-981-4585-87-3_35-1openalex-snapshot
Complexity of Uniprocessor Scheduling Analysis
inferred← citeshttps://doi.org/10.1007/978-981-4585-87-3_6-1openalex-snapshot
Hierarchical Scheduling
inferred← citeshttps://doi.org/10.1007/978-981-97-9314-3_5openalex-snapshot
Real-Time Scheduling for Computing Architectures
inferred← citeshttps://doi.org/10.1007/bf00365519openalex-snapshot
Improvement in feasibility testing for real-time tasks
inferred← citeshttps://doi.org/10.1007/bf01940883openalex-snapshot
Proportionate Progress: A Notion of Fairness in Resource Allocation
inferred← citeshttps://doi.org/10.1007/bfb0029605openalex-snapshot
On preemptive scheduling of periodic, real-time tasks on one processor
inferred← citeshttps://doi.org/10.1007/bfb0057781openalex-snapshot
A uniform reliable multicast protocol with guaranteed response times
inferred← citeshttps://doi.org/10.1007/bfb0097916openalex-snapshot
From task scheduling in single processor environments to message scheduling in a PROFIBUS fieldbus network
inferred← citeshttps://doi.org/10.1007/s00453-011-9505-6openalex-snapshot
Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
inferred← citeshttps://doi.org/10.1007/s10515-010-0074-8openalex-snapshot
A model-based approach for multiple QoS in scheduling: from models to implementation
inferred← citeshttps://doi.org/10.1007/s10617-023-09267-7openalex-snapshot
Scheduling and energy savings for small scale embedded FreeRTOS-based real-time systems
inferred← citeshttps://doi.org/10.1007/s10626-019-00288-8openalex-snapshot
SCT-based priority-free conditionally-preemptive scheduling of modular real-time systems with exact task execution time
inferred← citeshttps://doi.org/10.1007/s10846-013-9962-zopenalex-snapshot
Hard Real-Time Implementation of a Nonlinear Controller for the Quadrotor Helicopter
inferred← citeshttps://doi.org/10.1007/s10846-018-0967-5openalex-snapshot
A Design and Analysis Methodology for Component-Based Real-Time Architectures of Autonomous Systems
inferred← citeshttps://doi.org/10.1007/s10951-009-0137-5openalex-snapshot
Open problems in real-time scheduling
inferred← citeshttps://doi.org/10.1007/s11036-010-0250-xopenalex-snapshot
iDSRT: Integrated Dynamic Soft Real-time Architecture for Critical Infrastructure Data Delivery over WLAN
inferred← citeshttps://doi.org/10.1007/s11227-017-1962-5openalex-snapshot
KTS: a real-time mapping algorithm for NoC-based many-cores
inferred← citeshttps://doi.org/10.1007/s11227-022-04446-yopenalex-snapshot
Schedulability analysis of dynamic priority real-time systems with contention
inferred← citeshttps://doi.org/10.1007/s11235-005-4315-2openalex-snapshot
Improving the Analysis of Distributed Non-Preemptive FP/DP* Scheduling with the Trajectory Approach
inferred← citeshttps://doi.org/10.1007/s11235-006-9016-yopenalex-snapshot
Worst case response times in a Bluetooth piconet: scheduling combining 1-RR or E-RR with FIFO or EDF
inferred← citeshttps://doi.org/10.1007/s11241-005-0506-xopenalex-snapshot
Feasibility Analysis of Real-Time Periodic Tasks with Offsets
inferred← citeshttps://doi.org/10.1007/s11241-006-9009-7openalex-snapshot
Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems
inferred← citeshttps://doi.org/10.1007/s11241-008-9055-4openalex-snapshot
On earliest deadline first scheduling for temporal consistency maintenance
inferred← citeshttps://doi.org/10.1007/s11241-008-9060-7openalex-snapshot
The space of EDF deadlines: the exact region and a convex approximation
inferred← citeshttps://doi.org/10.1007/s11241-009-9066-9openalex-snapshot
An earlier time for inserting and/or accelerating tasks
inferred← citeshttps://doi.org/10.1007/s11241-009-9071-zopenalex-snapshot
Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption
inferred← citeshttps://doi.org/10.1007/s11241-009-9079-4openalex-snapshot
Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling
inferred← citeshttps://doi.org/10.1007/s11241-009-9088-3openalex-snapshot
Handling mixed sets of tasks in combined offline and online scheduled real-time systems
inferred← citeshttps://doi.org/10.1007/s11241-010-9100-yopenalex-snapshot
Competitive analysis of online real-time scheduling algorithms under hard energy constraint
inferred← citeshttps://doi.org/10.1007/s11241-011-9144-7openalex-snapshot
A bandwidth allocation scheme for compositional real-time systems with periodic resources
inferred← citeshttps://doi.org/10.1007/s11241-012-9147-zopenalex-snapshot
Feasibility analysis of real-time transactions
inferred← citeshttps://doi.org/10.1007/s11241-014-9202-zopenalex-snapshot
Fault-tolerant and real-time scheduling for mixed-criticality systems
inferred← citeshttps://doi.org/10.1007/s11241-014-9207-7openalex-snapshot
Scheduling algorithms to reduce the static energy consumption of real-time systems
inferred← citeshttps://doi.org/10.1007/s11241-015-9222-3openalex-snapshot
The limited-preemptive feasibility of real-time tasks on uniprocessors
inferred← citeshttps://doi.org/10.1007/s11241-015-9228-xopenalex-snapshot
Cache related pre-emption delays in hierarchical scheduling
inferred← citeshttps://doi.org/10.1007/s11241-015-9233-0openalex-snapshot
Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms
inferred← citeshttps://doi.org/10.1007/s11241-015-9236-xopenalex-snapshot
Energy-aware task mapping onto heterogeneous platforms using DVFS and sleep states
inferred← citeshttps://doi.org/10.1007/s11241-015-9244-xopenalex-snapshot
Combined task- and network-level scheduling for distributed time-triggered systems
inferred← citeshttps://doi.org/10.1007/s11241-016-9256-1openalex-snapshot
Periodicity of real-time schedules for dependent periodic tasks on identical multiprocessor platforms
inferred← citeshttps://doi.org/10.1007/s11241-016-9258-zopenalex-snapshot
Real-time scheduling algorithm for safety-critical systems on faulty multicore environments
inferred← citeshttps://doi.org/10.1007/s11241-018-9301-3openalex-snapshot
A design flow for supporting component-based software development in multiprocessor real-time systems
inferred← citeshttps://doi.org/10.1007/s11241-018-9303-1openalex-snapshot
On the ineffectiveness of 1/m-based interference bounds in the analysis of global EDF and FIFO scheduling
inferred← citeshttps://doi.org/10.1007/s11241-018-9320-0openalex-snapshot
Efficient offline scheduling of task-sets with complex constraints on large distributed time-triggered systems
inferred← citeshttps://doi.org/10.1007/s11241-021-09367-2openalex-snapshot
Dynamic power management under the RUN scheduling algorithm: a slack filling approach
inferred← citeshttps://doi.org/10.1007/s11241-023-09408-yopenalex-snapshot
Cutting-plane algorithms for preemptive uniprocessor scheduling problems
inferred← citeshttps://doi.org/10.1007/s11241-024-09423-7openalex-snapshot
Minimizing cache usage with fixed-priority and earliest deadline first scheduling
inferred← citeshttps://doi.org/10.1007/s11241-025-09450-yopenalex-snapshot
Learning-assisted schedulability analysis: opportunities and limitations
inferred← citeshttps://doi.org/10.1007/s11241-026-09457-zopenalex-snapshot
A safety-aware deep learning framework for scalable schedulability analysis of variable-length real-time task sets
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90360-6openalex-snapshot
Feasibility problems for recurring tasks on one processor
inferred← citeshttps://doi.org/10.1016/j.cirpj.2012.09.006openalex-snapshot
A methodology for static and dynamic scheduling of automation tasks in reconfigurable production systems
inferred← citeshttps://doi.org/10.1016/j.comcom.2004.05.006openalex-snapshot
Analysis of deadline assignment methods in distributed real-time systems
inferred← citeshttps://doi.org/10.1016/j.comnet.2008.10.018openalex-snapshot
Guaranteed real-time communication in packet-switched networks with FCFS queuing
inferred← citeshttps://doi.org/10.1016/j.ejor.2009.03.011openalex-snapshot
A note on ‘Efficient scheduling of periodic information monitoring requests’
inferred← citeshttps://doi.org/10.1016/j.ifacol.2015.06.486openalex-snapshot
Modeling standby redundancies in repairable systems as guarded preemption mechanisms
inferred← citeshttps://doi.org/10.1016/j.ifacol.2021.10.040openalex-snapshot
O(1)-online approximation of the slack for periodic task sets under EDF scheduling
inferred← citeshttps://doi.org/10.1016/j.is.2017.03.005openalex-snapshot
Dynamic priority scheduling of periodic queries in on-demand data dissemination systems
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.04.002openalex-snapshot
Holistic analysis of asynchronous real-time transactions with earliest deadline scheduling
inferred← citeshttps://doi.org/10.1016/j.jss.2012.04.050openalex-snapshot
Convex optimization framework for intermediate deadline assignment in soft and hard real-time distributed systems
inferred← citeshttps://doi.org/10.1016/j.jss.2014.12.031openalex-snapshot
Power-aware scheduling of compositional real-time frameworks
inferred← citeshttps://doi.org/10.1016/j.jss.2016.05.040openalex-snapshot
Real-time hierarchical systems with arbitrary scheduling at global level
inferred← citeshttps://doi.org/10.1016/j.jss.2017.12.033openalex-snapshot
A survey of schedulability analysis techniques for rate-dependent tasks
inferred← citeshttps://doi.org/10.1016/j.osn.2016.11.004openalex-snapshot
Providing efficient support for real-time guarantees in a fibre-optic AWG-based network for embedded systems
inferred← citeshttps://doi.org/10.1016/j.pmcj.2017.06.011openalex-snapshot
Cyber–physical systems: Extending pervasive sensing from control theory to the Internet of Things
inferred← citeshttps://doi.org/10.1016/j.procs.2015.01.027openalex-snapshot
Fault Tolerant Scheduling of Mixed Criticality Real-time Tasks under Error Bursts
inferred← citeshttps://doi.org/10.1016/j.riai.2013.03.009openalex-snapshot
Selección del periodo para la minimización del hiperperiodo
inferred← citeshttps://doi.org/10.1016/j.suscom.2011.09.001openalex-snapshot
Energy efficient task partitioning and real-time scheduling on heterogeneous multiprocessor platforms with QoS requirements
inferred← citeshttps://doi.org/10.1016/j.suscom.2019.02.002openalex-snapshot
Feasibility analysis of periodic real-time systems with energy harvesting capabilities
inferred← citeshttps://doi.org/10.1016/j.sysarc.2011.02.008openalex-snapshot
Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling
inferred← citeshttps://doi.org/10.1016/j.sysarc.2013.11.011openalex-snapshot
Deadline and activation time assignment for partitioned real-time application on multiprocessor reservations
inferred← citeshttps://doi.org/10.1016/j.sysarc.2014.10.001openalex-snapshot
Race-to-halt energy saving strategies
inferred← citeshttps://doi.org/10.1016/j.sysarc.2014.12.001openalex-snapshot
Preference-oriented real-time scheduling and its application in fault-tolerant systems
inferred← citeshttps://doi.org/10.1016/j.sysarc.2015.07.001openalex-snapshot
Intra-task device scheduling for real-time embedded systems
inferred← citeshttps://doi.org/10.1016/j.sysarc.2017.01.002openalex-snapshot
Energy-efficient scheduling for moldable real-time tasks on heterogeneous computing platforms
inferred← citeshttps://doi.org/10.1016/j.sysarc.2024.103248openalex-snapshot
A novel real-time calculus for arbitrary job patterns and deadlines
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.10.009openalex-snapshot
Scheduling hard sporadic tasks with regular languages and generating functions
inferred← citeshttps://doi.org/10.1016/s0164-1212(03)00236-xopenalex-snapshot
Feasibility analysis of hard real-time periodic tasks
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00362-1openalex-snapshot
Minimal schedulability interval for real-time systems of periodic tasks with offsets
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)83306-1openalex-snapshot
Rate-monotonic scheduling for hard-real-time systems
inferred← citeshttps://doi.org/10.1016/s1383-7621(99)00009-0openalex-snapshot
Schedulability analysis of periodic and aperiodic tasks with resource constraints
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)36729-0openalex-snapshot
Deadline Assignment to Reduce Output Jitter of Real-Time Tasks
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)39940-8openalex-snapshot
Some Practical Results About Fixed-Priority Scheduling and Offsets
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)43765-7openalex-snapshot
Improvement in Feasibility Testing for Real-Time Tasks 1
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)57454-6openalex-snapshot
Reducing Delays in RT Control: The Control Action Interval
inferred← citeshttps://doi.org/10.1023/a:1007964900035openalex-snapshot
A Feasibility Decision Algorithm for Rate Monotonic and Deadline Monotonic Scheduling
inferred← citeshttps://doi.org/10.1023/a:1015673516542openalex-snapshot
Off-Line Computation of Real-Time Schedules Using Petri Nets
inferred← citeshttps://doi.org/10.1023/a:1019795414875openalex-snapshot
Stack Size Minimization for Embedded Real-Time Systems-on-a-Chip
inferred← citeshttps://doi.org/10.1023/a:1021782503695openalex-snapshot
Scheduling of Offset Free Systems
inferred← citeshttps://doi.org/10.1023/b:time.0000045315.61234.1eopenalex-snapshot
Real Time Scheduling Theory: A Historical Perspective
inferred← citeshttps://doi.org/10.1023/b:time.0000048932.30002.d9openalex-snapshot
Rate Monotonic vs. EDF: Judgment Day
inferred← citeshttps://doi.org/10.1093/comjnl/44.6.486openalex-snapshot
Managing Latency and Buffer Requirements in Processing Graph Chains
inferred← citeshttps://doi.org/10.1093/ietfec/e89-a.11.3260openalex-snapshot
Scheduling Real-Time Multi-Processor Systems with Distance-Constrained Tasks Using the Early-Release-Fair Model
inferred← citeshttps://doi.org/10.1109/12.805154openalex-snapshot
Optimal deadline assignment for scheduling soft aperiodic tasks in hard real-time environments
inferred← citeshttps://doi.org/10.1109/12.990127openalex-snapshot
Elastic scheduling for flexible workload management
inferred← citeshttps://doi.org/10.1109/acc.2012.6315670openalex-snapshot
Real-time scheduling of deferrable electric loads
inferred← citeshttps://doi.org/10.1109/access.2020.3017014openalex-snapshot
Evolution-Based Real-Time Job Scheduling for Co-Optimizing Processor and Memory Power Savings
inferred← citeshttps://doi.org/10.1109/access.2020.3043260openalex-snapshot
The Earliest Smooth Release Time for a New Task Based on EDF Algorithm
inferred← citeshttps://doi.org/10.1109/access.2021.3086304openalex-snapshot
FT-PIP: Flush Task Incorporated Priority-Inheritance Protocol to Reduce Information Leakage on Multiprocessor Real-Time Systems
inferred← citeshttps://doi.org/10.1109/ahs.2015.7231172openalex-snapshot
Adaptive mechanisms for component-based real-time systems
inferred← citeshttps://doi.org/10.1109/camad.2014.7033244openalex-snapshot
Military training network with admission control using real-time analysis
inferred← citeshttps://doi.org/10.1109/cdc.2013.6760772openalex-snapshot
Aggregate flexibility of a collection of loadsπ
inferred← citeshttps://doi.org/10.1109/cerma.2006.61openalex-snapshot
Minimizing the Response Times of Aperiodic Tasks in Hard Real-time Systems with EDF
inferred← citeshttps://doi.org/10.1109/cit.2006.159openalex-snapshot
Real-Time Scheduling Algorithm Based on Set Division of Resource for Embedded Operating System
inferred← citeshttps://doi.org/10.1109/cit.2010.308openalex-snapshot
Guaranteeing Optional Task Completions on (m,k)-Firm Real-Time Systems
inferred← citeshttps://doi.org/10.1109/conielecomp.2007.115openalex-snapshot
Worst Case Response Time Analysis of Sporadic Task Graphs with EDF Non-preemptive Scheduling on a Uniprocessor
inferred← citeshttps://doi.org/10.1109/cse.2009.14openalex-snapshot
An Effective RM-Based Scheduling Algorithm for Fault-Tolerant Real-Time Systems
inferred← citeshttps://doi.org/10.1109/date.2005.128openalex-snapshot
Efficient Feasibility Analysis for Real-Time Systems with EDF Scheduling
inferred← citeshttps://doi.org/10.1109/date.2005.139openalex-snapshot
Energy-Efficient, Utility Accrual Real-Time Scheduling Under the Unimodal Arbitrary Arrival Model
inferred← citeshttps://doi.org/10.1109/date.2012.6176536openalex-snapshot
On-line scheduling of target sensitive periodic tasks with the gravitational task model
inferred← citeshttps://doi.org/10.1109/dft.2016.7684072openalex-snapshot
Fault-aware sensitivity analysis for probabilistic real-time systems
inferred← citeshttps://doi.org/10.1109/ds-rt47707.2019.8958666openalex-snapshot
Combining Task-level and System-level Scheduling Modes for Mixed Criticality Systems
inferred← citeshttps://doi.org/10.1109/dsd57027.2022.00029openalex-snapshot
Placement of Chains of Real-Time Tasks on Heterogeneous Platforms under EDF Scheduling
inferred← citeshttps://doi.org/10.1109/ecrts.2004.1openalex-snapshot
A new sufficient feasibility test for asynchronous real-time periodic task sets
inferred← citeshttps://doi.org/10.1109/ecrts.2004.22openalex-snapshot
Optimized slowdown in real-time task systems
inferred← citeshttps://doi.org/10.1109/ecrts.2004.4openalex-snapshot
An event stream driven approximation for the analysis of real-time systems
inferred← citeshttps://doi.org/10.1109/ecrts.2005.29openalex-snapshot
Speed Modulation in Energy-Aware Real-Time Systems
inferred← citeshttps://doi.org/10.1109/ecrts.2006.12openalex-snapshot
Hierarchical Event Streams and Event Dependency Graphs: A New Computational Model for Embedded Real-Time Systems
inferred← citeshttps://doi.org/10.1109/ecrts.2007.35openalex-snapshot
The Space of EDF Feasible Deadlines
inferred← citeshttps://doi.org/10.1109/ecrts.2007.38openalex-snapshot
Worst-Case Response Time Analysis of Real-Time Tasks under Fixed-Priority Scheduling with Deferred Preemption Revisited
inferred← citeshttps://doi.org/10.1109/ecrts.2008.35openalex-snapshot
Period and Deadline Selection for Schedulability in Real-Time Systems
inferred← citeshttps://doi.org/10.1109/ecrts.2009.12openalex-snapshot
Competitive Analysis of Energy-Constrained Real-Time Scheduling
inferred← citeshttps://doi.org/10.1109/ecrts.2009.20openalex-snapshot
Improvement to Quick Processor-Demand Analysis for EDF-Scheduled Real-Time Systems
inferred← citeshttps://doi.org/10.1109/ecrts.2009.29openalex-snapshot
A Norm Approach for the Partitioned EDF Scheduling of Sporadic Task Systems
inferred← citeshttps://doi.org/10.1109/ecrts.2010.10openalex-snapshot
Reducing Delay Jitter of Real-Time Control Tasks through Adaptive Deadline Adjustments
inferred← citeshttps://doi.org/10.1109/ecrts.2010.12openalex-snapshot
Partitioning Parallel Applications on Multiprocessor Reservations
inferred← citeshttps://doi.org/10.1109/ecrts.2010.17openalex-snapshot
The Demand Bound Function Interface of Distributed Sporadic Pipelines of Tasks Scheduled by EDF
inferred← citeshttps://doi.org/10.1109/ecrts.2010.30openalex-snapshot
Constant-Time Admission Control for Partitioned EDF
inferred← citeshttps://doi.org/10.1109/ecrts.2011.17openalex-snapshot
Enhanced Race-To-Halt: A Leakage-Aware Energy Management Approach for Dynamic Priority Systems
inferred← citeshttps://doi.org/10.1109/ecrts.2012.34openalex-snapshot
Generalized Fixed-Priority Scheduling with Limited Preemptions
inferred← citeshttps://doi.org/10.1109/ecrts.2013.22openalex-snapshot
Quantifying the Sub-optimality of Non-preemptive Real-Time Scheduling
inferred← citeshttps://doi.org/10.1109/ecrts.2014.21openalex-snapshot
The Global Limited Preemptive Earliest Deadline First Feasibility of Sporadic Real-Time Tasks
inferred← citeshttps://doi.org/10.1109/ecrts.2015.13openalex-snapshot
On-Line Data Link Layer Scheduling in Wireless Networked Control Systems
inferred← citeshttps://doi.org/10.1109/ecrts.2015.16openalex-snapshot
Schedulability and optimization analysis for non-preemptive static priority scheduling based on task utilization and blocking factors
inferred← citeshttps://doi.org/10.1109/ecrts.2015.20openalex-snapshot
Feasibility Analysis of Engine Control Tasks under EDF Scheduling
inferred← citeshttps://doi.org/10.1109/ecrts.2015.32openalex-snapshot
Uniprocessor Feasibility of Sporadic Tasks with Constrained Deadlines Is Strongly coNP-Complete
inferred← citeshttps://doi.org/10.1109/ecrts.2016.28openalex-snapshot
PROSA: A Case for Readable Mechanized Schedulability Analysis
inferred← citeshttps://doi.org/10.1109/ecrts.2016.30openalex-snapshot
Lightweight Real-Time Synchronization under P-EDF on Symmetric and Asymmetric Multiprocessors
inferred← citeshttps://doi.org/10.1109/edis49545.2020.9296446openalex-snapshot
Task and Communication Allocation for Real-time Tasks to Networks-on-Chip Multiprocessors
inferred← citeshttps://doi.org/10.1109/edis57230.2022.9996534openalex-snapshot
Toward memory-centric scheduling for PREM task on multicore platforms, when processor assignments are specified
inferred← citeshttps://doi.org/10.1109/efta.2007.4416760openalex-snapshot
Uniprocessor scheduling under time-interval constraints
inferred← citeshttps://doi.org/10.1109/emrts.2000.854009openalex-snapshot
Non pre-emptive scheduling of messages on SMTV token-passing networks
inferred← citeshttps://doi.org/10.1109/emrts.2003.1212722openalex-snapshot
Initial values for online response time calculations
inferred← citeshttps://doi.org/10.1109/emrts.2003.1212743openalex-snapshot
On the complexity of scheduling real-time tasks with self-suspensions on one processor
inferred← citeshttps://doi.org/10.1109/emrts.2003.1212752openalex-snapshot
The capacity of implicit EDF in wireless sensor networks
inferred← citeshttps://doi.org/10.1109/emrts.2004.1311017openalex-snapshot
Optimized slowdown in real-time task systems
inferred← citeshttps://doi.org/10.1109/emrts.2004.1311022openalex-snapshot
A new suf .cient feasibility test for asynchronous real-time periodic task sets
showing the first 200 of 493 · page through all 493
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.