Award Date
December 2018
Degree Type
Thesis
Degree Name
Master of Science in Computer Science
Department
Computer Science
First Committee Member
Wolfgang Bein
Second Committee Member
Lawrence L. Larmore
Third Committee Member
Laxmi Gewali
Fourth Committee Member
Venkatesan Muthukumar
Number of Pages
80
Abstract
We consider two devices, which has states ON and OFF. In the ON state, the devices use their full power whereas in the OFF state the devices consume no energy but a constant cost is associated with switching back to ON. Such two devices are configured with different run and power-up costs on which a sequence of jobs must be processed. The object is to minimize the cost. Such systems are widely used to conserve energy, for example, to speed scale CPUs, to control data centers, or to manage renewable energy.
The problems are studied in the framework of online competitive analysis and we analyze a number of online algorithm and give lower bounds. The objective of the algorithm is to optimize the budget and analyzing how effectively it works.
Keywords
competitive analysis; energy efficient algorithm; green computing; online algorithm; power down problem; two machine scheduling problem
Disciplines
Computer Sciences
File Format
Degree Grantor
University of Nevada, Las Vegas
Language
English
Repository Citation
Moitra, Madhurupa, "Scheduling Two Machines with Dissimilar Costs" (2018). UNLV Theses, Dissertations, Professional Papers, and Capstones. 3507.
http://dx.doi.org/10.34917/14279658
Rights
IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/