Application of Graph Sparsification in Developing Parallel Algorithms for Updating Connected Components

Sriram Srinivasan, Sanjukta Bhowmick, Sajal Das

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Analyzing large dynamic networks is an importantproblem with applications in a wide range of disciplines. A keyoperation is updating the network properties as its topologychanges. In this paper we present graph sparsification as anefficient abstraction for updating the properties of dynamic networks. We demonstrate the applicability of graph sparsificationin updating the connected components in random and scalefreenetworks on shared memory systems. Our results showthat the updating is scalable (10X on 16 processors for largernetworks). To the best of our knowledge this is the first parallelimplementation of graph sparsification. Based on these initialresults, we discuss how the current implementation can befurther improved and how graph sparsification can be appliedto updating other network properties.

Original languageEnglish (US)
Title of host publicationProceedings - 2016 IEEE 30th International Parallel and Distributed Processing Symposium, IPDPS 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages885-891
Number of pages7
ISBN (Electronic)9781509021406
DOIs
StatePublished - Jul 18 2016
Event30th IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2016 - Chicago, United States
Duration: May 23 2016May 27 2016

Publication series

NameProceedings - 2016 IEEE 30th International Parallel and Distributed Processing Symposium, IPDPS 2016

Other

Other30th IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2016
CountryUnited States
CityChicago
Period5/23/165/27/16

Fingerprint

Parallel algorithms
Data storage equipment

Keywords

  • Dynamic networks
  • Graph sparsification

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Srinivasan, S., Bhowmick, S., & Das, S. (2016). Application of Graph Sparsification in Developing Parallel Algorithms for Updating Connected Components. In Proceedings - 2016 IEEE 30th International Parallel and Distributed Processing Symposium, IPDPS 2016 (pp. 885-891). [7529954] (Proceedings - 2016 IEEE 30th International Parallel and Distributed Processing Symposium, IPDPS 2016). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/IPDPSW.2016.180

Application of Graph Sparsification in Developing Parallel Algorithms for Updating Connected Components. / Srinivasan, Sriram; Bhowmick, Sanjukta; Das, Sajal.

Proceedings - 2016 IEEE 30th International Parallel and Distributed Processing Symposium, IPDPS 2016. Institute of Electrical and Electronics Engineers Inc., 2016. p. 885-891 7529954 (Proceedings - 2016 IEEE 30th International Parallel and Distributed Processing Symposium, IPDPS 2016).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Srinivasan, S, Bhowmick, S & Das, S 2016, Application of Graph Sparsification in Developing Parallel Algorithms for Updating Connected Components. in Proceedings - 2016 IEEE 30th International Parallel and Distributed Processing Symposium, IPDPS 2016., 7529954, Proceedings - 2016 IEEE 30th International Parallel and Distributed Processing Symposium, IPDPS 2016, Institute of Electrical and Electronics Engineers Inc., pp. 885-891, 30th IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2016, Chicago, United States, 5/23/16. https://doi.org/10.1109/IPDPSW.2016.180
Srinivasan S, Bhowmick S, Das S. Application of Graph Sparsification in Developing Parallel Algorithms for Updating Connected Components. In Proceedings - 2016 IEEE 30th International Parallel and Distributed Processing Symposium, IPDPS 2016. Institute of Electrical and Electronics Engineers Inc. 2016. p. 885-891. 7529954. (Proceedings - 2016 IEEE 30th International Parallel and Distributed Processing Symposium, IPDPS 2016). https://doi.org/10.1109/IPDPSW.2016.180
Srinivasan, Sriram ; Bhowmick, Sanjukta ; Das, Sajal. / Application of Graph Sparsification in Developing Parallel Algorithms for Updating Connected Components. Proceedings - 2016 IEEE 30th International Parallel and Distributed Processing Symposium, IPDPS 2016. Institute of Electrical and Electronics Engineers Inc., 2016. pp. 885-891 (Proceedings - 2016 IEEE 30th International Parallel and Distributed Processing Symposium, IPDPS 2016).
@inproceedings{df1a2e36c9484c3e9111bfe2476548af,
title = "Application of Graph Sparsification in Developing Parallel Algorithms for Updating Connected Components",
abstract = "Analyzing large dynamic networks is an importantproblem with applications in a wide range of disciplines. A keyoperation is updating the network properties as its topologychanges. In this paper we present graph sparsification as anefficient abstraction for updating the properties of dynamic networks. We demonstrate the applicability of graph sparsificationin updating the connected components in random and scalefreenetworks on shared memory systems. Our results showthat the updating is scalable (10X on 16 processors for largernetworks). To the best of our knowledge this is the first parallelimplementation of graph sparsification. Based on these initialresults, we discuss how the current implementation can befurther improved and how graph sparsification can be appliedto updating other network properties.",
keywords = "Dynamic networks, Graph sparsification",
author = "Sriram Srinivasan and Sanjukta Bhowmick and Sajal Das",
year = "2016",
month = "7",
day = "18",
doi = "10.1109/IPDPSW.2016.180",
language = "English (US)",
series = "Proceedings - 2016 IEEE 30th International Parallel and Distributed Processing Symposium, IPDPS 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "885--891",
booktitle = "Proceedings - 2016 IEEE 30th International Parallel and Distributed Processing Symposium, IPDPS 2016",

}

TY - GEN

T1 - Application of Graph Sparsification in Developing Parallel Algorithms for Updating Connected Components

AU - Srinivasan, Sriram

AU - Bhowmick, Sanjukta

AU - Das, Sajal

PY - 2016/7/18

Y1 - 2016/7/18

N2 - Analyzing large dynamic networks is an importantproblem with applications in a wide range of disciplines. A keyoperation is updating the network properties as its topologychanges. In this paper we present graph sparsification as anefficient abstraction for updating the properties of dynamic networks. We demonstrate the applicability of graph sparsificationin updating the connected components in random and scalefreenetworks on shared memory systems. Our results showthat the updating is scalable (10X on 16 processors for largernetworks). To the best of our knowledge this is the first parallelimplementation of graph sparsification. Based on these initialresults, we discuss how the current implementation can befurther improved and how graph sparsification can be appliedto updating other network properties.

AB - Analyzing large dynamic networks is an importantproblem with applications in a wide range of disciplines. A keyoperation is updating the network properties as its topologychanges. In this paper we present graph sparsification as anefficient abstraction for updating the properties of dynamic networks. We demonstrate the applicability of graph sparsificationin updating the connected components in random and scalefreenetworks on shared memory systems. Our results showthat the updating is scalable (10X on 16 processors for largernetworks). To the best of our knowledge this is the first parallelimplementation of graph sparsification. Based on these initialresults, we discuss how the current implementation can befurther improved and how graph sparsification can be appliedto updating other network properties.

KW - Dynamic networks

KW - Graph sparsification

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

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

U2 - 10.1109/IPDPSW.2016.180

DO - 10.1109/IPDPSW.2016.180

M3 - Conference contribution

AN - SCOPUS:84991738032

T3 - Proceedings - 2016 IEEE 30th International Parallel and Distributed Processing Symposium, IPDPS 2016

SP - 885

EP - 891

BT - Proceedings - 2016 IEEE 30th International Parallel and Distributed Processing Symposium, IPDPS 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -