Class Notes (836,374)
United States (324,483)
CSC 005 (17)
Lecture 14

CSC 005 Lecture 14: Lecture 14

2 Pages
Unlock Document

Computer Science (CSC)
CSC 005
Dennis Mirante

COMPUTER SCIENCE 005 OVERVIEW (42517) Partition Selection Algorithms First fit: allocates to the first partition big enough to hold it. Best fit: allocates to the smallest needed to hold it. Worst fit: allocates to the biggest number that can hold it. Paged Memory Management Processes divided into fixedsized pages and stored in frames when loaded. Frame: fixedsize portion of main memory that holds a process page. Page: fixedsize portion of a process stored into a memory frame. *** Frame and page are the same size *** Offset: remainder of the address divided by the page size. New logical address is mapped to physical address with the help of the page map table (PMT). Demand paging: pages are brought into memory on demand. Page swap: Bringing a page from the secondary memory, which often causes another page to be written back into secondary memory. Virtual memory: no restrictions on the size of a program. An entire process doesnt have to be in memory at the same time.
More Less

Related notes for CSC 005

Log In


Join OneClass

Access over 10 million pages of study
documents for 1.3 million courses.

Sign up

Join to view


By registering, I agree to the Terms and Privacy Policies
Already have an account?
Just a few more details

So we can recommend you notes for your school.

Reset Password

Please enter below the email address you registered with and we will send you a link to reset your password.

Add your courses

Get notes from the top students in your class.