Fair Scheduling: Difference between revisions
Jump to navigation
Jump to search
| Line 2: | Line 2: | ||
* [[Job Scheduling]] | * [[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. | 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.