On the public citation graph

Determining Maximum Stack Usage in Preemptive Shared Stack Systems

https://doi.org/10.1109/rtss.2006.18
0 signed · 37 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.1057/jors.1991.155openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1109/32.950317openalex-snapshot
Bounding cache-related preemption delay for real-time systems
inferredcites →https://doi.org/10.1109/date.2005.326openalex-snapshot
Verifying Safety-Critical Timing and Memory-Usage Properties of Embedded Software by Abstract Interpretation
inferredcites →https://doi.org/10.1109/ecrts.2004.30openalex-snapshot
Reducing the number of preemptions in fixed priority scheduling
inferredcites →https://doi.org/10.1109/ecrts.2005.15openalex-snapshot
Fast and Tight Response-Times for Tasks with Offsets
inferredcites →https://doi.org/10.1109/ecrts.2005.26openalex-snapshot
Scheduling Analysis of Real-Time Systems with Precise Modeling of Cache Related Preemption Delay
inferredcites →https://doi.org/10.1109/ecrts.2005.5openalex-snapshot
A Space-Optimal Wait-Free Real-Time Synchronization Protocol
inferredcites →https://doi.org/10.1109/emrts.2004.1311016openalex-snapshot
Reducing the number of preemptions in fixed priority scheduling
inferredcites →https://doi.org/10.1109/icse.2001.919080openalex-snapshot
Static checking of interrupt-driven software
inferredcites →https://doi.org/10.1109/real.1990.128747openalex-snapshot
A stack-based resource allocation policy for realtime processes
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/real.2000.895993openalex-snapshot
Scalable real-time system design using preemption thresholds
inferredcites →https://doi.org/10.1109/real.2001.990598openalex-snapshot
Minimizing memory utilization of real-time task sets in single and multi-processor systems-on-a-chip
inferredcites →https://doi.org/10.1109/real.2002.1181585openalex-snapshot
Scheduling tasks with mixed preemption relations for robustness to timing faults
inferredcites →https://doi.org/10.1109/rtas.2006.14openalex-snapshot
Bounding Preemption Delay within Data Cache Reference Patterns for Real-Time Tasks
inferredcites →https://doi.org/10.1109/rtcsa.1998.726412openalex-snapshot
Handling interrupts with static scheduling in an automotive vehicle control system
inferredcites →https://doi.org/10.1137/1.9780898719802openalex-snapshot
Topics in Intersection Graph Theory
inferredcites →https://doi.org/10.1145/1086297.1086323openalex-snapshot
MTSS
inferredcites →https://doi.org/10.1145/253145.253159openalex-snapshot
Real-time computing with lock-free shared objects
inferredcites →https://doi.org/10.1145/800116.803775openalex-snapshot
Algorithmic aspects of vertex elimination
inferredcites →https://doi.org/10.5555/381473.381478openalex-snapshot
Static checking of interrupt-driven software

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1016/j.sysarc.2017.03.007openalex-snapshot
Schedulability analysis and stack size minimization with preemption thresholds and mixed-criticality scheduling
inferred← citeshttps://doi.org/10.1109/ecrts.2008.29openalex-snapshot
Bounding Shared-Stack Usage in Systems with Offsets and Precedences
inferred← citeshttps://doi.org/10.1109/etfa.2008.4638488openalex-snapshot
Framework for real-time analysis in Rubus-ICE
inferred← citeshttps://doi.org/10.1109/etfa.2012.6489571openalex-snapshot
Optimizing stack memory requirements for real-time embedded applications
inferred← citeshttps://doi.org/10.1109/rtcsa.2018.00020openalex-snapshot
EMPRESS: an Efficient and Effective Method for PREdictable Stack Sharing
inferred← citeshttps://doi.org/10.1109/rtcsa.2019.8864554openalex-snapshot
Stack memory requirements of AUTOSAR/OSEK-compliant scheduling policies
inferred← citeshttps://doi.org/10.1109/rtss.2018.00049openalex-snapshot
Semi-Extended Tasks: Efficient Stack Sharing Among Blocking Threads
inferred← citeshttps://doi.org/10.1109/sies.2008.4577697openalex-snapshot
The Rubus component model for resource constrained real-time systems
inferred← citeshttps://doi.org/10.1109/sies.2012.6356578openalex-snapshot
Efficient implementation of AUTOSAR components with minimal memory usage
inferred← citeshttps://doi.org/10.1109/sies.2016.7509417openalex-snapshot
Minimizing stack usage for AUTOSAR/OSEK's restricted fixed-priority preemption threshold support
inferred← citeshttps://doi.org/10.1109/surv.2010.032610.00045openalex-snapshot
Providing OS Support for Wireless Sensor Networks: Challenges and Approaches
inferred← citeshttps://doi.org/10.1109/tc.2010.58openalex-snapshot
Conditional Partial Order Graphs: Model, Synthesis, and Application
inferred← citeshttps://doi.org/10.1109/tc.2011.58openalex-snapshot
SenSpire OS: A Predictable, Flexible, and Efficient Operating System for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tii.2009.2033267openalex-snapshot
A Synchronization Protocol for Temporal Isolation of Software Components in Vehicular Systems
inferred← citeshttps://doi.org/10.1145/1879021.1879036openalex-snapshot
Reducing stack with intra-task threshold priorities in real-time systems
inferred← citeshttps://doi.org/10.1145/2632160openalex-snapshot
Minimizing Stack and Communication Memory Usage in Real-Time Embedded Applications
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.