On the public citation graph

Delay Composition Algebra: A Reduction-Based Schedulability Algebra for Distributed Real-Time Systems

https://doi.org/10.1109/rtss.2008.38
0 signed · 35 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/s11241-008-9056-3openalex-snapshot
Delay composition in preemptive and non-preemptive real-time pipelines
inferredcites →https://doi.org/10.1016/0165-6074(94)90080-9openalex-snapshot
Holistic schedulability analysis for distributed hard real-time systems
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.1080/00207540410001705211openalex-snapshot
Evaluation and improvement of response time bounds for real-time applications under non-pre-emptive Fixed Priority Scheduling
inferredcites →https://doi.org/10.1109/18.61109openalex-snapshot
A calculus for network delay. I. Network elements in isolation
inferredcites →https://doi.org/10.1109/18.61110openalex-snapshot
A calculus for network delay. II. Network analysis
inferredcites →https://doi.org/10.1109/32.210308openalex-snapshot
On satisfying timing constraints in hard-real-time systems
inferredcites →https://doi.org/10.1109/ecrts.2007.80openalex-snapshot
A Delay Composition Theorem for Real-Time Pipelines
inferredcites →https://doi.org/10.1109/ecrts.2008.31openalex-snapshot
Transforming Distributed Acyclic Systems into Equivalent Uniprocessors under Preemptive and Non-Preemptive Scheduling
inferredcites →https://doi.org/10.1109/emrts.2003.1212721openalex-snapshot
Offset-based response time analysis of distributed systems scheduled under EDF
inferredcites →https://doi.org/10.1109/emwrts.1997.613773openalex-snapshot
Static scheduling of pipelined periodic tasks in distributed real-time systems
inferredcites →https://doi.org/10.1109/real.1998.739728openalex-snapshot
Schedulability analysis for tasks with static and dynamic offsets
inferredcites →https://doi.org/10.1109/rtas.2005.28openalex-snapshot
Improved Schedulability Analysis of Real-Time Transactions with Earliest Deadline Scheduling
inferredcites →https://doi.org/10.1109/rtss.2005.42openalex-snapshot
Towards Feasible Region Calculus: An End-to-End Schedulability Analysis of Real-Time Multistage Execution
inferredcites →https://doi.org/10.1109/spdp.1990.143508openalex-snapshot
Algorithms for end-to-end scheduling to meet deadlines

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-642-14849-1_1openalex-snapshot
Composition and Scaling Challenges in Sensor Networks: An Interaction-Centric View
inferred← citeshttps://doi.org/10.1007/s11241-010-9098-1openalex-snapshot
Reduction-based schedulability analysis of distributed systems with cycles in the task graph
inferred← citeshttps://doi.org/10.1007/s12243-017-0597-0openalex-snapshot
AutoSAC: automatic scaling and admission control of forwarding graphs
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.1109/ecrts.2009.15openalex-snapshot
End-to-End Delay Analysis of Distributed Systems with Cycles in the Task Graph
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/etfa.2010.5641357openalex-snapshot
The Distributed Deadline Synchronization Protocol for real-time systems scheduled by EDF
inferred← citeshttps://doi.org/10.1109/icc.2017.7996596openalex-snapshot
Dynamic control of NFV forwarding graphs with end-to-end deadline constraints
inferred← citeshttps://doi.org/10.1109/icdcs.2014.18openalex-snapshot
WOHA: Deadline-Aware Map-Reduce Workflow Scheduling Framework over Hadoop Clusters
inferred← citeshttps://doi.org/10.1109/rtas58335.2023.00010openalex-snapshot
Minimizing Probabilistic End-to-end Latencies of Autonomous Driving Systems
inferred← citeshttps://doi.org/10.1109/rtss.2010.39openalex-snapshot
End-to-End Delay Bound for Prioritized Data Flows in Disruption-Tolerant Networks
inferred← citeshttps://doi.org/10.1109/rtss.2012.86openalex-snapshot
An ILP-based Worst-case Performance Analysis Technique for Distributed Real-time Embedded Systems
inferred← citeshttps://doi.org/10.1109/tc.2013.209openalex-snapshot
The Quadratic Utilization Upper Bound for Arbitrary Deadline Real-Time Tasks
inferred← citeshttps://doi.org/10.1109/tc.2022.3152105openalex-snapshot
Probabilistically Guaranteeing End-to-end Latencies in Autonomous Vehicle Computing Systems
inferred← citeshttps://doi.org/10.1109/tii.2011.2123902openalex-snapshot
Partitioning Real-Time Applications Over Multicore Reservations
inferred← citeshttps://doi.org/10.1145/1879021.1879034openalex-snapshot
Online robust optimization framework for QoS guarantees in distributed soft real-time systems
inferred← citeshttps://doi.org/10.1145/2851613.2851676openalex-snapshot
Probabilistic analysis of bufferless pipelines of real-time tasks
inferred← citeshttps://doi.org/10.3390/math8091579openalex-snapshot
Cooperative and Non-Cooperative Frameworks with Utility Function Design for Intermediate Deadline Assignment in Real-Time Distributed Systems
inferred← citeshttps://doi.org/10.5120/ijais2015451474openalex-snapshot
The Revelation of Cyber-Physical Internet (CPI)
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.