Title :
Iterative partitioning scheme for distributed simulation of dynamic networks
Author :
Kurve, A. ; Griffin, C. ; Kesidis, G.
Author_Institution :
EE Dept., Pennsylvania State Univ., University Park, PA, USA
Abstract :
Network model partitioning is a key component of distributed network simulations. Simulations slow down considerably due to inequitable load balancing and heavy inter-host communication leading to unbounded synchronization overhead. Also, regularly refreshing the node partition is necessary due to to the dynamic nature of simulation load and event generation. In this paper, we propose a distributed method for network partitioning which includes a coarse initial partitioning followed by iterative improvements in the partition. We suggest a sparse-cut based method to identify nodes eligible for exchange.
Keywords :
digital simulation; iterative methods; parallel processing; resource allocation; synchronisation; coarse initial partitioning; distributed method; distributed network simulation load; dynamic network model partitioning; event generation; heavy interhost communication; inequitable load balancing; iterative partitioning scheme; node partition; sparse-cut based method; unbounded synchronization; Clustering algorithms; Computational modeling; Heuristic algorithms; Load management; Load modeling; Partitioning algorithms; Program processors; distributed systems; dynamic network simulation; graph partitioning; parallel simulation;
Conference_Titel :
Computer Aided Modeling and Design of Communication Links and Networks (CAMAD), 2011 IEEE 16th International Workshop on
Conference_Location :
Kyoto
Print_ISBN :
978-1-61284-281-3
Electronic_ISBN :
978-1-61284-280-6
DOI :
10.1109/CAMAD.2011.5941125
