Iterative partitioning scheme for distributed simulation of dynamic networks

A. Kurve; C. Griffin; G. Kesidis

doi:10.1109/CAMAD.2011.5941125

Iterative partitioning scheme for distributed simulation of dynamic networks

A. Kurve, C. Griffin, G. Kesidis

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Scopus citations

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.

Original language	English (US)
Title of host publication	2011 IEEE 16th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, CAMAD 2011
Pages	92-96
Number of pages	5
DOIs	https://doi.org/10.1109/CAMAD.2011.5941125
State	Published - 2011
Event	2011 IEEE 16th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, CAMAD 2011 - Kyoto, Japan Duration: Jun 10 2011 → Jun 11 2011

Publication series

Name	2011 IEEE 16th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, CAMAD 2011

Other

Other	2011 IEEE 16th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, CAMAD 2011
Country/Territory	Japan
City	Kyoto
Period	6/10/11 → 6/11/11

All Science Journal Classification (ASJC) codes

Computer Graphics and Computer-Aided Design
Computer Networks and Communications
Computer Science Applications

Access to Document

10.1109/CAMAD.2011.5941125

Cite this

Kurve, A., Griffin, C., & Kesidis, G. (2011). Iterative partitioning scheme for distributed simulation of dynamic networks. In 2011 IEEE 16th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, CAMAD 2011 (pp. 92-96). Article 5941125 (2011 IEEE 16th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, CAMAD 2011). https://doi.org/10.1109/CAMAD.2011.5941125

Kurve, A. ; Griffin, C. ; Kesidis, G. / Iterative partitioning scheme for distributed simulation of dynamic networks. 2011 IEEE 16th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, CAMAD 2011. 2011. pp. 92-96 (2011 IEEE 16th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, CAMAD 2011).

@inproceedings{b5adf6396b364086b8a04fe1fd6221f5,

title = "Iterative partitioning scheme for distributed simulation of dynamic networks",

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.",

author = "A. Kurve and C. Griffin and G. Kesidis",

year = "2011",

doi = "10.1109/CAMAD.2011.5941125",

language = "English (US)",

isbn = "9781612842820",

series = "2011 IEEE 16th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, CAMAD 2011",

pages = "92--96",

booktitle = "2011 IEEE 16th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, CAMAD 2011",

note = "2011 IEEE 16th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, CAMAD 2011 ; Conference date: 10-06-2011 Through 11-06-2011",

}

Kurve, A, Griffin, C & Kesidis, G 2011, Iterative partitioning scheme for distributed simulation of dynamic networks. in 2011 IEEE 16th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, CAMAD 2011., 5941125, 2011 IEEE 16th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, CAMAD 2011, pp. 92-96, 2011 IEEE 16th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, CAMAD 2011, Kyoto, Japan, 6/10/11. https://doi.org/10.1109/CAMAD.2011.5941125

Iterative partitioning scheme for distributed simulation of dynamic networks. / Kurve, A.; Griffin, C.; Kesidis, G.
2011 IEEE 16th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, CAMAD 2011. 2011. p. 92-96 5941125 (2011 IEEE 16th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, CAMAD 2011).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Iterative partitioning scheme for distributed simulation of dynamic networks

AU - Kurve, A.

AU - Griffin, C.

AU - Kesidis, G.

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=79961139213&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79961139213&partnerID=8YFLogxK

U2 - 10.1109/CAMAD.2011.5941125

DO - 10.1109/CAMAD.2011.5941125

M3 - Conference contribution

AN - SCOPUS:79961139213

SN - 9781612842820

T3 - 2011 IEEE 16th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, CAMAD 2011

SP - 92

EP - 96

BT - 2011 IEEE 16th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, CAMAD 2011

T2 - 2011 IEEE 16th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, CAMAD 2011

Y2 - 10 June 2011 through 11 June 2011

ER -

Kurve A, Griffin C , Kesidis G. Iterative partitioning scheme for distributed simulation of dynamic networks. In 2011 IEEE 16th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, CAMAD 2011. 2011. p. 92-96. 5941125. (2011 IEEE 16th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, CAMAD 2011). doi: 10.1109/CAMAD.2011.5941125

Iterative partitioning scheme for distributed simulation of dynamic networks

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this