CS350 Lecture : Review Tables In the course there are some comparison between different address translations, scheduling strategies , and others. I have made a couple of tables that compare them ( advantages , disadvantages , comments )

108 views3 pages

Document Summary

Simple physical memory variable sized chunks of physical memory. Each virtual address space corresponds to a contiguous range of physical addresses management management. Have to make it be understood by the application and directly supported by mmu & os. Requires physically contiguous be physically contiguous in allocation of segments physical space. Fair - give fixed time for each thread to run. Make use of burst time and waiting time preemptive. Make use of prioritization and burst length problems. Requires calculate quantum knowledge of cpu knowledge of cpu time burst lengths burst lengths estimate. Requires knowledge of cpu burst lengths and waiting time. Replace the page that has not been used for the longest time. Track each page"s recency of us hardware to do. Sweep once looking for (0,0) page skipped if its use. If none found; look for (0,0) or bit is set (0,1) page; with cleaning use bit while looking.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Documents

Related Questions