Scheduling Problem Notes

Scheduling Problem Notes - 1 Notes on the Online Load...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 1 Notes on the Online Load Balancing/Scheduling Algorithms Definitions and Observations If j is a job, its load is denoted r j . An input sequence of jobs is denoted by their loads = r 1 , r 2 , . . . r N The optimal algorithm that minimizes the max load in the system is denoted by OP T ( ) . Jobs are permanent (think daemons), i.e once assigned they keep executing. You can imagine multiple jobs assigned to a machine share the load. For related machines, the load (cost) of a job j on machine i is r j ( i ) = v j i . So all machines can be ranked in increasing order of cost r j ( i ) from the perspective of job j . Assume this results in the ordering M 1 , M 2 , . . . M M , i.e r j (1) > r j (2) > . . . . For identical machines, i, i = 1 . Greedy Algorithm on Identical Machines : Assign a job to the machine with lowest current load. If there are ties, break them arbitrarily. You can show that this is 2- 1 M-competitive....
View Full Document

Page1 / 2

Scheduling Problem Notes - 1 Notes on the Online Load...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online