Operating Systems management techniques: Difference between revisions
Mr. MacKenty (talk | contribs) No edit summary |
Mr. MacKenty (talk | contribs) |
||
| Line 9: | Line 9: | ||
! Technique !! Description | ! Technique !! Description | ||
|- | |- | ||
| scheduling || | | scheduling || Scheduling is the method by which work is assigned to resources that complete the work.<ref>https://en.wikipedia.org/wiki/Scheduling_(computing)</ref>. There are many different scheduling strategies. The main purposes of scheduling algorithms are to minimize resource starvation and to ensure fairness amongst the parties utilizing the resources<ref>https://en.wikipedia.org/wiki/Scheduling_(computing)#Scheduling_disciplines</ref> | ||
|- | |- | ||
| policies || foo | | policies || foo | ||
| Line 23: | Line 23: | ||
| polling || foo | | polling || foo | ||
|} | |} | ||
== Standards == | == Standards == | ||
Revision as of 22:30, 6 December 2017
Resource Management[1]
We have learned [2]
OS resource management techniques[edit]
| Technique | Description |
|---|---|
| scheduling | Scheduling is the method by which work is assigned to resources that complete the work.[3]. There are many different scheduling strategies. The main purposes of scheduling algorithms are to minimize resource starvation and to ensure fairness amongst the parties utilizing the resources[4] |
| policies | foo |
| multitasking | foo |
| virtual memory | foo |
| paging | foo |
| interrupt | foo |
| polling | foo |
Standards[edit]
- Outline OS resource management techniques: scheduling, policies, multitasking, virtual memory, paging, interrupt, polling.