JakeHillion/scx-upstream
1
0
Fork 0
mirror of https://github.com/sched-ext/scx.git synced 2024-12-03 15:57:12 +00:00
Code Issues Packages Projects Releases Wiki Activity
9807e561f0
scx-upstream/scheds/rust/scx_lavd/Cargo.toml

36 lines
1.2 KiB
TOML
Raw Normal View History

scx_lavd: add scx_lavd (Latency-criticality Aware Virtual Deadline) scheduler scx_lavd is a BPF scheduler that implements an LAVD (Latency-criticality Aware Virtual Deadline) scheduling algorithm. While LAVD is new and still evolving, its core ideas are 1) measuring how much a task is latency critical and 2) leveraging the task's latency-criticality information in making various scheduling decisions (e.g., task's deadline, time slice, etc.). As the name implies, LAVD is based on the foundation of deadline scheduling. This scheduler consists of the BPF part and the rust part. The BPF part makes all the scheduling decisions; the rust part loads the BPF code and conducts other chores (e.g., printing sampled scheduling decisions).
2024-03-16 01:31:07 +00:00
[package]
name = "scx_lavd"
Version: v1.0.3
2024-08-21 17:42:11 +01:00
version = "1.0.3"
scx_lavd: add scx_lavd (Latency-criticality Aware Virtual Deadline) scheduler scx_lavd is a BPF scheduler that implements an LAVD (Latency-criticality Aware Virtual Deadline) scheduling algorithm. While LAVD is new and still evolving, its core ideas are 1) measuring how much a task is latency critical and 2) leveraging the task's latency-criticality information in making various scheduling decisions (e.g., task's deadline, time slice, etc.). As the name implies, LAVD is based on the foundation of deadline scheduling. This scheduler consists of the BPF part and the rust part. The BPF part makes all the scheduling decisions; the rust part loads the BPF code and conducts other chores (e.g., printing sampled scheduling decisions).
2024-03-16 01:31:07 +00:00
authors = ["Changwoo Min <changwoo@igalia.com>", "Igalia"]
edition = "2021"
description = "A Latency-criticality Aware Virtual Deadline (LAVD) scheduler based on sched_ext, which is a Linux kernel feature which enables implementing kernel thread schedulers in BPF and dynamically loading them. https://github.com/sched-ext/scx/tree/main"
license = "GPL-2.0-only"
[dependencies]
anyhow = "1.0.65"
bitvec = { version = "1.0", features = ["serde"] }
clap = { version = "4.1", features = ["derive", "env", "unicode", "wrap_help"] }
scx_lavd: Relay introspection output in stats::TaskSample This indirection doesn't make any visible behavior difference now but will be used to implement scx_stats support.
2024-08-24 05:17:34 +01:00
crossbeam = "0.8.4"
scx_lavd: add scx_lavd (Latency-criticality Aware Virtual Deadline) scheduler scx_lavd is a BPF scheduler that implements an LAVD (Latency-criticality Aware Virtual Deadline) scheduling algorithm. While LAVD is new and still evolving, its core ideas are 1) measuring how much a task is latency critical and 2) leveraging the task's latency-criticality information in making various scheduling decisions (e.g., task's deadline, time slice, etc.). As the name implies, LAVD is based on the foundation of deadline scheduling. This scheduler consists of the BPF part and the rust part. The BPF part makes all the scheduling decisions; the rust part loads the BPF code and conducts other chores (e.g., printing sampled scheduling decisions).
2024-03-16 01:31:07 +00:00
ctrlc = { version = "3.1", features = ["termination"] }
Unify crate dependency versions Different sub-projects are using different versions for the same crates. Synchronize them to the latest.
2024-08-09 00:26:47 +01:00
fb_procfs = "0.7"
scx_lavd: add scx_lavd (Latency-criticality Aware Virtual Deadline) scheduler scx_lavd is a BPF scheduler that implements an LAVD (Latency-criticality Aware Virtual Deadline) scheduling algorithm. While LAVD is new and still evolving, its core ideas are 1) measuring how much a task is latency critical and 2) leveraging the task's latency-criticality information in making various scheduling decisions (e.g., task's deadline, time slice, etc.). As the name implies, LAVD is based on the foundation of deadline scheduling. This scheduler consists of the BPF part and the rust part. The BPF part makes all the scheduling decisions; the rust part loads the BPF code and conducts other chores (e.g., printing sampled scheduling decisions).
2024-03-16 01:31:07 +00:00
hex = "0.4.3"
scx_lavd: use itertools::iproduct!() for a nested loop Signed-off-by: Changwoo Min <changwoo@igalia.com>
2024-08-20 01:19:46 +01:00
itertools = "0.13.0"
Merge branch 'main' into topic/inlined-skeleton-members
2024-08-09 01:23:37 +01:00
libbpf-rs = "0.24.1"
scx_lavd: add scx_lavd (Latency-criticality Aware Virtual Deadline) scheduler scx_lavd is a BPF scheduler that implements an LAVD (Latency-criticality Aware Virtual Deadline) scheduling algorithm. While LAVD is new and still evolving, its core ideas are 1) measuring how much a task is latency critical and 2) leveraging the task's latency-criticality information in making various scheduling decisions (e.g., task's deadline, time slice, etc.). As the name implies, LAVD is based on the foundation of deadline scheduling. This scheduler consists of the BPF part and the rust part. The BPF part makes all the scheduling decisions; the rust part loads the BPF code and conducts other chores (e.g., printing sampled scheduling decisions).
2024-03-16 01:31:07 +00:00
libc = "0.2.137"
log = "0.4.17"
ordered-float = "3.4.0"
scx_lavd: Relay introspection output in stats::TaskSample This indirection doesn't make any visible behavior difference now but will be used to implement scx_stats support.
2024-08-24 05:17:34 +01:00
scx_stats = { path = "../../../rust/scx_stats", version = "1.0.3" }
scx_stats_derive = { path = "../../../rust/scx_stats/scx_stats_derive", version = "1.0.3" }
Version: v1.0.3
2024-08-21 17:42:11 +01:00
scx_utils = { path = "../../../rust/scx_utils", version = "1.0.3" }
scx_lavd: Relay introspection output in stats::TaskSample This indirection doesn't make any visible behavior difference now but will be used to implement scx_stats support.
2024-08-24 05:17:34 +01:00
serde = { version = "1.0", features = ["derive"] }
Unify crate dependency versions Different sub-projects are using different versions for the same crates. Synchronize them to the latest.
2024-08-09 00:26:47 +01:00
simplelog = "0.12"
scx_lavd: add scx_lavd (Latency-criticality Aware Virtual Deadline) scheduler scx_lavd is a BPF scheduler that implements an LAVD (Latency-criticality Aware Virtual Deadline) scheduling algorithm. While LAVD is new and still evolving, its core ideas are 1) measuring how much a task is latency critical and 2) leveraging the task's latency-criticality information in making various scheduling decisions (e.g., task's deadline, time slice, etc.). As the name implies, LAVD is based on the foundation of deadline scheduling. This scheduler consists of the BPF part and the rust part. The BPF part makes all the scheduling decisions; the rust part loads the BPF code and conducts other chores (e.g., printing sampled scheduling decisions).
2024-03-16 01:31:07 +00:00
static_assertions = "1.1.0"
rlimit = "0.10.1"
plain = "0.2.3"
[build-dependencies]
Version: v1.0.3
2024-08-21 17:42:11 +01:00
scx_utils = { path = "../../../rust/scx_utils", version = "1.0.3" }
scx_lavd: add scx_lavd (Latency-criticality Aware Virtual Deadline) scheduler scx_lavd is a BPF scheduler that implements an LAVD (Latency-criticality Aware Virtual Deadline) scheduling algorithm. While LAVD is new and still evolving, its core ideas are 1) measuring how much a task is latency critical and 2) leveraging the task's latency-criticality information in making various scheduling decisions (e.g., task's deadline, time slice, etc.). As the name implies, LAVD is based on the foundation of deadline scheduling. This scheduler consists of the BPF part and the rust part. The BPF part makes all the scheduling decisions; the rust part loads the BPF code and conducts other chores (e.g., printing sampled scheduling decisions).
2024-03-16 01:31:07 +00:00
[features]
enable_backtrace = []
Reference in New Issue Copy Permalink