阿摩線上測驗
登入
首頁
>
中山◆資工◆作業系統
>
108年 - 108 國立中山大學_碩士班招生考試_資工系(資安)：作業系統#105763
>
題組內容
3. [Storage and I/O Management: ]
(3) Explain seek time, rotational latency, and random-access time for disks.
其他申論題
(3) Let average page-fault time and memory-access time be 80us and 240ns, respectively. What is the expected page-fault rate if we want to get the effective access time smaller than 280ns? Give your calculation.
#450201
(4) Suppose that it takes 35ns and 105ns to search TLB and access memory, respectively. If TLB has 95% hit ratio, what is the effective memory-access time? Give your calculation.
#450202
(1) What are the two functions supported by a VFS (virtual file system) layer?
#450203
(2) Consider a disk queue with requests for I/O to blocks on cylinders 103, 188, 42, 120, 7, 138, 76 and 87. Let the disk head currently stay at cylinder 65, and the maximum cylinder be 200. Show the results of SSTF and C-LOOK scheduling methods.
#450204
(4) Explain the two major types of memory-mapped I/O.
#450206
(1) Explain how the deadlock prevention scheme works.
#450207
(2) Give three requirements for any solution to the critical-section problem.
#450208
(3) What is the priority inversion problem? How to solve it?
#450209
(4) What is conflict serializable for a non-serial schedule?
#450210
(1) How to launch an attack of stack and buffer overflow?
#450211
阿摩線上測驗
登入
阿摩線上測驗
登入