☰
WH
·
CSBank
首頁
題庫專區
模擬考專區
Pro 方案
聯絡我們
首頁
題庫
模擬考
Pro
聯絡
總覽
資料結構
388
演算法
212
作業系統
290
計算機組織與結構
266
離散數學
161
線性代數
182
作業系統
›
Ch4 行程與執行緒管理
第 40 題／共 70 題
◀
OS 40/70
錯題回報
00:00
40. EDF、Earliest Deadline First、Real-Time Scheduling
#OS-04-040
易
EDF
Earliest Deadline First
Real-Time Scheduling
📝
☆
Which statement(s) best describes the Earliest Deadline First (EDF) scheduling algorithm?
A
(a) EDF prioritizes tasks based on their computational complexity, scheduling the most complex tasks first.
B
(b) EDF is a preemptive scheduling algorithm that prioritizes tasks based on their proximity to a fixed deadline.
C
(c) EDF assigns priority to tasks based on the order of their arrival, with the earliest arrivals being processed first.
D
(d) EDF is a non-preemptive scheduling algorithm that schedules tasks in a round-robin fashion, regardless of their deadlines.
📝 寫筆記
📄 交大113
重做
跳轉到第
題
← 上一題
下一題 →
答案／解析
▤
完整推導請見《WH 資工筆記 · 作業系統》Ch4 行程與執行緒管理
‹
本章題號 · 21–40 / 70
›
全部 70
易 41
中 24
難 5
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
