Software Engineering White Papers

Improving Packing Algorithms for Server Consolidation

Overview Minimizing the number of servers and preparing sufficient resources are contradictory requirements in server consolidation. These requirements can be formalized as a variant of the bin packing problem, which is known to be NP-hard. The least-loaded, a load-balancing algorithm, is applied to the problem and compared to the classical First-Fit Decreasing algorithm designed to address the bin packing problem. The technique of improving the algorithms is then presented.

Further White Paper Details
PublisherNEC File FormatPDF
Date PublishedDecember 2007
FormatWhite Papers   
Topics
E4 embraces web 2.0 audience

E4 embraces web 2.0 audience

Case study: How the Channel 4's teen channel put its mind to building a community website... more

Cheat Sheet: Cloud computing

Cheat Sheet: Cloud computing

A tech storm is brewing...  more


Quick Sitemap Links: