The Job Scheduling Problem: Difference between revisions
Jump to navigation
Jump to search
(Created page with "=Internal= * Algorithms =Overview= The job scheduling problem is a canonical example for a greedy algorithm.") |
|||
| Line 4: | Line 4: | ||
=Overview= | =Overview= | ||
The job scheduling problem is a canonical example for a [[Algorithms#Greedy_Algorithms|greedy algorithm]]. | The job scheduling problem is a canonical example for a [[Algorithms#Greedy_Algorithms|greedy algorithm]]. | ||
=The Problem= | |||
Assume there is a one shared resource (a CPU) and there are jobs that must be processed bu the shared resource. Each job has two known parameters: | |||
* a weight w<sub>j</sub> or priority, which qualifies its "importance". The jobs with higher weight deserve to be processed before the jobs with lower weight. | |||
* a length ℓ<sub>j</sub> | |||
The question we need to resolve algorithmically is in what order we should sequence the job to maximize | |||
= | |||
Revision as of 19:59, 20 October 2021
Internal
Overview
The job scheduling problem is a canonical example for a greedy algorithm.
The Problem
Assume there is a one shared resource (a CPU) and there are jobs that must be processed bu the shared resource. Each job has two known parameters:
- a weight wj or priority, which qualifies its "importance". The jobs with higher weight deserve to be processed before the jobs with lower weight.
- a length ℓj
The question we need to resolve algorithmically is in what order we should sequence the job to maximize
=