Programming (Mathematics), Client/server computing -- Management, Web servers, UNIX (Computer file), Operations research
This project was undertaken to find an optimal number and type mix of UNIX servers to run a series of applications. Given a set of servers to choose from, a mathematical programming optimization model was developed to determine the lowest server cost while maintaining an expected service level. A full solution was developed however the requirements exceeded the capabilities of the solver that was used. The model was simplified until a solution could be determined. The results obtained were from a reduced data set and were not suitable for the full solution. The full model should be solvable using a more advanced solver.
In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/ This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).
Angel, David; Anankavanich, Navarat; Piyakulchaidej, Thuchchai; Pipugsmoot, Vithan; and Sumitsawan, Wissanu, "Server Consolidation Using Mathematical Programming" (2001). Engineering and Technology Management Student Projects. 1886.