1. A system for partitioning a call center having N agents associated with M agent-groups, for computation by K computational nodes, the system comprising: a processor; and a non-transitory physical medium, wherein the medium has instructions stored thereon that, when executed by the processor, causes the processor to: assign each agent of the N agents as a vertex in a hypergraph; assign each agent group of the M agent groups as a hyper-edge in the hypergraph; apply a hypergraph partitioning algorithm configured to partition the N agents and M groups among the K nodes with a hypergraph cost function configured to balance load distribution among the nodes and minimize traffic between the nodes; map each agent and group as an object O to one of the K nodes by a Hash function H:O→[1,K], such that each node H(O) is an owner for the object O; and for each agent A, compute agent aggregates AA_1,. .. , AA_P locally by the associated owner node H(A).