On the public citation graph

A Multiprocessor Server-Based Scheduler for Soft Real-Time Tasks with Stochastic Execution Demand

https://doi.org/10.1109/rtcsa.2011.30

0 signed · 43 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/978-1-4471-3267-7openalex-snapshot

Markov Chains and Stochastic Stability

inferredcites →https://doi.org/10.1007/s11241-008-9051-8openalex-snapshot

M-CASH: A real-time resource reclaiming algorithm for multiprocessor platforms

inferredcites →https://doi.org/10.1007/s11241-009-9076-7openalex-snapshot

A hierarchical multiprocessor bandwidth reservation scheme with timing guarantees

inferredcites →https://doi.org/10.1017/cbo9780511626630openalex-snapshot

Markov Chains and Stochastic Stability

inferredcites →https://doi.org/10.1017/s0305004100027638openalex-snapshot

The theory of queues with a single server

inferredcites →https://doi.org/10.1109/ecrts.2010.25openalex-snapshot

Improved Tardiness Bounds for Global EDF

inferredcites →https://doi.org/10.1109/emrts.1999.777471openalex-snapshot

QoS guarantee using probabilistic deadlines

inferredcites →https://doi.org/10.1109/real.1996.563696openalex-snapshot

A multiframe model for real-time tasks

inferredcites →https://doi.org/10.1109/real.2003.1253287openalex-snapshot

Dynamic integrated scheduling of hard real-time, soft real-time, and non-real-time processes

inferredcites →https://doi.org/10.1109/rtas.2010.33openalex-snapshot

A Stochastic Framework for Multiprocessor Soft Real-Time Scheduling

inferredcites →https://doi.org/10.1109/rtss.2005.39openalex-snapshot

Tardiness Bounds under Global EDF Scheduling on a Multiprocessor

inferredcites →https://doi.org/10.1109/rtss.2007.26openalex-snapshot

Utilization-Bound Based Schedulability Analysis of Weighted Round Robin Schedulers

inferredcites →https://doi.org/10.1109/rtss.2007.33openalex-snapshot

Generalized Tardiness Bounds for Global Multiprocessor Scheduling

inferredcites →https://doi.org/10.1109/rtss.2009.10openalex-snapshot

Task Scheduling with Self-Suspensions in Soft Real-Time Multiprocessor Systems

inferredcites →https://doi.org/10.1109/rtss.2011.16openalex-snapshot

Soft Real-Time on Multiprocessors: Are Analysis-Based Schedulers Really Worth It?

inferredcites →https://doi.org/10.1109/rttas.2002.1137390openalex-snapshot

Implementing constant-bandwidth servers upon multiprocessor platforms

inferredcites →https://doi.org/10.1198/000313002191openalex-snapshot

A First Course in Probability

inferredcites →https://doi.org/10.2307/2288753openalex-snapshot

A First Course in Probability.

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-981-287-251-7_4openalex-snapshot

Soft Real-Time Scheduling

inferred← citeshttps://doi.org/10.1007/978-981-4585-87-3_4-1openalex-snapshot

Soft Real-Time Scheduling

inferred← citeshttps://doi.org/10.1007/s11241-017-9272-9openalex-snapshot

Attacking the one-out-of-m multicore problem by combining hardware management with mixed-criticality provisioning

inferred← citeshttps://doi.org/10.1007/s11241-024-09431-7openalex-snapshot

Efficiently bounding deadline miss probabilities of Markov chain real-time tasks

inferred← citeshttps://doi.org/10.1007/s11241-024-09432-6openalex-snapshot

Characterizing global work-conserving scheduling tardiness with uniform instances on multiprocessors

inferred← citeshttps://doi.org/10.1007/s11265-015-0983-7openalex-snapshot

Optimal Semi-Partitioned Scheduling in Soft Real-Time Systems

inferred← citeshttps://doi.org/10.1016/j.ejor.2015.05.004openalex-snapshot

Bi-Objective Multi-Mode Project Scheduling Under Risk Aversion

inferred← citeshttps://doi.org/10.1016/j.sysarc.2021.101999openalex-snapshot

Crown-scheduling of sets of parallelizable tasks for robustness and energy-elasticity on many-core systems with discrete dynamic voltage and frequency scaling

inferred← citeshttps://doi.org/10.1109/estimedia.2014.6962343openalex-snapshot

Optimal GEDF-based schedulers that allow intra-task parallelism on heterogeneous multiprocessors

inferred← citeshttps://doi.org/10.1109/pdp50117.2020.00027openalex-snapshot

Robustness and Energy-elasticity of Crown Schedules for Sets of Parallelizable Tasks on Many-core Systems with DVFS

inferred← citeshttps://doi.org/10.1109/rtas.2012.29openalex-snapshot

Soft Real-Time Scheduling in Google Earth

inferred← citeshttps://doi.org/10.1109/rtas.2016.7461323openalex-snapshot

Attacking the One-Out-Of-m Multicore Problem by Combining Hardware Management with Mixed-Criticality Provisioning

inferred← citeshttps://doi.org/10.1109/rtas52030.2021.00025openalex-snapshot

Effectively Scheduling Hard and Soft Real-Time Tasks on Multiprocessors

inferred← citeshttps://doi.org/10.1109/rtas58335.2023.00009openalex-snapshot

Continuous-Emission Markov Models for Real-Time Applications: Bounding Deadline Miss Probabilities

inferred← citeshttps://doi.org/10.1109/rtcsa.2014.6910532openalex-snapshot

Optimal semi-partitioned scheduling in soft real-time systems

inferred← citeshttps://doi.org/10.1109/rtss.2011.16openalex-snapshot

Soft Real-Time on Multiprocessors: Are Analysis-Based Schedulers Really Worth It?

inferred← citeshttps://doi.org/10.1109/rtss.2014.38openalex-snapshot

Independence Thresholds: Balancing Tractability and Practicality in Soft Real-Time Stochastic Analysis

inferred← citeshttps://doi.org/10.1109/rtss.2015.36openalex-snapshot

Cache Sharing and Isolation Tradeoffs in Multicore Mixed-Criticality Systems

inferred← citeshttps://doi.org/10.1109/rtss59052.2023.00035openalex-snapshot

CTA: A Correlation-Tolerant Analysis of the Deadline-Failure Probability of Dependent Tasks

inferred← citeshttps://doi.org/10.1109/rtss62706.2024.00027openalex-snapshot

A Distribution-Agnostic and Correlation-Aware Analysis of Periodic Tasks

inferred← citeshttps://doi.org/10.1109/rtss62706.2024.00030openalex-snapshot

Towards Principled Budget Enforcement in Real-Time Systems

inferred← citeshttps://doi.org/10.1109/tpds.2015.2416732openalex-snapshot

An Analytical Solution for Probabilistic Guarantees of Reservation Based Soft Real-Time Systems

inferred← citeshttps://doi.org/10.1145/2659787.2659808openalex-snapshot

Soft Real-Time Semi-Partitioned Scheduling with Restricted Migrations on Uniform Heterogeneous Multiprocessors

inferred← citeshttps://doi.org/10.1145/3373400.3373402openalex-snapshot

PrVM

inferred← citeshttps://doi.org/10.4230/lites-v006-i001-a004openalex-snapshot

A Survey of Probabilistic Schedulability Analysis Techniques for Real-Time Systems

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.