Scheduling processes in a paged system
· Each page an instance of memory resource
· Size of a process can be expressed in pages
· Available memory known from the list of unallocated frames
· If the process s memory requirement can be fulfilled, allocate memory to the process
· Pages loaded into memory from the list of available frames
· No external fragmentation possible with paging
· Internal fragmentation possible { an average of half a page per process
· Page size considerations
_ Small page size ) More overhead in page table plus more swapping overhead
_ Large page size ) More internal fragmentation