On the public citation graph
Periodic multiprocessor scheduling
0 signed · 89 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/1-4020-8099-9_26openalex-snapshot
Approximation algorithms for Bin Packing
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_26openalex-snapshot
Paths, Trees, and Flowers
inferredcites →https://doi.org/10.1007/978-3-7091-4338-4_3openalex-snapshot
Approximation Algorithms for Bin-Packing — An Updated Survey
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/0020-0190(89)90209-3openalex-snapshot
Scheduling periodic and sporadic tasks in a real-time system
inferredcites →https://doi.org/10.1016/0166-218x(85)90024-1openalex-snapshot
A polynomial feasibility test for preemptive periodic scheduling of unrelated processors
inferredcites →https://doi.org/10.1016/0166-218x(86)90040-5openalex-snapshot
Optimal schedules for periodically recurring events
inferredcites →https://doi.org/10.1016/0166-218x(89)90008-5openalex-snapshot
Scheduling periodic events
inferredcites →https://doi.org/10.1016/0166-218x(89)90011-5openalex-snapshot
An O(n1.5) algorithm to color proper circular arcs
inferredcites →https://doi.org/10.1016/0166-218x(92)00036-lopenalex-snapshot
Periodic assignment and graph colouring
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/b978-155860702-6/50016-8openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
inferredcites →https://doi.org/10.1109/taes.1976.308251openalex-snapshot
Periodic Job Scheduling in a Distributed Processor System
inferredcites →https://doi.org/10.1109/taes.7openalex-snapshot
IEEE Transactions on Aerospace and Electronic Systems
inferredcites →https://doi.org/10.1109/tc.1979.1675260openalex-snapshot
An Optimal Solution for the Channel-Assignment Problem
inferredcites →https://doi.org/10.1137/0202019openalex-snapshot
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
inferredcites →https://doi.org/10.1137/0402049openalex-snapshot
A Mathematical Model for Periodic Scheduling Problems
inferredcites →https://doi.org/10.1137/0601025openalex-snapshot
The Complexity of Coloring Circular Arcs and Chords
inferredcites →https://doi.org/10.1137/0602012openalex-snapshot
An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs
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/800158.805069openalex-snapshot
Wire routing by optimizing channel assignment within large apertures
inferredcites →https://doi.org/10.1287/opre.26.1.127openalex-snapshot
On a Real-Time Scheduling Problem
inferredcites →https://doi.org/10.1287/opre.28.5.1074openalex-snapshot
Cyclic Scheduling via Integer Programs with Circular Ones
inferredcites →https://doi.org/10.1287/opre.29.3.501openalex-snapshot
A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering
inferredcites →https://doi.org/10.1287/opre.30.4.760openalex-snapshot
Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets
inferredcites →https://doi.org/10.1287/opre.33.3.690openalex-snapshot
Technical Note—Optimal Scheduling of Periodic Activities
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/1-4020-4995-1openalex-snapshot
Intelligent Algorithms in Ambient and Biomedical Computing
inferred← citeshttps://doi.org/10.1007/1-4020-4995-1_5openalex-snapshot
Optimal Selection of TV Shows for Watching and Recording
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/978-3-319-01246-9_5openalex-snapshot
Resource Modeling and Compile Time Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-319-01246-9_6openalex-snapshot
Mode-Controlled Data Flow
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_39openalex-snapshot
An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_26openalex-snapshot
Scheduling Periodic Tasks in a Hard Real-Time Environment
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_2openalex-snapshot
Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods
inferred← citeshttps://doi.org/10.1007/bf01719261openalex-snapshot
A variable-depth search algorithm for the recursive bipartitioning of signal flow graphs
inferred← citeshttps://doi.org/10.1007/bfb0024706openalex-snapshot
Multidimensional periodic scheduling model and complexity
inferred← citeshttps://doi.org/10.1007/s005300050022openalex-snapshot
Storing continuous-media data on a compact disc
inferred← citeshttps://doi.org/10.1007/s10951-005-1639-4openalex-snapshot
Tabu Search Algorithms for Cyclic Machine Scheduling Problems
inferred← citeshttps://doi.org/10.1007/s10951-014-0389-6openalex-snapshot
Line search method for solving a non-preemptive strictly periodic scheduling problem
inferred← citeshttps://doi.org/10.1007/s10951-024-00813-0openalex-snapshot
Scheduling periodic messages on a shared link without buffering
inferred← citeshttps://doi.org/10.1007/s11241-012-9148-yopenalex-snapshot
Strictly periodic scheduling in IMA-based architectures
inferred← citeshttps://doi.org/10.1007/s11241-015-9226-zopenalex-snapshot
Schedulability analysis of non-preemptive strictly periodic tasks in multi-core real-time systems
inferred← citeshttps://doi.org/10.1007/s11265-016-1193-7openalex-snapshot
Performance Analysis of Weakly-Consistent Scenario-Aware Dataflow Graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(92)00036-lopenalex-snapshot
Periodic assignment and graph colouring
inferred← citeshttps://doi.org/10.1016/j.ejor.2003.09.036openalex-snapshot
Vehicle minimization for periodic deliveries
inferred← citeshttps://doi.org/10.1016/j.endm.2013.05.105openalex-snapshot
A Network Approach to a Geometric Packing Problem
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.2016.04.014openalex-snapshot
Start time configuration for strictly periodic real-time task systems
inferred← citeshttps://doi.org/10.1016/j.sysarc.2018.09.002openalex-snapshot
Scheduling non-preemptive tasks with strict periods in multi-core real-time systems
inferred← citeshttps://doi.org/10.1016/j.tre.2016.09.007openalex-snapshot
The multi-period service territory design problem – An introduction, a model and a heuristic approach
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00112-7openalex-snapshot
The complexity of multidimensional periodic scheduling
inferred← citeshttps://doi.org/10.1023/a:1018978529821openalex-snapshot
Recovering cyclic schedules from delay
inferred← citeshttps://doi.org/10.1080/00207543.2015.1070969openalex-snapshot
Solving the bi-objective optimisation problem with periodic delivery operations using a lexicographic method
inferred← citeshttps://doi.org/10.1109/43.402495openalex-snapshot
Improved force-directed scheduling in high-throughput digital signal processing
inferred← citeshttps://doi.org/10.1109/43.952736openalex-snapshot
A two-stage solution approach to multidimensional periodic scheduling
inferred← citeshttps://doi.org/10.1109/access.2019.2941958openalex-snapshot
Sensitivity Analysis of Strictly Periodic Tasks in Multi-Core Real-Time Systems
inferred← citeshttps://doi.org/10.1109/access.2020.3002972openalex-snapshot
Research on Partition Parameter Design Method for Integrated Modular Avionics Based on MOEA/D-ADV
inferred← citeshttps://doi.org/10.1109/acssc.2014.7094470openalex-snapshot
Performance analysis of weakly-consistent scenario-aware dataflow graphs
inferred← citeshttps://doi.org/10.1109/compsacw.2013.16openalex-snapshot
Cost Optimization Strategy for Iterative Integration of Multi-critical Functions in IMA and TTEthernet Architecture
inferred← citeshttps://doi.org/10.1109/ecrts.2011.29openalex-snapshot
A Best-Response Algorithm for Multiprocessor Periodic Scheduling
inferred← citeshttps://doi.org/10.1109/empdp.1993.336424openalex-snapshot
Static computation of standard linear algebra subroutines for PTAH
inferred← citeshttps://doi.org/10.1109/etfa.1995.496775openalex-snapshot
Periodic scheduling in a multimedia server
inferred← citeshttps://doi.org/10.1109/etfa.2011.6059014openalex-snapshot
Scheduling non-preemptive hard real-time tasks with strict periods
inferred← citeshttps://doi.org/10.1109/etfa.2012.6489569openalex-snapshot
Schedulability analysis for a combination of non-preemptive strict periodic tasks and preemptive sporadic tasks
inferred← citeshttps://doi.org/10.1109/iccad.1991.185254openalex-snapshot
Scheduling in programmable video signal processors
inferred← citeshttps://doi.org/10.1109/iccds.2017.8120477openalex-snapshot
Scheduling of non-preemptive strictly periodic tasks in multi-core systems
inferred← citeshttps://doi.org/10.1109/imcsit.2008.4747349openalex-snapshot
On a class of periodic scheduling problems: Models, lower bounds and heuristics
inferred← citeshttps://doi.org/10.1109/ised.2017.8303931openalex-snapshot
Non-preemptive multiprocessor scheduling for periodic real-time tasks
inferred← citeshttps://doi.org/10.1109/pic.2015.7489902openalex-snapshot
Schedulability analysis for independent partitions in integrated modular avionics systems
inferred← citeshttps://doi.org/10.1109/rtcsa.2016.38openalex-snapshot
Allocation and Scheduling of Strictly Periodic Tasks in Multi-core Real-Time Systems
inferred← citeshttps://doi.org/10.1109/sies.2017.7993394openalex-snapshot
Model-based deployment generation for safety-critical avionics systems
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.2015.2437379openalex-snapshot
Best-Harmonically-Fit Periodic Task Assignment Algorithm on Multiple Periodic Resources
inferred← citeshttps://doi.org/10.1109/wpdrts.1997.637997openalex-snapshot
Real-time scheduling in video systems
inferred← citeshttps://doi.org/10.1145/123465.123502openalex-snapshot
Architecture and programming of a VLIW style programmable video signal processor
inferred← citeshttps://doi.org/10.1287/ijoc.9.4.351openalex-snapshot
Scheduling Periodic Tasks with Slack
inferred← citeshttps://doi.org/10.2991/978-94-6463-198-2_121openalex-snapshot
A Review of Task Scheduling Problems
inferred← citeshttps://doi.org/10.3390/electronics14010203openalex-snapshot
Research on Low-Latency TTP–TSN Cross-Domain Network Planning Problem
inferred← citeshttps://doi.org/10.3990/1.9789036515870openalex-snapshot
Cyclic machine scheduling with tool transportation
inferred← citeshttps://doi.org/10.48550/arxiv.2002.07606openalex-snapshot
Scheduling periodic messages on a shared link
inferred← citeshttps://doi.org/10.5075/epfl-thesis-5561openalex-snapshot
Approximation Algorithms for Modern Multi-Processor Scheduling Problems
inferred← citeshttps://doi.org/10.6100/ir450513openalex-snapshot
Multidimensional periodic scheduling
inferred← citeshttps://doi.org/10.6100/ir724538openalex-snapshot
Temporal analysis and scheduling of hard real-time radios running on a multi-processor
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.