Abstract
We consider the problem of scheduling jobs in processors with temperature constraints. In our model, unit-length jobs arrive over time, each with a deadline and a heat contribution. The objective is to maximise the total number of completed jobs while keeping the processors within a given temperature threshold. Our main result is the analysis of a large class of ‘reasonable’ algorithms. We analyse the competitive ratio of these algorithms as a function of the cooling factor of the processors. Then we present a lower bound for the problem that shows that these algorithms are optimal in the case of a single processor. We give some other lower bounds for the multiple processors case. Then we perform some computational experiments to investigate the performance of the algorithms in an average case sense, bringing some interesting observations about the performance of the algorithms with respect to the cooling factor.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
