Improved worst-case deterministic parallel dynamic minimum spanning forest

Tsvi Kopelowitz; Ely Porat; Yair Rosenmutter

doi:10.1145/3210377.3210403

Improved worst-case deterministic parallel dynamic minimum spanning forest

Tsvi Kopelowitz, Ely Porat, Yair Rosenmutter

Department of Computer Science

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

6 Scopus citations

Abstract

This paper gives a new deterministic algorithm for the dynamic Minimum Spanning Forest (MSF) problem in the EREW PRAM model, where the goal is to maintain a MSF of a weighted graph with n vertices and m edges while supporting edge insertions and deletions. We show that one can solve the dynamic MSF problem using O(n) processors and O(log n) worst-case update time, for a total of O(n log n) work. This improves on the work of Ferragina [IPPS 1995] which costs O(log n) worst-case update time and O(n²/³ log ^m _n ) work.

Original language	English
Title of host publication	SPAA 2018 - Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures
Publisher	Association for Computing Machinery
Pages	333-341
Number of pages	9
ISBN (Electronic)	9781450357999
DOIs	https://doi.org/10.1145/3210377.3210403
State	Published - 11 Jul 2018
Event	30th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2018 - Vienna, Austria Duration: 16 Jul 2018 → 18 Jul 2018

Publication series

Name	Annual ACM Symposium on Parallelism in Algorithms and Architectures

Conference

Conference	30th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2018
Country/Territory	Austria
City	Vienna
Period	16/07/18 → 18/07/18

Bibliographical note

Publisher Copyright:
© 2018 Association for Computing Machinery.

Access to Document

10.1145/3210377.3210403

Cite this

Kopelowitz, T., Porat, E., & Rosenmutter, Y. (2018). Improved worst-case deterministic parallel dynamic minimum spanning forest. In SPAA 2018 - Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (pp. 333-341). (Annual ACM Symposium on Parallelism in Algorithms and Architectures). Association for Computing Machinery. https://doi.org/10.1145/3210377.3210403

@inproceedings{f4de3bf24cae46c8aed74922583bf44d,

title = "Improved worst-case deterministic parallel dynamic minimum spanning forest",

abstract = "This paper gives a new deterministic algorithm for the dynamic Minimum Spanning Forest (MSF) problem in the EREW PRAM model, where the goal is to maintain a MSF of a weighted graph with n vertices and m edges while supporting edge insertions and deletions. We show that one can solve the dynamic MSF problem using O(n) processors and O(log n) worst-case update time, for a total of O(n log n) work. This improves on the work of Ferragina [IPPS 1995] which costs O(log n) worst-case update time and O(n2/3 log m n ) work.",

author = "Tsvi Kopelowitz and Ely Porat and Yair Rosenmutter",

note = "Publisher Copyright: {\textcopyright} 2018 Association for Computing Machinery.; 30th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2018 ; Conference date: 16-07-2018 Through 18-07-2018",

year = "2018",

month = jul,

day = "11",

doi = "10.1145/3210377.3210403",

language = "אנגלית",

series = "Annual ACM Symposium on Parallelism in Algorithms and Architectures",

publisher = "Association for Computing Machinery",

pages = "333--341",

booktitle = "SPAA 2018 - Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures",

}

Kopelowitz, T , Porat, E & Rosenmutter, Y 2018, Improved worst-case deterministic parallel dynamic minimum spanning forest. in SPAA 2018 - Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures. Annual ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, pp. 333-341, 30th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2018, Vienna, Austria, 16/07/18. https://doi.org/10.1145/3210377.3210403

Improved worst-case deterministic parallel dynamic minimum spanning forest. / Kopelowitz, Tsvi ; Porat, Ely; Rosenmutter, Yair.
SPAA 2018 - Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, 2018. p. 333-341 (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

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

TY - GEN

T1 - Improved worst-case deterministic parallel dynamic minimum spanning forest

AU - Kopelowitz, Tsvi

AU - Porat, Ely

AU - Rosenmutter, Yair

PY - 2018/7/11

Y1 - 2018/7/11

N2 - This paper gives a new deterministic algorithm for the dynamic Minimum Spanning Forest (MSF) problem in the EREW PRAM model, where the goal is to maintain a MSF of a weighted graph with n vertices and m edges while supporting edge insertions and deletions. We show that one can solve the dynamic MSF problem using O(n) processors and O(log n) worst-case update time, for a total of O(n log n) work. This improves on the work of Ferragina [IPPS 1995] which costs O(log n) worst-case update time and O(n2/3 log m n ) work.

AB - This paper gives a new deterministic algorithm for the dynamic Minimum Spanning Forest (MSF) problem in the EREW PRAM model, where the goal is to maintain a MSF of a weighted graph with n vertices and m edges while supporting edge insertions and deletions. We show that one can solve the dynamic MSF problem using O(n) processors and O(log n) worst-case update time, for a total of O(n log n) work. This improves on the work of Ferragina [IPPS 1995] which costs O(log n) worst-case update time and O(n2/3 log m n ) work.

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

U2 - 10.1145/3210377.3210403

DO - 10.1145/3210377.3210403

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85051122184

T3 - Annual ACM Symposium on Parallelism in Algorithms and Architectures

SP - 333

EP - 341

BT - SPAA 2018 - Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures

PB - Association for Computing Machinery

T2 - 30th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2018

Y2 - 16 July 2018 through 18 July 2018

ER -

Improved worst-case deterministic parallel dynamic minimum spanning forest

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this