lect21-batch-scheduling

lect21-batch-scheduling - Notes ! ! CMSC 714 Lecture 21...

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

View Full Document Right Arrow Icon
CMSC 714 Lecture 21 Batch Scheduling Alan Sussman 2 Notes ! All readings posted, except last day ! Midterm exam returned next Tuesday ! Group Project presentations in 2 weeks – need volunteers for Tuesday/Thursday – send me email ! First finish up on BOINC (and Condor) 3 Backfilling on IBM SP2 ! For space sharing on clusters, distributed memory parallel machines ! Default policy is FCFS in queuing system – causes fragmentation, so can do better by allowing later jobs in queue to bypass first job that can’t run yet because not enough nodes currently available – have to ensure not starving large jobs, and helps to be able to predict when a job will run – works better if users give runtime estimate for their job, in addition to number of nodes desired • used in EASY scheduler algorithm from Argonne • EASY only allows jobs to move up in queue if don’t delay the first queued job • paper shows that can lead to unbounded delay if a job has unbounded execution time (doesn’t delay first job in
Background image of page 1

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

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

Page1 / 2

lect21-batch-scheduling - Notes ! ! CMSC 714 Lecture 21...

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