Update README.md

This commit is contained in:
xixu-me committed 2024-11-29 10:32:20 +08:00
1 parent 503603eba8
commit 66e69b97ef
1 file changed
+21 -21
+21 -21
View File
@@ -1,32 +1,32 @@
# 磁盘调度算法可视化
# Disk Scheduling Algorithm Visualization
一个用于演示和比较不同磁盘调度算法的交互式可视化工具。支持 FCFS(先来先服务)、SSTF(最短寻道时间优先)和 SCAN(电梯算法)三种经典的磁盘调度算法。
An interactive visualization tool for demonstrating and comparing different disk scheduling algorithms. Supports three classic disk scheduling algorithms: FCFS (First Come First Serve), SSTF (Shortest Seek Time First), and SCAN (Elevator Algorithm).
## 功能特点
## Features
- 直观的磁头移动可视化
- 实时显示寻道时间和当前位置
- 支持三种经典磁盘调度算法:
- Intuitive disk head movement visualization
- Real-time display of seek time and current position
- Support for three classic disk scheduling algorithms:
- FCFS (First Come First Serve)
- SSTF (Shortest Seek Time First)
- SCAN (电梯算法)
- 算法性能比较表格
- 详细的算法特点说明
- 响应式设计,支持移动设备
- SCAN (Elevator Algorithm)
- Algorithm performance comparison table
- Detailed algorithm characteristics explanation
- Responsive design, mobile device support
## 使用方法
## Usage
1. 设置磁头初始位置(0-199)
2. 输入请求队列(用逗号分隔的数字)
3. 选择 SCAN 算法的初始方向(向左/向右)
4. 点击对应算法按钮开始演示
5. 使用重置按钮可以重新开始演示
6. 查看比较表格了解不同算法的性能差异
1. Set initial head position (0-199)
2. Input request queue (comma-separated numbers)
3. Select SCAN algorithm initial direction (Left/Right)
4. Click corresponding algorithm button to start demonstration
5. Use reset button to restart demonstration
6. View comparison table to understand performance differences between algorithms
## 在线演示
## Online Demo
访问 [https://os.xixu.us.kg](https://os.xixu.us.kg) 体验在线演示。
Visit [https://os.xixu.us.kg](https://os.xixu.us.kg) to experience the online demo.
## 开源协议
## License
本项目采用 GNU General Public License v3.0 开源协议。详见 [LICENSE](LICENSE) 文件。
This project is licensed under the GNU General Public License v3.0. See the [LICENSE](LICENSE) file for details.