Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in OS and Networks
Constraint Satisfaction Problem: A Generic Scheduler, Ben Carpenter, Brent Weichel, Jeremy Straub, Eunjin Kim
Constraint Satisfaction Problem: A Generic Scheduler, Ben Carpenter, Brent Weichel, Jeremy Straub, Eunjin Kim
Jeremy Straub
The task was to create a scheduler that would create a schedule that gets as many of the tasks done as possible while maximizing the total value of the tasks performed. Each task was assigned a value, a priority, and a duration. Each task also had certain times that they could be run, so they couldn’t just be run at any point where they fit. We decided that in order to get a more accurate ordering for the process, we would take the value divided by the duration that way we were less likely to skip over processes that ran …