On the public citation graph
Adapting Futures: Scalability for Real-World Computing
0 signed · 187 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-4471-1525-0_41openalex-snapshot
CJava: Introducing Concurrent Objects in Java
inferredcites →https://doi.org/10.1007/978-3-540-73196-2_9openalex-snapshot
Composition of Model Programs
inferredcites →https://doi.org/10.1007/bf01940883openalex-snapshot
Proportionate Progress: A Notion of Fairness in Resource Allocation
inferredcites →https://doi.org/10.1007/s11241-005-4686-1openalex-snapshot
An Analysis of Fixed-Priority Schedulability on a Multiprocessor
inferredcites →https://doi.org/10.1016/s0020-0190(02)00231-4openalex-snapshot
Deadline-based scheduling of periodic task systems on multiprocessors
inferredcites →https://doi.org/10.1017/cbo9780511619540openalex-snapshot
Model-Based Software Testing and Analysis with C#
inferredcites →https://doi.org/10.1023/a:1025120124771openalex-snapshot
Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors
inferredcites →https://doi.org/10.1049/sej.1993.0034openalex-snapshot
Applying new scheduling theory to static priority pre-emptive scheduling
inferredcites →https://doi.org/10.1109/ecrts.2005.18openalex-snapshot
Improved Schedulability Analysis of EDF on Multiprocessor Platforms
inferredcites →https://doi.org/10.1109/emrts.1999.777445openalex-snapshot
The case for feedback control real-time scheduling
inferredcites →https://doi.org/10.1109/emrts.2001.934004openalex-snapshot
Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
inferredcites →https://doi.org/10.1109/icdcs.1990.89292openalex-snapshot
Asynchronous remote operation execution in distributed systems
inferredcites →https://doi.org/10.1109/isorc.2005.51openalex-snapshot
Self-Tuning Planned Actions Time to Make Real-Time SOAP Real
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.1109/real.2003.1253260openalex-snapshot
Multiprocessor EDF and deadline monotonic schedulability analysis
inferredcites →https://doi.org/10.1109/rtcsa.1998.726350openalex-snapshot
Multiprocessor scheduling of age constraint processes
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/rtcsa.2006.45openalex-snapshot
Multiprocessor Scheduling with Few Preemptions
inferredcites →https://doi.org/10.1109/rtss.2006.7openalex-snapshot
A Necessary and Sometimes Sufficient Condition for the Feasibility of Sets of Sporadic Hard-Deadline Tasks
inferredcites →https://doi.org/10.1109/tc.2004.16openalex-snapshot
Optimal utilization bounds for the fixed-priority scheduling of periodic task systems on identical multiprocessors
inferredcites →https://doi.org/10.1109/tpds.2005.88openalex-snapshot
An analysis of EDF schedulability on a multiprocessor
inferredcites →https://doi.org/10.1145/1070891.1065915openalex-snapshot
Transparent distribution of real-time components based on logical execution time
inferredcites →https://doi.org/10.1145/1086228.1086241openalex-snapshot
Deeply embedded XML communication
inferredcites →https://doi.org/10.1145/237578.237636openalex-snapshot
An interprocedural framework for placement of asynchronous I/O operations
inferredcites →https://doi.org/10.1145/268998.266689openalex-snapshot
CPU reservations and time constraints
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/360248.360251openalex-snapshot
Formal verification of parallel programs
inferredcites →https://doi.org/10.1145/41840.41852openalex-snapshot
Hierarchical correctness proofs for distributed algorithms
inferredcites →https://doi.org/10.3233/emc-2005-00017openalex-snapshot
Response time analysis of EDF distributed real-time systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.2969openalex-snapshot
Improved real‐time scheduling of periodic tasks on multiprocessors
inferred← citeshttps://doi.org/10.1007/978-3-030-25543-5_28openalex-snapshot
Integrating Formal Schedulability Analysis into a Verified OS Kernel
inferred← citeshttps://doi.org/10.1007/978-3-319-27198-9_4openalex-snapshot
Analyzing Preemptive Global Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-319-27198-9_7openalex-snapshot
Parametric Utilization Bounds
inferred← citeshttps://doi.org/10.1007/978-3-540-68855-6_21openalex-snapshot
Protocol Modeling with Model Program Composition
inferred← citeshttps://doi.org/10.1007/978-3-540-68855-6_4openalex-snapshot
An SMT Approach to Bounded Reachability Analysis of Model Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-92221-6_7openalex-snapshot
Global Static-Priority Preemptive Multiprocessor Scheduling with Utilization Bound 38%
inferred← citeshttps://doi.org/10.1007/978-3-642-25873-2_24openalex-snapshot
Partially Non-Preemptive Dual Priority Multiprocessor Scheduling
inferred← citeshttps://doi.org/10.1007/978-981-10-7605-3_223openalex-snapshot
Improved Schedulability Analysis of Fixed-Priority for Mixed-Criticality Real-Time Multiprocessor Systems
inferred← citeshttps://doi.org/10.1007/978-981-13-0224-4_49openalex-snapshot
Low-Complexity MPN Preemption Policy for Real-Time Task Scheduling
inferred← citeshttps://doi.org/10.1007/s10617-012-9090-1openalex-snapshot
The OMLP family of optimal multiprocessor real-time locking protocols
inferred← citeshttps://doi.org/10.1007/s10626-019-00285-xopenalex-snapshot
Energy-efficient thermal-aware multiprocessor scheduling for real-time tasks using TCPN
inferred← citeshttps://doi.org/10.1007/s11241-009-9073-xopenalex-snapshot
Optimal virtual cluster-based multiprocessor scheduling
inferred← citeshttps://doi.org/10.1007/s11241-009-9075-8openalex-snapshot
An analysis of global edf schedulability for arbitrary-deadline sporadic task systems
inferred← citeshttps://doi.org/10.1007/s11241-010-9096-3openalex-snapshot
Improved multiprocessor global schedulability analysis
inferred← citeshttps://doi.org/10.1007/s11241-010-9106-5openalex-snapshot
Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
inferred← citeshttps://doi.org/10.1007/s11241-012-9149-xopenalex-snapshot
FPSL, FPCL and FPZL schedulability analysis
inferred← citeshttps://doi.org/10.1007/s11241-012-9162-0openalex-snapshot
Analysis and implementation of the multiprocessor bandwidth inheritance protocol
inferred← citeshttps://doi.org/10.1007/s11241-013-9180-6openalex-snapshot
Resource sharing among real-time components under multiprocessor clustered scheduling
inferred← citeshttps://doi.org/10.1007/s11241-013-9183-3openalex-snapshot
Implementation and evaluation of global and partitioned scheduling in a real-time OS
inferred← citeshttps://doi.org/10.1007/s11241-013-9198-9openalex-snapshot
Interference-aware fixed-priority schedulability analysis on multiprocessors
inferred← citeshttps://doi.org/10.1007/s11241-014-9205-9openalex-snapshot
Multiprocessor real-time scheduling with arbitrary processor affinities: from practice to theory
inferred← citeshttps://doi.org/10.1007/s11241-015-9241-0openalex-snapshot
On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley’s optimal priority assignment algorithm
inferred← citeshttps://doi.org/10.1007/s11241-015-9245-9openalex-snapshot
A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor Global Fixed-Priority scheduling
inferred← citeshttps://doi.org/10.1007/s11241-017-9285-4openalex-snapshot
An extensible framework for multicore response time analysis
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-9315-xopenalex-snapshot
Correspondence article: a correction of the reduction-based schedulability analysis for APA scheduling
inferred← citeshttps://doi.org/10.1016/j.jpdc.2014.06.011openalex-snapshot
Using an adversary simulator to evaluate global EDF scheduling of sporadic task sets on multiprocessors
inferred← citeshttps://doi.org/10.1016/j.jss.2011.07.002openalex-snapshot
Zero-laxity based real-time multiprocessor scheduling
inferred← citeshttps://doi.org/10.1016/j.jss.2012.05.048openalex-snapshot
An experimental comparison of different real-time schedulers on multicore systems
inferred← citeshttps://doi.org/10.1016/j.jss.2012.09.002openalex-snapshot
On using adversary simulators to evaluate global fixed-priority and FPZL scheduling of multiprocessors
inferred← citeshttps://doi.org/10.1016/j.jss.2013.09.029openalex-snapshot
Demand-based schedulability analysis for real-time multi-core scheduling
inferred← citeshttps://doi.org/10.1016/j.jss.2014.11.019openalex-snapshot
Capturing urgency and parallelism using quasi-deadlines for real-time multiprocessor scheduling
inferred← citeshttps://doi.org/10.1016/j.jss.2016.02.009openalex-snapshot
GPU-SAM: Leveraging multi-GPU split-and-merge execution for system-wide real-time support
inferred← citeshttps://doi.org/10.1016/j.jss.2019.04.067openalex-snapshot
Improved schedulability analysis of the contention-free policy for real-time systems
inferred← citeshttps://doi.org/10.1016/j.procs.2013.10.022openalex-snapshot
A Proposal of Real-time Scheduling Algorithm based on RMZL and Schedulability Analysis
inferred← citeshttps://doi.org/10.1016/j.sysarc.2010.08.003openalex-snapshot
Schedulability analysis for non-preemptive fixed-priority multiprocessor scheduling
inferred← citeshttps://doi.org/10.1016/j.sysarc.2010.09.004openalex-snapshot
Tests for global EDF schedulability analysis
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.05.012openalex-snapshot
Limited carry-in technique for real-time multi-core scheduling
inferred← citeshttps://doi.org/10.1016/j.sysarc.2016.04.002openalex-snapshot
A review of priority assignment in real-time systems
inferred← citeshttps://doi.org/10.1016/j.sysarc.2016.04.003openalex-snapshot
New response time analysis for global EDF on a multiprocessor platform
inferred← citeshttps://doi.org/10.1016/j.sysarc.2018.08.004openalex-snapshot
Bounding carry-in interference for synchronous parallel tasks under global fixed-priority scheduling
inferred← citeshttps://doi.org/10.1016/j.sysarc.2018.12.006openalex-snapshot
Pessimism in multicore global schedulability analysis
inferred← citeshttps://doi.org/10.1016/j.sysarc.2021.102150openalex-snapshot
Global emergency-based job-level scheduling for weakly-hard real-time systems
inferred← citeshttps://doi.org/10.1109/access.2020.2992868openalex-snapshot
Response-Time Analysis for Multi-Mode Tasks in Real-Time Multiprocessor Systems
inferred← citeshttps://doi.org/10.1109/access.2020.3029040openalex-snapshot
Panda: Reinforcement Learning-Based Priority Assignment for Multi-Processor Real-Time Scheduling
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/aspdac.2013.6509557openalex-snapshot
On real-time STM concurrency control for embedded software with improved schedulability
inferred← citeshttps://doi.org/10.1109/dasc.2011.6096118openalex-snapshot
A tight end-to-end delay bound and scheduling optimization of an avionics AFDX network
inferred← citeshttps://doi.org/10.1109/ecrts.2008.28openalex-snapshot
Hierarchical Scheduling Framework for Virtual Clustering of Multiprocessors
inferred← citeshttps://doi.org/10.1109/ecrts.2008.38openalex-snapshot
Temporal Analysis for Adapting Concurrent Applications to Embedded Systems
inferred← citeshttps://doi.org/10.1109/ecrts.2010.19openalex-snapshot
The Multiprocessor Bandwidth Inheritance Protocol
inferred← citeshttps://doi.org/10.1109/ecrts.2011.21openalex-snapshot
Improved Schedulability Tests for Global Fixed-Priority Scheduling
inferred← citeshttps://doi.org/10.1109/ecrts.2011.32openalex-snapshot
Limited Blocking Resource Sharing for Global Multiprocessor Scheduling
inferred← citeshttps://doi.org/10.1109/ecrts.2012.29openalex-snapshot
Schedulability Analysis of Mixed-Criticality Systems on Multiprocessors
inferred← citeshttps://doi.org/10.1109/ecrts.2013.14openalex-snapshot
Global EDF Schedulability Analysis for Synchronous Parallel Tasks on Multicore Platforms
inferred← citeshttps://doi.org/10.1109/ecrts.2013.18openalex-snapshot
Outstanding Paper Award: Schedulability Analysis of the Linux Push and Pull Scheduler with Arbitrary Processor Affinities
inferred← citeshttps://doi.org/10.1109/ecrts.2013.36openalex-snapshot
Suspension-Aware Analysis for Hard Real-Time Multiprocessor Scheduling
inferred← citeshttps://doi.org/10.1109/ecrts.2013.38openalex-snapshot
A Fully Preemptive Multiprocessor Semaphore Protocol for Latency-Sensitive Real-Time Applications
inferred← citeshttps://doi.org/10.1109/ecrts.2014.26openalex-snapshot
The FMLP+: An Asymptotically Optimal Real-Time Locking Protocol for Suspension-Aware Analysis
inferred← citeshttps://doi.org/10.1109/ecrts.2015.26openalex-snapshot
Response-Time Analysis of Conditional DAG Tasks in Multiprocessor Systems
inferred← citeshttps://doi.org/10.1109/etfa.2015.7301456openalex-snapshot
Resource sharing in a hybrid partitioned/global scheduling framework for multiprocessors
inferred← citeshttps://doi.org/10.1109/etfa.2016.7733563openalex-snapshot
Zero-time communication for automotive multi-core systems under SPP scheduling
inferred← citeshttps://doi.org/10.1109/icppw.2009.12openalex-snapshot
Evaluation of Existing Schedulability Tests for Global EDF
inferred← citeshttps://doi.org/10.1109/indin.2009.5195800openalex-snapshot
On-line task scheduling for dual-core real-time embedded systems
inferred← citeshttps://doi.org/10.1109/ipdpsw.2012.305openalex-snapshot
Fixed-Priority Multiprocessor Scheduling: Critical Instant, Response Time and Utilization Bound
inferred← citeshttps://doi.org/10.1109/isorc.2013.6913241openalex-snapshot
Hierarchical real-time scheduling in the multi-core era — An overview
inferred← citeshttps://doi.org/10.1109/isorc52013.2021.00018openalex-snapshot
An Evaluation of Adaptive Partitioning of Real-Time Workloads on Linux
inferred← citeshttps://doi.org/10.1109/les.2020.2966681openalex-snapshot
Improved Schedulability Test for Non-Preemptive Fixed-Priority Scheduling on Multiprocessors
inferred← citeshttps://doi.org/10.1109/mysec.2015.7475207openalex-snapshot
A weakly hard real-time tasks on global scheduling of multiprocessor systems
inferred← citeshttps://doi.org/10.1109/rtas.2012.33openalex-snapshot
Schedulability Analysis and Priority Assignment for Global Job-Level Fixed-Priority Multiprocessor Scheduling
inferred← citeshttps://doi.org/10.1109/rtas.2019.00019openalex-snapshot
Bundled Scheduling of Parallel Real-Time Tasks
inferred← citeshttps://doi.org/10.1109/rtas52030.2021.00018openalex-snapshot
ML for RT: Priority Assignment Using Machine Learning
inferred← citeshttps://doi.org/10.1109/rtcsa.2011.32openalex-snapshot
Global Semi-fixed-priority Scheduling on Multiprocessors
inferred← citeshttps://doi.org/10.1109/rtcsa.2011.34openalex-snapshot
Resource Hold Times under Multiprocessor Static-Priority Global Scheduling
inferred← citeshttps://doi.org/10.1109/rtcsa.2011.39openalex-snapshot
Schedulability Analysis of Malleable Tasks with Arbitrary Parallel Structure
inferred← citeshttps://doi.org/10.1109/rtcsa.2013.6732198openalex-snapshot
Global fixed priority scheduling with deferred pre-emption
inferred← citeshttps://doi.org/10.1109/rtcsa.2014.6910543openalex-snapshot
Improving the response time analysis of global fixed-priority multiprocessor scheduling
inferred← citeshttps://doi.org/10.1109/rtcsa.2015.26openalex-snapshot
Hard Real-Time Multiprocessor Scheduling Resilient to Core Failures
inferred← citeshttps://doi.org/10.1109/rtcsa.2015.9openalex-snapshot
Bounding Carry-in Interference to Improve Fixed-Priority Global Multiprocessor Scheduling Analysis
inferred← citeshttps://doi.org/10.1109/rtss.2008.17openalex-snapshot
New Schedulability Test Conditions for Non-preemptive Scheduling on Multiprocessor Platforms
inferred← citeshttps://doi.org/10.1109/rtss.2009.11openalex-snapshot
New Response Time Bounds for Fixed Priority Multiprocessor Scheduling
inferred← citeshttps://doi.org/10.1109/rtss.2009.31openalex-snapshot
Priority Assignment for Global Fixed Priority Pre-Emptive Scheduling in Multiprocessor Real-Time Systems
inferred← citeshttps://doi.org/10.1109/rtss.2009.37openalex-snapshot
Resource Sharing in Global Fixed-Priority Preemptive Multiprocessor Scheduling
inferred← citeshttps://doi.org/10.1109/rtss.2010.13openalex-snapshot
LLF Schedulability Analysis on Multiprocessor Platforms
inferred← citeshttps://doi.org/10.1109/rtss.2010.17openalex-snapshot
Optimality Results for Multiprocessor Real-Time Locking
inferred← citeshttps://doi.org/10.1109/rtss.2011.29openalex-snapshot
Response Time Analysis of Hierarchical Scheduling: The Synchronized Deferrable Servers Approach
inferred← citeshttps://doi.org/10.1109/rtss.2012.56openalex-snapshot
Controlling Preemption for Better Schedulability in Multi-Core Systems
inferred← citeshttps://doi.org/10.1109/rtss.2012.58openalex-snapshot
Extending Task-level to Job-level Fixed Priority Assignment and Schedulability Analysis Using Pseudo-deadlines
inferred← citeshttps://doi.org/10.1109/rtss.2013.26openalex-snapshot
Limited Pre-emptive Global Fixed Task Priority
inferred← citeshttps://doi.org/10.1109/rtss.2014.18openalex-snapshot
Time-Reversibility of Schedulability Tests
inferred← citeshttps://doi.org/10.1109/rtss.2014.29openalex-snapshot
Linux's Processor Affinity API, Refined: Shifting Real-Time Tasks Towards Higher Schedulability
inferred← citeshttps://doi.org/10.1109/rtss.2015.20openalex-snapshot
Response Time Analysis with Limited Carry-In for Global Earliest Deadline First Scheduling
inferred← citeshttps://doi.org/10.1109/rtss.2015.8openalex-snapshot
Global Real-Time Semaphore Protocols: A Survey, Unified Analysis, and Comparison
inferred← citeshttps://doi.org/10.1109/rtss.2015.9openalex-snapshot
A Quadratic-Time Response Time Upper Bound with a Tightness Property
inferred← citeshttps://doi.org/10.1109/rtss.2016.018openalex-snapshot
Offline Guarantee and Online Management of Power Demand and Supply in Cyber-Physical Systems
inferred← citeshttps://doi.org/10.1109/rtss.2016.020openalex-snapshot
Resource-Oriented Partitioned Scheduling in Multiprocessor Systems: How to Partition and How to Share?
inferred← citeshttps://doi.org/10.1109/rtss.2017.00038openalex-snapshot
Beyond Implicit-Deadline Optimality: A Multiprocessor Scheduling Framework for Constrained-Deadline Tasks
inferred← citeshttps://doi.org/10.1109/rtss46320.2019.00027openalex-snapshot
Conditionally Optimal Task Parallelization for Global EDF on Multi-core Systems
inferred← citeshttps://doi.org/10.1109/rtss49844.2020.00020openalex-snapshot
Non-Preemptive Real-Time Multiprocessor Scheduling Beyond Work-Conserving
inferred← citeshttps://doi.org/10.1109/sies.2015.7185061openalex-snapshot
Resource sharing under global scheduling with partial processor bandwidth
inferred← citeshttps://doi.org/10.1109/tc.2014.2308183openalex-snapshot
Composition of Schedulability Analyses for Real-Time Multiprocessor Systems
inferred← citeshttps://doi.org/10.1109/tc.2015.2500572openalex-snapshot
Global Real-Time Memory-Centric Scheduling for Multicore Systems
inferred← citeshttps://doi.org/10.1109/tc.2016.2584064openalex-snapshot
Schedulability Analysis of Conditional Parallel Task Graphs in Multicore Systems
inferred← citeshttps://doi.org/10.1109/tc.2017.2704083openalex-snapshot
Improved Schedulability Analysis Using Carry-In Limitation for Non-Preemptive Fixed-Priority Multiprocessor Scheduling
inferred← citeshttps://doi.org/10.1109/tc.2020.3029328openalex-snapshot
Precise Worst-Case Blocking Time of Tasks Under Priority Inheritance Protocol
inferred← citeshttps://doi.org/10.1109/tcad.2018.2812119openalex-snapshot
WCRT Analysis and Evaluation for Sporadic Message-Processing Tasks in Multicore Automotive Gateways
inferred← citeshttps://doi.org/10.1109/tcad.2020.2994265openalex-snapshot
Limited Busy Periods in Response Time Analysis for Tasks Under Global EDF Scheduling
inferred← citeshttps://doi.org/10.1109/tcad.2020.3013095openalex-snapshot
Suspension-Aware Earliest-Deadline-First Scheduling Analysis
inferred← citeshttps://doi.org/10.1109/tii.2009.2032068openalex-snapshot
Response Time Analysis on Multicore ECUs With Shared Resources
inferred← citeshttps://doi.org/10.1109/tpds.2013.2297098openalex-snapshot
Improvement of Real-Time Multi-CoreSchedulability with Forced Non-Preemption
inferred← citeshttps://doi.org/10.1109/tpds.2016.2528978openalex-snapshot
Global Fixed Priority Scheduling with Preemption Threshold: Schedulability Analysis and Stack Size Minimization
inferred← citeshttps://doi.org/10.1109/tpds.2016.2533615openalex-snapshot
Time-Reversibility for Real-Time Scheduling on Multiprocessor Systems
inferred← citeshttps://doi.org/10.1109/tpds.2016.2614669openalex-snapshot
Global EDF Schedulability Analysis for Parallel Tasks on Multi-Core Platforms
inferred← citeshttps://doi.org/10.1109/tpds.2018.2843763openalex-snapshot
Execution-Efficient Response Time Analysis on Global Multiprocessor Platforms
inferred← citeshttps://doi.org/10.1109/tpds.2020.2977041openalex-snapshot
Power Guarantee for Electric Systems Using Real-Time Scheduling
inferred← citeshttps://doi.org/10.1109/trustcom.2011.158openalex-snapshot
FTGS: Fault-Tolerant Fixed-Priority Scheduling on Multiprocessors
inferred← citeshttps://doi.org/10.1109/trustcom/bigdatase/icess.2017.317openalex-snapshot
Integrating Cache-Related Preemption Delay into GEDF Analysis for Multiprocessor Scheduling with On-chip Cache
inferred← citeshttps://doi.org/10.1142/s0218126618501657openalex-snapshot
Global Fixed Priority Scheduling with Constructing Execution Dependency in Multiprocessor Real-Time Systems
inferred← citeshttps://doi.org/10.1145/1880050.1880058openalex-snapshot
Real-time performance analysis of multiprocessor systems with shared memory
inferred← citeshttps://doi.org/10.1145/1978802.1978814openalex-snapshot
A survey of hard real-time scheduling for multiprocessor systems
inferred← citeshttps://doi.org/10.1145/2245276.2232033openalex-snapshot
STM concurrency control for multicore embedded real-time software
inferred← citeshttps://doi.org/10.1145/2494530openalex-snapshot
Contention-free executions for real-time multiprocessor scheduling
inferred← citeshttps://doi.org/10.1145/2516821.2516848openalex-snapshot
Feasibility intervals for homogeneous multicores, asynchronous periodic tasks, and FJP schedulers
inferred← citeshttps://doi.org/10.1145/2560033openalex-snapshot
Building timing predictable embedded systems
inferred← citeshttps://doi.org/10.1145/2659787.2659811openalex-snapshot
Optimizing Preemption-Overhead Accounting in Multiprocessor Real-Time Systems
inferred← citeshttps://doi.org/10.1145/2659787.2659814openalex-snapshot
A Weak Simulation Relation for Real-Time Schedulability Analysis of Global Fixed Priority Scheduling Using Linear Hybrid Automata
inferred← citeshttps://doi.org/10.1145/2659787.2659815openalex-snapshot
Response-Time Analysis of Synchronous Parallel Tasks in Multiprocessor Systems
inferred← citeshttps://doi.org/10.1145/2739954openalex-snapshot
Global and Partitioned Multiprocessor Fixed Priority Scheduling with Deferred Preemption
inferred← citeshttps://doi.org/10.1145/2834848.2834849openalex-snapshot
Response time bounds for sporadic arbitrary-deadline tasks under global fixed-priority scheduling on multiprocessors
inferred← citeshttps://doi.org/10.1145/2834848.2834862openalex-snapshot
A generic and compositional framework for multicore response time analysis
inferred← citeshttps://doi.org/10.1145/3167132.3167195openalex-snapshot
Assessing the pessimism of current multicore global fixed-priority schedulability analysis
inferred← citeshttps://doi.org/10.1145/3341105.3373937openalex-snapshot
Adaptive partitioning of real-time tasks on multiple processors
inferred← citeshttps://doi.org/10.1145/3412816.3412817openalex-snapshot
EDF scheduling of real-time tasks on multiple cores
inferred← citeshttps://doi.org/10.1145/3465474openalex-snapshot
An Efficient Execution Framework of Two-Part Execution Scenario Analysis
inferred← citeshttps://doi.org/10.1145/3477035openalex-snapshot
Excluding Parallel Execution to Improve Global Fixed Priority Response Time Analysis
inferred← citeshttps://doi.org/10.1145/3728364openalex-snapshot
RESCUE: A Reconfigurable Scheduling Framework for Securing Multi-Core Real-Time Systems
inferred← citeshttps://doi.org/10.12915/pe.2014.09.36openalex-snapshot
Efficient data generation for the testing of real-time multiprocessor scheduling algorithms.
inferred← citeshttps://doi.org/10.1504/ijes.2014.063825openalex-snapshot
Fixed-priority global scheduling for mixed-criticality real-time systems
inferred← citeshttps://doi.org/10.1587/transinf.2017edl8260openalex-snapshot
Proof and Evaluation of Improved Slack Reclamation for Response Time Analysis of Real-Time Multiprocessor Systems
inferred← citeshttps://doi.org/10.23919/date48585.2020.9116364openalex-snapshot
Period Adaptation for Continuous Security Monitoring in Multicore Real-Time Systems
inferred← citeshttps://doi.org/10.3390/sym11050651openalex-snapshot
Task-Level Re-Execution Framework for Improving Fault Tolerance on Symmetry Multiprocessors
inferred← citeshttps://doi.org/10.3390/sym11080960openalex-snapshot
An N-Modular Redundancy Framework Incorporating Response-Time Analysis on Multiprocessor Platforms
inferred← citeshttps://doi.org/10.3390/sym12010172openalex-snapshot
Limited Non-Preemptive EDF Scheduling for a Real-Time System with Symmetry Multiprocessors
inferred← citeshttps://doi.org/10.3390/sym12050753openalex-snapshot
Scheduling Randomization Protocol to Improve Schedule Entropy for Multiprocessor Real-Time Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1405.7322openalex-snapshot
Supporting Soft Real-Time Sporadic Task Systems on Heterogeneous Multiprocessors with No Utilization Loss
inferred← citeshttps://doi.org/10.48550/arxiv.1406.1133openalex-snapshot
Timing Analysis for DAG-based and GFP Scheduled Tasks
inferred← citeshttps://doi.org/10.48550/arxiv.1905.05119openalex-snapshot
Analysis of Global Fixed-Priority Scheduling for Generalized Sporadic DAG Tasks
inferred← citeshttps://doi.org/10.48550/arxiv.2012.03002openalex-snapshot
Fixed Priority Global Scheduling from a Deep Learning Perspective
inferred← citeshttps://doi.org/10.5121/csit.2021.110810openalex-snapshot
Hierarchical Scheduling for Real-Time Periodic Tasks in Symmetric Multiprocessing
inferred← citeshttps://doi.org/10.5555/1874620.1874748openalex-snapshot
Response-time analysis of arbitrarily activated tasks in multiprocessor systems with shared resources
inferred← citeshttps://doi.org/10.7936/k7vh5m0hopenalex-snapshot
Real-Time and Energy-Efficient Routing for Industrial Wireless Sensor-Actuator Networks
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.