sched-sim 0.2.0__tar.gz

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (30) hide show
  1. sched_sim-0.2.0/LICENSE +190 -0
  2. sched_sim-0.2.0/PKG-INFO +215 -0
  3. sched_sim-0.2.0/README.md +188 -0
  4. sched_sim-0.2.0/pyproject.toml +69 -0
  5. sched_sim-0.2.0/pyproject.toml.orig +66 -0
  6. sched_sim-0.2.0/src/sched_sim/__init__.py +3 -0
  7. sched_sim-0.2.0/src/sched_sim/cli.py +601 -0
  8. sched_sim-0.2.0/src/sched_sim/core/event_engine.py +205 -0
  9. sched_sim-0.2.0/src/sched_sim/core/metrics.py +138 -0
  10. sched_sim-0.2.0/src/sched_sim/core/request.py +152 -0
  11. sched_sim-0.2.0/src/sched_sim/hardware/latency_model.py +116 -0
  12. sched_sim-0.2.0/src/sched_sim/hardware/presets.py +113 -0
  13. sched_sim-0.2.0/src/sched_sim/hardware/profile.py +44 -0
  14. sched_sim-0.2.0/src/sched_sim/memory/block_manager.py +227 -0
  15. sched_sim-0.2.0/src/sched_sim/memory/preemption.py +65 -0
  16. sched_sim-0.2.0/src/sched_sim/memory/prefix_cache.py +194 -0
  17. sched_sim-0.2.0/src/sched_sim/schedulers/base.py +73 -0
  18. sched_sim-0.2.0/src/sched_sim/schedulers/cache_aware.py +111 -0
  19. sched_sim-0.2.0/src/sched_sim/schedulers/chunked.py +122 -0
  20. sched_sim-0.2.0/src/sched_sim/schedulers/disaggregated.py +109 -0
  21. sched_sim-0.2.0/src/sched_sim/schedulers/fcfs.py +68 -0
  22. sched_sim-0.2.0/src/sched_sim/schedulers/sjf.py +63 -0
  23. sched_sim-0.2.0/src/sched_sim/schedulers/slo_aware.py +94 -0
  24. sched_sim-0.2.0/src/sched_sim/visualizer/exporter.py +41 -0
  25. sched_sim-0.2.0/src/sched_sim/visualizer/gantt.py +49 -0
  26. sched_sim-0.2.0/src/sched_sim/visualizer/perfetto.py +153 -0
  27. sched_sim-0.2.0/src/sched_sim/visualizer/terminal.py +127 -0
  28. sched_sim-0.2.0/src/sched_sim/workloads/distributions.py +60 -0
  29. sched_sim-0.2.0/src/sched_sim/workloads/generator.py +75 -0
  30. sched_sim-0.2.0/src/sched_sim/workloads/trace_loader.py +49 -0
