In recent years the importance of a large-scale Agent-Based Simulation(ABS) that can handle large complex systems is increasing. We developed a large-scale ABS framework on BlueGene, which is a multi-node supercomputer. The ABS processes the agents' communications. When the number of transmissions among the agents is large, the transmission costs seriously affect the performance of the simulation. It is possible to reduce the amount of transmission among the nodes by clustering the agents which communicate heavily with each other. Assuming that an agent is a graph node, and that a data transmission between agents is a graph edge, this problem can be formulated as a Maximum-Flow and Minimum-Cut Problem. In this paper we present an efficient algorithm to find an approximate solution. Our algorithm is reliable, simple, and needs little computation. We demonstrate its beneficial effects with some experiments.

By: Toshihiro Takahashi, Hideyuki Mizuta

Published in: Proceedings of 2006 Winter Simulation Conference 2006 Piscataway, NJ IEEE Cat No 06CH37826 pp. 919-25Piscataway, NJ, , IEEE., p.919-25 in 2006

Please obtain a copy of this paper from your local library. IBM cannot distribute this paper externally.

Questions about this service can be mailed to reports@us.ibm.com .