Monday 31st October, 2011
10:00am to 11:00am
Given a set of servers with different hardware (CPU, memory and network bandwidth) and given a set of processes with different hardware requirements, how can we assign each process to a server and minimize the total cost of all the active servers? This is an "NP complete" bin packing problem. So how do we find an optimal solution in reasonable time? And what if we want to solve it in real-time? This session will walk you through the code, implemented in Drools Planner. It will compare different optimization algorithms by the total cost of their solutions. And it includes demo's of course. JBoss Drools Planner optimizes planning problems, such as employee rostering, appointment timetabling, task scheduling, vehicle routing and bin packing.
Sign in to add slides, notes or videos to this session