unix系统学习（UNIX learning system）.docVIP

unix系统学习（UNIX learning system） A1. Investigate the CPU scheduling (or process scheduling) algorithm used by Windows XP. Three (3) the following points are true? The combination of 1. Windows XP round robin algorithm and priority plan. 2. of each process (or thread) is given a randomly generated time (a quantum) into CPU. 3. once the quantum has expired, the Windows XP interrupt process and start another process with the same priority. 4. Windows XP approved 32 different priority No. 0 to 31. These priority levels are similar with memory protection related Intel processor privilege level. 5. priorities are divided into two classes: mutable and real-time. The level of 0-15 is reserved for real-time class, and the level of 16-31 is reserved for variable class. 6. kernel to dynamically determine the magnitude of the priority boost; for example, a process waiting for user input may get a priority boost of 1, when the process of disk operation might have its priority boosted by 6. A basic priority 7. each user process may be adjusted (EPS) if necessary for a quantum, and it falls by only a priority in each subsequent quantum until it reaches its base priority. 8. Windows XP non-preemptive book. 9. for multi processor systems, Windows XP using asymmetric multiprocessing. 10. Windows XP, a real-time thread will begin in special time. A2. Memory management - investigate how the Windows XP virtual memory manager to implement paging. Three (3) the following points are true? The virtual address space is divided into 1. process was selected as a legitimate KB page 8 (live in physical memory) or invalid (live in disk). 2. when a process references an invalid page page error. The virtual memory manager (VMM) to exchange the requested page into any available memory frame. 3. if the memory is full, VMM uses FIFO paging algorithm to get space for the requested page. This is done by taking use of the process from the page more than their minimum set size. 4. VMM does not allow any pro