Lecture8 - COP 5611 Operating Systems Spring 2010 Dan C Marinescu Office HEC 439 B Office hours M-Wd 2:00-3:00 PM Lecture 8 Last time Thread

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon
COP 5611 Operating Systems Spring 2010 Dan C. Marinescu Office: HEC 439 B Office hours: M-Wd 2:00-3:00 PM
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 Lecture 8 ± Last time: Thread coordination and scheduling ± Today: ² Multi-level memories ² I/O bottleneck ± Next Time: ² Chapter 8. Network as a System and as a System Component
Background image of page 2
3 Multi-level memories ± In the following hierarchy the amount of storage and the access time increase at the same time ² CPU registers ² L1 cache ² L2 cache ² Main memory ² Magnetic disk ² Mass storage systems ² Remote storage ± Memory management schemes Î where the data is placed through this hierarchy ² Manual Æ left to the user ² Automatic Æ based on memory virtualization ± More effective ± Easier to use
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
4
Background image of page 4
5 Forms of memory virtualization ± Memory-mapped files Æ in UNIX mmap ± Copy on write Æ when several threads use the same data map the page holding the data and store the data only once in memory. This works as long all the threads only READ the data. If one of the threads carries out a WRITE then the virtual memory handling should generate an exception and data pages to be remapped so that each thread gets its only copy of the page. ± On-demand zero filled pages Æ Instead of allocating zero-filled pages on RAM or on the disk the VM manager maps these pages without READ or WRITE permissions. When a thread attempts to actually READ or WRITE to such pages then an exception is generated and the VM manager allocates the page dynamically. ± Virtual-shared memory Æ Several threads on multiple systems share the same address space. When a thread references a page that is not in its local memory the local VM manager fetches the page over the network and the remote VM manager un-maps the page.
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
6 Multi-level memory management and virtual memory ± Two level memory system: RAM + disk. ² Each page of an address space has an image in the disk ² The RAM consists of blocks. ² READ and WRITE from RAM Æ controlled by the VM manager ² GET and PUT from disk Æ controlled by a multi-level memory manager ± Old design philosophy: integrate the two to reduce the instruction count ± New approach – modular organization ² Implement the VM manager (VMM) in hardware. Translates virtual addresses into physical addresses. ² Implement the multi-level memory manager (MLMM) in the kernel in software. It transfers pages back and forth between RAM and the disk
Background image of page 6
7 The modular design ± VM attempts to translate the virtual memory address to a physical memory address ± If the page is not in main memory VM generates a page-fault exception . ± The exception handler uses a SEND to send to an MLMM port the page number ± The SEND invokes ADVANCE which wakes up a thread of MLMM ± The MMLM invokes AWAIT on behalf of the thread interrupted due to the page fault.
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 8
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 05/12/2010 for the course CS COP5611 taught by Professor Dancristianmarinescu during the Spring '10 term at University of Central Florida.

Page1 / 52

Lecture8 - COP 5611 Operating Systems Spring 2010 Dan C Marinescu Office HEC 439 B Office hours M-Wd 2:00-3:00 PM Lecture 8 Last time Thread

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online