CSAPP Notes: Scheduler & ArchChapter 8. Scheduler in OS为操作系统的调度环境作出假设: Each job runs for the same amount of time All jobs arrive at the same time Once started, each job runs to completion All jobs only use the CPU i.e., they perform no I/O The run-time of each job is known 引入调度优劣衡量指标:周转时间,$T_{turnaround}=T_{completion}-T_{arrival}$; Strategy 1: FIFO(FCFS,First Come First Served) Implementation: queue; 消除假设 1:若短时任务排在长时任务之后,则平均周转时间效果很差; Strategy 2 : SJF(Shortest Job First) 内容:对于同时到达的任务,优先选择总时长小的任务。 作用:(应对假设 1...