課程名稱︰高等作業系統
課程性質︰資工系選修
課程教師︰薛智文
開課學院：電機資訊學院
開課系所︰資訊工程學系
考試日期（年月日）︰2025/04/09 - 2025/04/12
考試時限（分鐘）：5759
試題 :
This is a take-home on-line exam in a few days. Please respond in your own suc-
cinct words. Provide your own question definition if you find that it is not
clear enough. The hints might be misleading. Points will be deducted if your
question definition is not necessary or if you are using a plagiarism. You can
answer in Chinese. You can not see your previous answers on the second try, so
backup before it.
問題 1
For each of the following statements, answer Yes if it is TRUE or brief why it
is wrong in one sentence.
1. (2 points) The less threading, the less performance.
2. (2 points) The less frames, the more page fault rates.
3. (2 points) The smaller time quantum for scheduling, the longer average tur-
naround time.
4. (2 points) Firmware can be executed faster in ROM than in RAM.
5. (2 points) Working set model has to be supported by MMU.
6. (2 points) A safe state will not go to a deadlocked state.
7. (2 points) Context switch is usually supported in hardware instruction for
performance.
8. (2 points) Session Semantics: Once the file is closed, the changes are visi-
ble only to new sessions.
9. (2 points) A real-time scheduler schedules tasks according to their real-
time priorities.
10. (2 points) The two-phase commit protocol guarantees serializability and pre-
vents deadlock.
問題 2
For homework 2, the real-time RM/EDF scheduler simulation, it is not O(1) as the
uC/OS-II, the ID is the priority. Since Linux has changed from O(1) to Complete-
ly Fair Scheduler and then EEVDF, why not use the real-time scheduler such as in
uC/OS-II for Linux on real-time scheduling policy? Hints: how about many tasks
with the same priority, a scheduler needs to run forever...
問題 3
For homework 3, the chair competing problem, N Persons Competing M Chairs in a
round, each person must win at least W times in R consecutive rounds. Please
describe your solution, not necessarily with codes. The pseudo code is welcome.
Hints: what would the output be for justice and fairness, close to reality: the
chairs might be renewed (like concert tickets) in each round, people run diffe-
rently in speed and might not need to wait for all others to start for next
round, N and M might be very big...
問題 4
OSes are emerging. They go diversified and embedded or specialized. For a dis-
tributed real-time OS supports trust as a blockchain does but would like to make
the most out of system utilization by concurrency such as sharding, meaning pa-
rallelizing with data dependency, to solve efficiency problems such as many
blockchain nodes (processors) generate only one block (task) in a period of
time. To implement solutions of homework 3, the 大風吹 problem, for resource re-
servation in a blockchain platform supporting trust, synchronization monitor
might be an easy mechanism. What difficulty is there in optimizing for perfor-
mance using a synchronization monitor? Hints: serializability, linearizability,
deadlock, scalability, explain with a sample system.
問題 5
What system software or component can you design for your term project to opti-
mize the resource utilization (hardware and software) in the project system?
What value can your term project create? For whom? When and where? Write your
proposal in Lecture Notes link if you have not done so and provide a date to
present your idea in class. Hints: Define your most valuable system design, or
resource utilization even it is a survey.