@@ -0,0 +1,190 @@
1
+ Apache License
2
+ Version 2.0, January 2004
3
+ http://www.apache.org/licenses/
4
+
5
+ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
6
+
7
+ 1. Definitions.
8
+
9
+ "License" shall mean the terms and conditions for use, reproduction,
10
+ and distribution as defined by Sections 1 through 9 of this document.
11
+
12
+ "Licensor" shall mean the copyright owner or entity authorized by
13
+ the copyright owner that is granting the License.
14
+
15
+ "Legal Entity" shall mean the union of the acting entity and all
16
+ other entities that control, are controlled by, or are under common
17
+ control with that entity. For the purposes of this definition,
18
+ "control" means (i) the power, direct or indirect, to cause the
19
+ direction or management of such entity, whether by contract or
20
+ otherwise, or (ii) ownership of fifty percent (50%) or more of the
21
+ outstanding shares, or (iii) beneficial ownership of such entity.
22
+
23
+ "You" (or "Your") shall mean an individual or Legal Entity
24
+ exercising permissions granted by this License.
25
+
26
+ "Source" form shall mean the preferred form for making modifications,
27
+ including but not limited to software source code, documentation
28
+ source, and configuration files.
29
+
30
+ "Object" form shall mean any form resulting from mechanical
31
+ transformation or translation of a Source form, including but
32
+ not limited to compiled object code, generated documentation,
33
+ and conversions to other media types.
34
+
35
+ "Work" shall mean the work of authorship, whether in Source or
36
+ Object form, made available under the License, as indicated by a
37
+ copyright notice that is included in or attached to the work
38
+ (an example is provided in the Appendix below).
39
+
40
+ "Derivative Works" shall mean any work, whether in Source or Object
41
+ form, that is based on (or derived from) the Work and for which the
42
+ editorial revisions, annotations, elaborations, or other modifications
43
+ represent, as a whole, an original work of authorship. For the purposes
44
+ of this License, Derivative Works shall not include works that remain
45
+ separable from, or merely link (or bind by name) to the interfaces of,
46
+ the Work and Derivative Works thereof.
47
+
48
+ "Contribution" shall mean any work of authorship, including
49
+ the original version of the Work and any modifications or additions
50
+ to that Work or Derivative Works thereof, that is intentionally
51
+ submitted to Licensor for inclusion in the Work by the copyright owner
52
+ or by an individual or Legal Entity authorized to submit on behalf of
53
+ the copyright owner. For the purposes of this definition, "submitted"
54
+ means any form of electronic, verbal, or written communication sent
55
+ to the Licensor or its representatives, including but not limited to
56
+ communication on electronic mailing lists, source code control systems,
57
+ and issue tracking systems that are managed by, or on behalf of, the
58
+ Licensor for the purpose of discussing and improving the Work, but
59
+ excluding communication that is conspicuously marked or otherwise
60
+ designated in writing by the copyright owner as "Not a Contribution."
61
+
62
+ "Contributor" shall mean Licensor and any individual or Legal Entity
63
+ on behalf of whom a Contribution has been received by Licensor and
64
+ subsequently incorporated within the Work.
65
+
66
+ 2. Grant of Copyright License. Subject to the terms and conditions of
67
+ this License, each Contributor hereby grants to You a perpetual,
68
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
69
+ copyright license to reproduce, prepare Derivative Works of,
70
+ publicly display, publicly perform, sublicense, and distribute the
71
+ Work and such Derivative Works in Source or Object form.
72
+
73
+ 3. Grant of Patent License. Subject to the terms and conditions of
74
+ this License, each Contributor hereby grants to You a perpetual,
75
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
76
+ (except as stated in this section) patent license to make, have made,
77
+ use, offer to sell, sell, import, and otherwise transfer the Work,
78
+ where such license applies only to those patent claims licensable
79
+ by such Contributor that are necessarily infringed by their
80
+ Contribution(s) alone or by combination of their Contribution(s)
81
+ with the Work to which such Contribution(s) was submitted. If You
82
+ institute patent litigation against any entity (including a
83
+ cross-claim or counterclaim in a lawsuit) alleging that the Work
84
+ or a Contribution incorporated within the Work constitutes direct
85
+ or contributory patent infringement, then any patent licenses
86
+ granted to You under this License for that Work shall terminate
87
+ as of the date such litigation is filed.
88
+
89
+ 4. Redistribution. You may reproduce and distribute copies of the
90
+ Work or Derivative Works thereof in any medium, with or without
91
+ modifications, and in Source or Object form, provided that You
92
+ meet the following conditions:
93
+
94
+ (a) You must give any other recipients of the Work or
95
+ Derivative Works a copy of this License; and
96
+
97
+ (b) You must cause any modified files to carry prominent notices
98
+ stating that You changed the files; and
99
+
100
+ (c) You must retain, in the Source form of any Derivative Works
101
+ that You distribute, all copyright, patent, trademark, and
102
+ attribution notices from the Source form of the Work,
103
+ excluding those notices that do not pertain to any part of
104
+ the Derivative Works; and
105
+
106
+ (d) If the Work includes a "NOTICE" text file as part of its
107
+ distribution, then any Derivative Works that You distribute must
108
+ include a readable copy of the attribution notices contained
109
+ within such NOTICE file, excluding those notices that do not
110
+ pertain to any part of the Derivative Works, in at least one
111
+ of the following places: within a NOTICE text file distributed
112
+ as part of the Derivative Works; within the Source form or
113
+ documentation, if provided along with the Derivative Works; or,
114
+ within a display generated by the Derivative Works, if and
115
+ wherever such third-party notices normally appear. The contents
116
+ of the NOTICE file are for informational purposes only and
117
+ do not modify the License. You may add Your own attribution
118
+ notices within Derivative Works that You distribute, alongside
119
+ or as an addendum to the NOTICE text from the Work, provided
120
+ that such additional attribution notices cannot be construed
121
+ as modifying the License.
122
+
123
+ You may add Your own copyright statement to Your modifications and
124
+ may provide additional or different license terms and conditions
125
+ for use, reproduction, or distribution of Your modifications, or
126
+ for any such Derivative Works as a whole, provided Your use,
127
+ reproduction, and distribution of the Work otherwise complies with
128
+ the conditions stated in this License.
129
+
130
+ 5. Submission of Contributions. Unless You explicitly state otherwise,
131
+ any Contribution intentionally submitted for inclusion in the Work
132
+ by You to the Licensor shall be under the terms and conditions of
133
+ this License, without any additional terms or conditions.
134
+ Notwithstanding the above, nothing herein shall supersede or modify
135
+ the terms of any separate license agreement you may have executed
136
+ with Licensor regarding such Contributions.
137
+
138
+ 6. Trademarks. This License does not grant permission to use the trade
139
+ names, trademarks, service marks, or product names of the Licensor,
140
+ except as required for reasonable and customary use in describing the
141
+ origin of the Work and reproducing the content of the NOTICE file.
142
+
143
+ 7. Disclaimer of Warranty. Unless required by applicable law or
144
+ agreed to in writing, Licensor provides the Work (and each
145
+ Contributor provides its Contributions) on an "AS IS" BASIS,
146
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
147
+ implied, including, without limitation, any warranties or conditions
148
+ of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
149
+ PARTICULAR PURPOSE. You are solely responsible for determining the
150
+ appropriateness of using or redistributing the Work and assume any
151
+ risks associated with Your exercise of permissions under this License.
152
+
153
+ 8. Limitation of Liability. In no event and under no legal theory,
154
+ whether in tort (including negligence), contract, or otherwise,
155
+ unless required by applicable law (such as deliberate and grossly
156
+ negligent acts) or agreed to in writing, shall any Contributor be
157
+ liable to You for damages, including any direct, indirect, special,
158
+ incidental, or consequential damages of any character arising as a
159
+ result of this License or out of the use or inability to use the
160
+ Work (including but not limited to damages for loss of goodwill,
161
+ work stoppage, computer failure or malfunction, or any and all
162
+ other commercial damages or losses), even if such Contributor
163
+ has been advised of the possibility of such damages.
164
+
165
+ 9. Accepting Warranty or Additional Liability. While redistributing
166
+ the Work or Derivative Works thereof, You may choose to offer,
167
+ and charge a fee for, acceptance of support, warranty, indemnity,
168
+ or other liability obligations and/or rights consistent with this
169
+ License. However, in accepting such obligations, You may act only
170
+ on Your own behalf and on Your sole responsibility, not on behalf
171
+ of any other Contributor, and only if You agree to indemnify,
172
+ defend, and hold each Contributor harmless for any liability
173
+ incurred by, or claims asserted against, such Contributor by reason
174
+ of your accepting any such warranty or additional liability.
175
+
176
+ END OF TERMS AND CONDITIONS
177
+
178
+ Copyright 2026 Prajwal Pujari
179
+
180
+ Licensed under the Apache License, Version 2.0 (the "License");
181
+ you may not use this file except in compliance with the License.
182
+ You may obtain a copy of the License at
183
+
184
+ http://www.apache.org/licenses/LICENSE-2.0
185
+
186
+ Unless required by applicable law or agreed to in writing, software
187
+ distributed under the License is distributed on an "AS IS" BASIS,
188
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
189
+ See the License for the specific language governing permissions and
190
+ limitations under the License.
@@ -0,0 +1,215 @@
1
+ Metadata-Version: 2.4
2
+ Name: sched-sim
3
+ Version: 0.2.0
4
+ Summary: High-fidelity discrete-event simulator for LLM serving schedulers (FCFS, SJF, Chunked Prefill, Radix Prefix Caching, SLO-Aware, Disaggregated).
5
+ Keywords: llm,inference,serving,scheduler,discrete-event-simulation,chunked-prefill,prefix-caching,radix-tree,paged-attention,queueing-theory,vllm,sglang,sarathi,distserve
6
+ Author: Prajwal Pujari
7
+ Author-email: Prajwal Pujari <prajwalpujari16@gmail.com>
8
+ License-Expression: Apache-2.0
9
+ License-File: LICENSE
10
+ Classifier: Programming Language :: Python :: 3
11
+ Classifier: Programming Language :: Python :: 3.11
12
+ Classifier: Programming Language :: Python :: 3.12
13
+ Classifier: Operating System :: OS Independent
14
+ Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
15
+ Classifier: Topic :: System :: Benchmark
16
+ Classifier: Topic :: System :: Hardware
17
+ Requires-Dist: typer>=0.12
18
+ Requires-Dist: rich>=13
19
+ Requires-Dist: pydantic>=2.6
20
+ Requires-Dist: pyyaml>=6.0
21
+ Requires-Python: >=3.11
22
+ Project-URL: Homepage, https://github.com/Prajwal7-2002/sched-sim
23
+ Project-URL: Documentation, https://prajwal7-2002.github.io/sched-sim/
24
+ Project-URL: Repository, https://github.com/Prajwal7-2002/sched-sim
25
+ Project-URL: Issues, https://github.com/Prajwal7-2002/sched-sim/issues
26
+ Description-Content-Type: text/markdown
27
+
28
+ # sched-sim โฑ๏ธ
29
+
30
+ [![CI](https://github.com/Prajwal7-2002/sched-sim/actions/workflows/ci.yml/badge.svg)](https://github.com/Prajwal7-2002/sched-sim/actions)
31
+ [![Docs](https://github.com/Prajwal7-2002/sched-sim/actions/workflows/docs.yml/badge.svg)](https://prajwal7-2002.github.io/sched-sim/)
32
+ [![License](https://img.shields.io/badge/license-Apache%202.0-blue.svg)](LICENSE)
33
+ [![Python](https://img.shields.io/badge/python-3.11%2B-blue)](https://www.python.org/)
34
+ [![Hardware](https://img.shields.io/badge/CPU-100%25_Deterministic-green.svg)](#)
35
+ [![Calibrated](https://img.shields.io/badge/Calibrated_With-servebench_%26_mini--infer-teal.svg)](#)
36
+
37
+ A high-fidelity, CPU-first **discrete-event simulator (DES) for LLM serving schedulers**.
38
+
39
+ In modern inference clusters (vLLM, TGI, TensorRT-LLM, SGLang, DistServe), **the scheduling policy is the single largest determinant of cluster throughput, latency, and hardware cost**. While continuous batching and Paged KV-caching provide the mechanism for dynamic execution, the scheduler determines:
40
+ 1. Which requests enter the next forward iteration.
41
+ 2. How large prompt prefills are chunked to prevent decode starvation.
42
+ 3. What happens when the physical KV-cache runs out of memory (swapping to CPU DRAM vs eviction and recomputation).
43
+ 4. When to disaggregate prefill and decode phases onto specialized GPU worker pools (Splitwise / DistServe architecture).
44
+
45
+ Testing these policies on real GPU clusters (e.g. 8x H100 nodes) is **slow, noisy, and expensive ($20โ€“$50/hr)**. `sched-sim` simulates hours of multi-GPU serving traffic in **seconds on any standard CPU**, using validated analytical performance models calibrated against empirical silicon measurements from **[servebench](https://github.com/Prajwal7-2002/servebench)** and **[mini-infer](https://github.com/Prajwal7-2002/mini-infer)**.
46
+
47
+ ---
48
+
49
+ ## โšก Core Architecture
50
+
51
+ ```
52
+ โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”
53
+ โ”‚ Arrival Process โ”‚
54
+ โ”‚ (Poisson, Bursty Gamma, LMSYS / ShareGPT Traces) โ”‚
55
+ โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜
56
+ โ”‚ Request arrives (prompt_len, output_len)
57
+ โ–ผ
58
+ โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”
59
+ โ”‚ Waiting Queue โ”‚
60
+ โ”‚ (FCFS, SJF, Priority, SLO) โ”‚
61
+ โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜
62
+ โ”‚ Iteration Scheduler
63
+ โ–ผ
64
+ โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”
65
+ โ”‚ Continuous Batching Step (Iteration) โ”‚
66
+ โ”‚ โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ” โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ” โ”‚
67
+ โ”‚ โ”‚ Prefill Tokens (Chunked) โ”‚ โ”‚ Decode Tokens (1/req) โ”‚ โ”‚
68
+ โ”‚ โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜ โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜ โ”‚
69
+ โ”‚ โ–ฒ โ–ฒ โ”‚
70
+ โ”‚ โ”‚ Paged KV Allocator โ”‚ Memory Check โ”‚
71
+ โ”‚ โ”‚ โ”‚ โ”‚
72
+ โ”‚ โ–ผ โ–ผ โ”‚
73
+ โ”‚ โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ” โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ” โ”‚
74
+ โ”‚ โ”‚ Paged KV-Cache Pool โ”‚ โ”‚ Preemption Subsystem โ”‚ โ”‚
75
+ โ”‚ โ”‚ (Physical 16-tok Blocks) โ”‚ โ”‚ (Recompute vs CPU Swap) โ”‚ โ”‚
76
+ โ”‚ โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜ โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜ โ”‚
77
+ โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜
78
+ ```
79
+
80
+ ---
81
+
82
+ ## โฑ๏ธ Quickstart in 30 Seconds
83
+
84
+ ### Install
85
+ ```bash
86
+ # Direct from source with uv (fastest)
87
+ git clone https://github.com/Prajwal7-2002/sched-sim.git
88
+ cd sched-sim
89
+ uv sync
90
+
91
+ # Or with standard pip
92
+ pip install -e .
93
+ ```
94
+
95
+ ### 1. Run a Simulation Scenario
96
+ Simulate **Chunked Prefill** serving a long-context RAG workload on an **NVIDIA A100 SXM4 (80GB)** cluster running Llama-3-8B:
97
+ ```bash
98
+ sched-sim run --scheduler chunked --workload rag --hardware a100 --duration 10
99
+ ```
100
+
101
+ > **Runs 100% on your CPU**: You do **not** need an A100 or any GPU to run `sched-sim`. It simulates hours of multi-GPU serving traffic in seconds on any standard CPU. The `--hardware` flag tells the discrete-event engine which cluster architecture to mathematically simulate (`a100`, `h100`, `t4`, `rtx3050`, or a custom JSON profile).
102
+
103
+ ### 2. Compare Schedulers Side-by-Side (Identical Trace)
104
+ Benchmark all 5 scheduling policies on the exact same Poisson arrival trace:
105
+ ```bash
106
+ sched-sim compare --schedulers fcfs,sjf,chunked,slo,disaggregated --workload rag --hardware a100
107
+ ```
108
+
109
+ ### 3. Replay Real-World Conversation Traces
110
+ Replay Chatbot Arena conversation traces through the simulator:
111
+ ```bash
112
+ sched-sim trace ./traces/lmsys_sample.json --scheduler chunked
113
+ ```
114
+
115
+ ### 4. Sweep Load to Discover Saturation Knees
116
+ Discover the exact request rate where each scheduler hits its Goodput cliff:
117
+ ```bash
118
+ sched-sim sweep --schedulers fcfs,chunked,slo,disaggregated --workload rag --min-rate 2 --max-rate 18 --step 4
119
+ ```
120
+
121
+ ### 5. Check Silicon Hardware Presets
122
+ Inspect calibrated hardware profiles:
123
+ ```bash
124
+ sched-sim info
125
+ ```
126
+
127
+ ---
128
+
129
+ ## ๐Ÿ”ฌ The 6 Core Schedulers
130
+
131
+ | Scheduler | Architecture & Policy | Key Trade-Off |
132
+ | :--- | :--- | :--- |
133
+ | **`Cache-Aware`** | **Radix-Tree prefix caching** (SGLang / vLLM APC). Shares physical 16-token KV blocks with LRU eviction and prefix-affinity prioritization. | **Near-zero TTFT** for RAG, multi-turn chat, and shared system prompts. |
134
+ | **`Chunked`** | Token budgeting (Sarathi-Serve / vLLM). Slices prompt prefills into 512-token chunks. | Eliminates TPOT latency spikes and ensures steady iteration times. |
135
+ | **`SLO-Aware`** | Dynamic deadline scheduling (EDF) with selective dropping of unrecoverable requests. | Maximizes **Goodput** (% of requests meeting both TTFT and TPOT SLOs). |
136
+ | **`Disaggregated`**| Splitwise / DistServe architecture: separates compute-bound Prefill workers from memory-bound Decode workers. | Zero decode interference; models KV-cache interconnect transfer delay. |
137
+ | **`SJF`** | Shortest-Job-First (shortest prompt first). | Minimizes average waiting time and mean TTFT, but starves heavy RAG prompts. |
138
+ | **`FCFS`** | First-Come First-Served continuous batching with atomic prefills. | Simple, but large prompts cause Head-of-Line blocking and decode starvation. |
139
+
140
+ ---
141
+
142
+ ## ๐ŸŽจ Interactive Perfetto / Chromium Timeline Visualization
143
+
144
+ Export native Chromium / Catapult Trace Event JSON files and inspect discrete forward-pass iteration slices and per-request lifecycles in **[ui.perfetto.dev](https://ui.perfetto.dev)**:
145
+
146
+ ```bash
147
+ sched-sim run --scheduler cache_aware --workload rag --hardware a100 --trace-out trace.json
148
+ ```
149
+
150
+ Drag and drop `trace.json` directly into **Perfetto** to visually analyze:
151
+ - **Prefill vs. Decode vs. Mixed Slices**: Microsecond-accurate forward pass durations on the GPU accelerator.
152
+ - **Request Streams**: Exact arrival, TTFT first-token timestamps, and completion times.
153
+ - **Counter Tracks**: Real-time GPU KV-cache memory utilization (%) and concurrent batch stream counts.
154
+
155
+ ---
156
+
157
+ ## ๐Ÿ› ๏ธ Hardware Calibration (Analytical Roofline Model)
158
+
159
+ `sched-sim` avoids arbitrary delays. It computes exact step latencies from first-principles roofline mechanics calibrated with empirical silicon data:
160
+
161
+ 1. **Prefill Latency ($T_{\text{prefill}}$)**: Compute-bound matrix multiplication:
162
+ $$T_{\text{prefill}} = \max\left(\frac{2 \cdot P \cdot N}{\text{Effective TFLOPS}}, \frac{\text{Weights}}{\text{Bandwidth}}\right) + T_{\text{launch}}$$
163
+
164
+ 2. **Decode Latency ($T_{\text{decode}}$)**: Memory-bandwidth bound weight and KV-cache gather:
165
+ $$T_{\text{decode}} = \frac{P \cdot \text{dtype} + L_{\text{total}} \cdot \text{KV\_bytes\_per\_token}}{\text{DRAM Bandwidth (GB/s)}} + T_{\text{launch}}$$
166
+
167
+ 3. **Interconnect Transfer ($T_{\text{transfer}}$)**: Network serialization delay for PD Disaggregation:
168
+ $$T_{\text{transfer}} = \frac{L_{\text{prompt}} \cdot \text{KV\_bytes\_per\_token}}{\text{Network Bandwidth}} + T_{\text{net\_latency}}$$
169
+
170
+ ---
171
+
172
+ ## ๐Ÿ”ฌ Empirical Silicon Validation (AMD Ryzen 5 6600H + NVIDIA RTX 3050 6GB)
173
+
174
+ `sched-sim` is validated against ground-truth benchmarks collected by **[servebench](https://github.com/Prajwal7-2002/servebench)** testing **Qwen 2.5 0.5B** on both C++/CUDA and Python runtimes on physical silicon:
175
+
176
+ | Target Serving Engine | Model | Metric | Real Hardware (`servebench`) | `sched-sim` Predicted | Variance |
177
+ | :--- | :--- | :--- | :--- | :--- | :--- |
178
+ | **Ollama (C++/CUDA runtime)** | Qwen 2.5 0.5B | **TTFT** | 44.33 ms | 47.81 ms | **7.9%** |
179
+ | | | **TPOT** | 4.96 ms | 5.33 ms | **7.5%** |
180
+ | | | **E2E** | 627.50 ms | 666.73 ms | **6.3%** |
181
+ | **mini-infer (PyTorch eager runtime)** | Qwen 2.5 0.5B | **TTFT** | 121.80 ms | 140.60 ms | **15.4%** |
182
+ | | | **TPOT** | 103.24 ms | 106.67 ms | **3.3%** |
183
+ | | | **E2E** | 3322.29 ms | 3447.26 ms | **3.8%** |
184
+
185
+ Run the reproducible validation suite yourself:
186
+ ```bash
187
+ uv run python benchmarks/validate_flagships.py
188
+ ```
189
+ Full methodology and analysis available in [benchmarks/RESULTS.md](benchmarks/RESULTS.md).
190
+
191
+ ---
192
+
193
+ ## ๐Ÿ“Š Telemetry & Reports
194
+
195
+ Every run outputs comprehensive telemetry:
196
+ * **Latency Percentiles**: TTFT (p50, p90, p99 ms), TPOT (p50, p90, p99 ms/tok), End-to-End latency.
197
+ * **Goodput Ratio**: Exact percentage of requests meeting both TTFT and TPOT Service Level Objectives.
198
+ * **Preemptions & Recomputations**: Total memory thrashing events and discarded tokens.
199
+ * **Visual Gantt Timeline**: Live ASCII/Unicode GPU iteration breakdowns.
200
+ * **Export**: JSON (`--output report.json`) and Markdown (`--output report.md`).
201
+
202
+ ---
203
+
204
+ ## ๐Ÿงช Testing
205
+
206
+ Run the deterministic test suite:
207
+ ```bash
208
+ uv run pytest
209
+ ```
210
+
211
+ ---
212
+
213
+ ## ๐Ÿ“„ License
214
+
215
+ Apache 2.0. See [LICENSE](LICENSE) for details.
@@ -0,0 +1,188 @@
1
+ # sched-sim โฑ๏ธ
2
+
3
+ [![CI](https://github.com/Prajwal7-2002/sched-sim/actions/workflows/ci.yml/badge.svg)](https://github.com/Prajwal7-2002/sched-sim/actions)
4
+ [![Docs](https://github.com/Prajwal7-2002/sched-sim/actions/workflows/docs.yml/badge.svg)](https://prajwal7-2002.github.io/sched-sim/)
5
+ [![License](https://img.shields.io/badge/license-Apache%202.0-blue.svg)](LICENSE)
6
+ [![Python](https://img.shields.io/badge/python-3.11%2B-blue)](https://www.python.org/)
7
+ [![Hardware](https://img.shields.io/badge/CPU-100%25_Deterministic-green.svg)](#)
8
+ [![Calibrated](https://img.shields.io/badge/Calibrated_With-servebench_%26_mini--infer-teal.svg)](#)
9
+
10
+ A high-fidelity, CPU-first **discrete-event simulator (DES) for LLM serving schedulers**.
11
+
12
+ In modern inference clusters (vLLM, TGI, TensorRT-LLM, SGLang, DistServe), **the scheduling policy is the single largest determinant of cluster throughput, latency, and hardware cost**. While continuous batching and Paged KV-caching provide the mechanism for dynamic execution, the scheduler determines:
13
+ 1. Which requests enter the next forward iteration.
14
+ 2. How large prompt prefills are chunked to prevent decode starvation.
15
+ 3. What happens when the physical KV-cache runs out of memory (swapping to CPU DRAM vs eviction and recomputation).
16
+ 4. When to disaggregate prefill and decode phases onto specialized GPU worker pools (Splitwise / DistServe architecture).
17
+
18
+ Testing these policies on real GPU clusters (e.g. 8x H100 nodes) is **slow, noisy, and expensive ($20โ€“$50/hr)**. `sched-sim` simulates hours of multi-GPU serving traffic in **seconds on any standard CPU**, using validated analytical performance models calibrated against empirical silicon measurements from **[servebench](https://github.com/Prajwal7-2002/servebench)** and **[mini-infer](https://github.com/Prajwal7-2002/mini-infer)**.
19
+
20
+ ---
21
+
22
+ ## โšก Core Architecture
23
+
24
+ ```
25
+ โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”
26
+ โ”‚ Arrival Process โ”‚
27
+ โ”‚ (Poisson, Bursty Gamma, LMSYS / ShareGPT Traces) โ”‚
28
+ โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜
29
+ โ”‚ Request arrives (prompt_len, output_len)
30
+ โ–ผ
31
+ โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”
32
+ โ”‚ Waiting Queue โ”‚
33
+ โ”‚ (FCFS, SJF, Priority, SLO) โ”‚
34
+ โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜
35
+ โ”‚ Iteration Scheduler
36
+ โ–ผ
37
+ โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”
38
+ โ”‚ Continuous Batching Step (Iteration) โ”‚
39
+ โ”‚ โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ” โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ” โ”‚
40
+ โ”‚ โ”‚ Prefill Tokens (Chunked) โ”‚ โ”‚ Decode Tokens (1/req) โ”‚ โ”‚
41
+ โ”‚ โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜ โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜ โ”‚
42
+ โ”‚ โ–ฒ โ–ฒ โ”‚
43
+ โ”‚ โ”‚ Paged KV Allocator โ”‚ Memory Check โ”‚
44
+ โ”‚ โ”‚ โ”‚ โ”‚
45
+ โ”‚ โ–ผ โ–ผ โ”‚
46
+ โ”‚ โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ” โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ” โ”‚
47
+ โ”‚ โ”‚ Paged KV-Cache Pool โ”‚ โ”‚ Preemption Subsystem โ”‚ โ”‚
48
+ โ”‚ โ”‚ (Physical 16-tok Blocks) โ”‚ โ”‚ (Recompute vs CPU Swap) โ”‚ โ”‚
49
+ โ”‚ โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜ โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜ โ”‚
50
+ โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜
51
+ ```
52
+
53
+ ---
54
+
55
+ ## โฑ๏ธ Quickstart in 30 Seconds
56
+
57
+ ### Install
58
+ ```bash
59
+ # Direct from source with uv (fastest)
60
+ git clone https://github.com/Prajwal7-2002/sched-sim.git
61
+ cd sched-sim
62
+ uv sync
63
+
64
+ # Or with standard pip
65
+ pip install -e .
66
+ ```
67
+
68
+ ### 1. Run a Simulation Scenario
69
+ Simulate **Chunked Prefill** serving a long-context RAG workload on an **NVIDIA A100 SXM4 (80GB)** cluster running Llama-3-8B:
70
+ ```bash
71
+ sched-sim run --scheduler chunked --workload rag --hardware a100 --duration 10
72
+ ```
73
+
74
+ > **Runs 100% on your CPU**: You do **not** need an A100 or any GPU to run `sched-sim`. It simulates hours of multi-GPU serving traffic in seconds on any standard CPU. The `--hardware` flag tells the discrete-event engine which cluster architecture to mathematically simulate (`a100`, `h100`, `t4`, `rtx3050`, or a custom JSON profile).
75
+
76
+ ### 2. Compare Schedulers Side-by-Side (Identical Trace)
77
+ Benchmark all 5 scheduling policies on the exact same Poisson arrival trace:
78
+ ```bash
79
+ sched-sim compare --schedulers fcfs,sjf,chunked,slo,disaggregated --workload rag --hardware a100
80
+ ```
81
+
82
+ ### 3. Replay Real-World Conversation Traces
83
+ Replay Chatbot Arena conversation traces through the simulator:
84
+ ```bash
85
+ sched-sim trace ./traces/lmsys_sample.json --scheduler chunked
86
+ ```
87
+
88
+ ### 4. Sweep Load to Discover Saturation Knees
89
+ Discover the exact request rate where each scheduler hits its Goodput cliff:
90
+ ```bash
91
+ sched-sim sweep --schedulers fcfs,chunked,slo,disaggregated --workload rag --min-rate 2 --max-rate 18 --step 4
92
+ ```
93
+
94
+ ### 5. Check Silicon Hardware Presets
95
+ Inspect calibrated hardware profiles:
96
+ ```bash
97
+ sched-sim info
98
+ ```
99
+
100
+ ---
101
+
102
+ ## ๐Ÿ”ฌ The 6 Core Schedulers
103
+
104
+ | Scheduler | Architecture & Policy | Key Trade-Off |
105
+ | :--- | :--- | :--- |
106
+ | **`Cache-Aware`** | **Radix-Tree prefix caching** (SGLang / vLLM APC). Shares physical 16-token KV blocks with LRU eviction and prefix-affinity prioritization. | **Near-zero TTFT** for RAG, multi-turn chat, and shared system prompts. |
107
+ | **`Chunked`** | Token budgeting (Sarathi-Serve / vLLM). Slices prompt prefills into 512-token chunks. | Eliminates TPOT latency spikes and ensures steady iteration times. |
108
+ | **`SLO-Aware`** | Dynamic deadline scheduling (EDF) with selective dropping of unrecoverable requests. | Maximizes **Goodput** (% of requests meeting both TTFT and TPOT SLOs). |
109
+ | **`Disaggregated`**| Splitwise / DistServe architecture: separates compute-bound Prefill workers from memory-bound Decode workers. | Zero decode interference; models KV-cache interconnect transfer delay. |
110
+ | **`SJF`** | Shortest-Job-First (shortest prompt first). | Minimizes average waiting time and mean TTFT, but starves heavy RAG prompts. |
111
+ | **`FCFS`** | First-Come First-Served continuous batching with atomic prefills. | Simple, but large prompts cause Head-of-Line blocking and decode starvation. |
112
+
113
+ ---
114
+
115
+ ## ๐ŸŽจ Interactive Perfetto / Chromium Timeline Visualization
116
+
117
+ Export native Chromium / Catapult Trace Event JSON files and inspect discrete forward-pass iteration slices and per-request lifecycles in **[ui.perfetto.dev](https://ui.perfetto.dev)**:
118
+
119
+ ```bash
120
+ sched-sim run --scheduler cache_aware --workload rag --hardware a100 --trace-out trace.json
121
+ ```
122
+
123
+ Drag and drop `trace.json` directly into **Perfetto** to visually analyze:
124
+ - **Prefill vs. Decode vs. Mixed Slices**: Microsecond-accurate forward pass durations on the GPU accelerator.
125
+ - **Request Streams**: Exact arrival, TTFT first-token timestamps, and completion times.
126
+ - **Counter Tracks**: Real-time GPU KV-cache memory utilization (%) and concurrent batch stream counts.
127
+
128
+ ---
129
+
130
+ ## ๐Ÿ› ๏ธ Hardware Calibration (Analytical Roofline Model)
131
+
132
+ `sched-sim` avoids arbitrary delays. It computes exact step latencies from first-principles roofline mechanics calibrated with empirical silicon data:
133
+
134
+ 1. **Prefill Latency ($T_{\text{prefill}}$)**: Compute-bound matrix multiplication:
135
+ $$T_{\text{prefill}} = \max\left(\frac{2 \cdot P \cdot N}{\text{Effective TFLOPS}}, \frac{\text{Weights}}{\text{Bandwidth}}\right) + T_{\text{launch}}$$
136
+
137
+ 2. **Decode Latency ($T_{\text{decode}}$)**: Memory-bandwidth bound weight and KV-cache gather:
138
+ $$T_{\text{decode}} = \frac{P \cdot \text{dtype} + L_{\text{total}} \cdot \text{KV\_bytes\_per\_token}}{\text{DRAM Bandwidth (GB/s)}} + T_{\text{launch}}$$
139
+
140
+ 3. **Interconnect Transfer ($T_{\text{transfer}}$)**: Network serialization delay for PD Disaggregation:
141
+ $$T_{\text{transfer}} = \frac{L_{\text{prompt}} \cdot \text{KV\_bytes\_per\_token}}{\text{Network Bandwidth}} + T_{\text{net\_latency}}$$
142
+
143
+ ---
144
+
145
+ ## ๐Ÿ”ฌ Empirical Silicon Validation (AMD Ryzen 5 6600H + NVIDIA RTX 3050 6GB)
146
+
147
+ `sched-sim` is validated against ground-truth benchmarks collected by **[servebench](https://github.com/Prajwal7-2002/servebench)** testing **Qwen 2.5 0.5B** on both C++/CUDA and Python runtimes on physical silicon:
148
+
149
+ | Target Serving Engine | Model | Metric | Real Hardware (`servebench`) | `sched-sim` Predicted | Variance |
150
+ | :--- | :--- | :--- | :--- | :--- | :--- |
151
+ | **Ollama (C++/CUDA runtime)** | Qwen 2.5 0.5B | **TTFT** | 44.33 ms | 47.81 ms | **7.9%** |
152
+ | | | **TPOT** | 4.96 ms | 5.33 ms | **7.5%** |
153
+ | | | **E2E** | 627.50 ms | 666.73 ms | **6.3%** |
154
+ | **mini-infer (PyTorch eager runtime)** | Qwen 2.5 0.5B | **TTFT** | 121.80 ms | 140.60 ms | **15.4%** |
155
+ | | | **TPOT** | 103.24 ms | 106.67 ms | **3.3%** |
156
+ | | | **E2E** | 3322.29 ms | 3447.26 ms | **3.8%** |
157
+
158
+ Run the reproducible validation suite yourself:
159
+ ```bash
160
+ uv run python benchmarks/validate_flagships.py
161
+ ```
162
+ Full methodology and analysis available in [benchmarks/RESULTS.md](benchmarks/RESULTS.md).
163
+
164
+ ---
165
+
166
+ ## ๐Ÿ“Š Telemetry & Reports
167
+
168
+ Every run outputs comprehensive telemetry:
169
+ * **Latency Percentiles**: TTFT (p50, p90, p99 ms), TPOT (p50, p90, p99 ms/tok), End-to-End latency.
170
+ * **Goodput Ratio**: Exact percentage of requests meeting both TTFT and TPOT Service Level Objectives.
171
+ * **Preemptions & Recomputations**: Total memory thrashing events and discarded tokens.
172
+ * **Visual Gantt Timeline**: Live ASCII/Unicode GPU iteration breakdowns.
173
+ * **Export**: JSON (`--output report.json`) and Markdown (`--output report.md`).
174
+
175
+ ---
176
+
177
+ ## ๐Ÿงช Testing
178
+
179
+ Run the deterministic test suite:
180
+ ```bash
181
+ uv run pytest
182
+ ```
183
+
184
+ ---
185
+
186
+ ## ๐Ÿ“„ License
187
+
188
+ Apache 2.0. See [LICENSE](LICENSE) for details.
@@ -0,0 +1,69 @@
1
+ [build-system]
2
+ requires = ["uv_build>=0.12,<0.13"]
3
+ build-backend = "uv_build"
4
+
5
+ [project]
6
+ name = "sched-sim"
7
+ version = "0.2.0"
8
+ description = "High-fidelity discrete-event simulator for LLM serving schedulers (FCFS, SJF, Chunked Prefill, Radix Prefix Caching, SLO-Aware, Disaggregated)."
9
+ readme = "README.md"
10
+ license = "Apache-2.0"
11
+ license-files = ["LICENSE"]
12
+ requires-python = ">=3.11"
13
+ keywords = [
14
+ "llm",
15
+ "inference",
16
+ "serving",
17
+ "scheduler",
18
+ "discrete-event-simulation",
19
+ "chunked-prefill",
20
+ "prefix-caching",
21
+ "radix-tree",
22
+ "paged-attention",
23
+ "queueing-theory",
24
+ "vllm",
25
+ "sglang",
26
+ "sarathi",
27
+ "distserve",
28
+ ]
29
+ classifiers = [
30
+ "Programming Language :: Python :: 3",
31
+ "Programming Language :: Python :: 3.11",
32
+ "Programming Language :: Python :: 3.12",
33
+ "Operating System :: OS Independent",
34
+ "Topic :: Scientific/Engineering :: Artificial Intelligence",
35
+ "Topic :: System :: Benchmark",
36
+ "Topic :: System :: Hardware",
37
+ ]
38
+ dependencies = [
39
+ "typer>=0.12",
40
+ "rich>=13",
41
+ "pydantic>=2.6",
42
+ "pyyaml>=6.0",
43
+ ]
44
+
45
+ [[project.authors]]
46
+ name = "Prajwal Pujari"
47
+ email = "prajwalpujari16@gmail.com"
48
+
49
+ [project.scripts]
50
+ sched-sim = "sched_sim.cli:app"
51
+
52
+ [project.urls]
53
+ Homepage = "https://github.com/Prajwal7-2002/sched-sim"
54
+ Documentation = "https://prajwal7-2002.github.io/sched-sim/"
55
+ Repository = "https://github.com/Prajwal7-2002/sched-sim"
56
+ Issues = "https://github.com/Prajwal7-2002/sched-sim/issues"
57
+
58
+ [dependency-groups]
59
+ dev = [
60
+ "pytest>=8",
61
+ "pytest-asyncio>=0.23",
62
+ "pytest-cov>=5",
63
+ "ruff>=0.5",
64
+ "mkdocs-material>=9.5",
65
+ ]
66
+
67
+ [tool.pytest.ini_options]
68
+ testpaths = ["tests"]
69
+ python_files = ["test_*.py"]