Fair Scheduling: Difference between revisions
Jump to navigation
Jump to search
(Created page with "=Internal= * The Job Scheduling Problem =Overview=") |
|||
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
=Internal= | =Internal= | ||
* [[Job Scheduling]] | |||
* [[The_Job_Scheduling_Problem#Overview|The Job Scheduling Problem]] | * [[The_Job_Scheduling_Problem#Overview|The Job Scheduling Problem]] | ||
* [[Work Stealing]] | |||
=Overview= | =Overview= | ||
Fair scheduling is distributing the load between all available processors. Assuming there are n processors and x tasks to perform, x/n tasks are allocated to each processor. | |||
Latest revision as of 19:10, 26 February 2024
Internal
Overview
Fair scheduling is distributing the load between all available processors. Assuming there are n processors and x tasks to perform, x/n tasks are allocated to each processor.