Lune

RTSS2021Top-tier venue

Virtually-Federated Scheduling of Parallel Real-Time Tasks

Xu Jiang, Nan Guan, Haochun Liang, Yue Tang, Lei Qiao, Wang Yi

Abstract

Federated scheduling is a promising approach to schedule parallel real-time tasks, where each task exclusively executes on a set of dedicated processors. However, federated scheduling suffers significant resource wasting since a task typically only uses part of the processing capacity allocated to it, while the unused part cannot be shared with other tasks. To solve this problem, we present a virtually-federated scheduling approach, which both enjoys the good analyzability of federated scheduling and allows tasks to efficiently share processors with others. The main idea is to construct virtual processors on physical processors, and let a task exclusively execute on a set of virtual processors. As a physical processor is shared by virtual processors, tasks effectively share processors with each other. On the other hand, as each task exclusively executes on its own virtual processor set, the good analyzability of federated scheduling can be carried into to our virtually-federated scheduling approach. We conduct comprehensive performance evaluation to compare our proposed approach with existing methods of different types. Experiment results show that our approach consistently outperforms existing methods to a considerable extent under a wide range of parameter settings.

Ask Lune

Know where this paper stands in minutes, not an afternoon.

Lune can read the top-tier papers that cite it and the ones closest to it, and tells you what it claims, what came after and where it falls short, each point cited to the paper it comes from. No skimming, no AI slop.

4 top-tier papers have cited it since. Know what they found before your reviewers do.

Questions to start from

Lune can draw on

its abstract · the top-tier papers that cite it · related work

Get the answer

Free to start. No credit card required.

Lineage

  • Holistically Budgeting Processing Graphs cites Bounding the Response Time of DAG Tasks Using Long Paths
Builds onCited byLeft to right by year; the more cited, the higher.

Cited by top-tier papers4

  1. Bounding the Response Time of DAG Tasks Using Long PathsQingqiang He, Nan Guan, Mingsong Lv, Xu Jiang et al.RTSS 2022 · 19 citations
  2. Holistically Budgeting Processing GraphsZelin Tong, Shareef Ahmed, James H. AndersonRTSS 2023 · 6 citations
  3. Mixed-Criticality Federated Scheduling for Relaxed-Deadline DAG TasksFei Guan, Jinkyu Lee, Chun Jason Xue, Jen-Ming Wu et al.RTSS 2024 · 6 citations
  4. Co-Located Parallel Scheduling of Threads to Optimize Cache SharingCorey Tessler, Venkata Prashant Modekurthy, Nathan Fisher, Abusayeed Saifullah et al.RTSS 2023 · 5 citations

Related papers

  1. DPCP-p: A Distributed Locking Protocol for Parallel Real-Time TasksMaolin Yang, Ze-Wei Chen, Xu Jiang, Nan Guan et al.DAC 2020 · 11 citations
  2. Recursive Partitioned Scheduling for Real-Time Gang TasksSeongtae Lee, Nan Guan, Jinkyu LeeRTSS 2025 · 1 citation
  3. Heterogeneous Quasi-Partitioned SchedulingErnesto Massa, George Lima, Björn Andersson, Vinicius PetrucciRTSS 2021 · 4 citations
  4. Subtask-Level Elastic SchedulingMarion Sudvarg, Daisy Wang, Jeremy Buhler, Chris GillRTSS 2024 · 1 citation
  5. OS scheduling with nest: keeping tasks close together on warm coresJulia Lawall, Himadri Chhaya-Shailesh, Jean-Pierre Lozi, Baptiste Lepers et al.EuroSys 2022 · 9 citations
Dusk over the sea between two cliffs drawn in fine vertical lines