Search Results - "parallel graph algorithms"

Efficient and Scalable Parallel Graph Algorithms

Authors: Wang, Letong

Subject Terms: Computer science, Computer engineering, Graph Theory, Parallel Algorithms, Parallel Computing

File Description: application/pdf

Access URL: https://escholarship.org/uc/item/775830dx
https://escholarship.org/content/qt775830dx/qt775830dx.pdf

Algorithm 1037: SuiteSparse:GraphBLAS: Parallel Graph Algorithms in the Language of Sparse Linear Algebra

Authors: Timothy A. Davis

Source: ACM Transactions on Mathematical Software. 49:1-30

Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, 0101 mathematics, 01 natural sciences

Dynamic constant time parallel graph algorithms with sub-linear work

Authors: Schmidt, Jonas Schwentick, Thomas Jonas Schmidt and Thomas Schwentick

Contributors: Schmidt, Jonas Schwentick, Thomas Jonas Schmidt and Thomas Schwentick

Subject Terms: FOS: Computer and information sciences, Bipartiteness, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Dynamic parallel algorithms, Undirected connectivity

File Description: application/pdf

Access URL: http://arxiv.org/abs/2307.10107
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.80

Parallel graph algorithms in constant adaptive rounds: theory meets practice

Authors: Behnezhad, Soheil Dhulipala, Laxman Esfandiari, Hossein et al.

Contributors: Behnezhad, Soheil Dhulipala, Laxman Esfandiari, Hossein et al.

Source: VLDB Endowment

Subject Terms: FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

File Description: application/pdf

Access URL: https://dspace.mit.edu/bitstream/1721.1/136701/1/3424573.3424579.pdf
http://arxiv.org/abs/2009.11552
http://dblp.uni-trier.de/db/journals/corr/corr2009.html#abs-2009-11552
https://dblp.uni-trier.de/db/journals/pvldb/pvldb13.html#BehnezhadDELMS20
https://doi.org/10.14778/3424573.3424579
https://dl.acm.org/doi/abs/10.14778/3424573.3424579
http://www.vldb.org/pvldb/vol13/p3588-behnezhad.pdf
https://hdl.handle.net/1721.1/136701

Communication-efficient Parallel Graph Algorithms

Authors: Leiserson, Charles E. Maggs, Bruce M.

URL: https://hdl.handle.net/1721.1/149126
MIT-LCS-TM-318

Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable

Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory Dhulipala, Laxman Blelloch, Guy E et al.

Source: MIT web domain

Index Terms: Article, http://purl.org/eprint/type/JournalArticle

URL: https://hdl.handle.net/1721.1/143885
10.1145/3434393
ACM Transactions on Parallel Computing

Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable

Authors: Dhulipala, Laxman Blelloch, Guy E Shun, Julian et al.

Contributors: Dhulipala, Laxman Blelloch, Guy E Shun, Julian et al.

Source: MIT web domain

Subject Terms: FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, 1. No poverty, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

File Description: application/pdf

Access URL: https://dl.acm.org/doi/pdf/10.1145/3210377.3210414
https://dspace.mit.edu/bitstream/1721.1/135027/2/spaa2018.pdf
http://arxiv.org/abs/1805.05208
https://dl.acm.org/citation.cfm?id=3210414
https://dl.acm.org/doi/pdf/10.1145/3210377.3210414
https://dblp.uni-trier.de/db/journals/corr/corr1805.html#abs-1805-05208
http://ui.adsabs.harvard.edu/abs/2018arXiv180505208D/abstract
https://dblp.uni-trier.de/db/journals/topc/topc8.html#DhulipalaBS21
https://doi.org/10.1145/3434393
https://dl.acm.org/doi/10.1145/3434393
https://arxiv.org/pdf/1805.05208.pdf
https://arxiv.org/abs/1805.05208
https://hdl.handle.net/1721.1/135027

Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable

Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory Dhulipala, Laxman Blelloch, Guy E et al.

Source: MIT web domain

Index Terms: Article, http://purl.org/eprint/type/ConferencePaper

URL: https://hdl.handle.net/1721.1/135027
10.1145/3210377.3210414
Annual ACM Symposium on Parallelism in Algorithms and Architectures

Parallel Graph Algorithms and Building Backends with Entry Points

Authors: Juneja, Aditi Meghann Agarwal Amey Ambade et al.

Contributors: Juneja, Aditi Meghann Agarwal Amey Ambade et al.

Access URL: https://zenodo.org/records/13942266

Parallel Graph Algorithms by Blocks

Authors: Yasar, Abdurrahman Çatalyürek, Ümit V.

Parallel graph algorithms in constant adaptive rounds: theory meets practice

Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory Behnezhad, Soheil Dhulipala, Laxman et al.

Source: VLDB Endowment

Index Terms: Article, http://purl.org/eprint/type/ConferencePaper

URL: https://hdl.handle.net/1721.1/136701
10.14778/3424573.3424579

Scalable parallel graph algorithms with matrix–vector multiplication evaluated with queries

Authors: Carlos Ordonez Wellington Cabrera

Source: Distributed and Parallel Databases. 35:335-362

Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Access URL: https://dblp.uni-trier.de/db/journals/dpd/dpd35.html#CabreraO17
https://link.springer.com/content/pdf/10.1007%2Fs10619-017-7200-6.pdf
https://doi.org/10.1007/s10619-017-7200-6
https://link.springer.com/article/10.1007/s10619-017-7200-6

Julienne: A Framework for Parallel Graph Algorithms using Work-efficient Bucketing

Authors: Laxman Dhulipala Guy E. Blelloch Julian Shun

Source: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures. :293-304

Subject Terms: 13. Climate action, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, 14. Life underwater, 7. Clean energy

Access URL: https://dl.acm.org/citation.cfm?id=3087580
https://dblp.uni-trier.de/db/conf/spaa/spaa2017.html#DhulipalaBS17
https://dl.acm.org/doi/pdf/10.1145/3087556.3087580
https://doi.org/10.1145/3087556.3087580

Modular design of data-parallel graph algorithms

Authors: Dash S.K. Scholz S.-B. Christianson B.

Source: Proceedings of the 2013 International Conference on High Performance Computing and Simulation, HPCS 2013

Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Access URL: http://uhra.herts.ac.uk/bitstream/2299/13445/2/apmm2013_submission_5.pdf
https://dblp.uni-trier.de/db/conf/ieeehpcs/ieeehpcs2013.html#DashSC13
http://uhra.herts.ac.uk/bitstream/2299/13445/2/apmm2013_submission_5.pdf
https://uhra.herts.ac.uk/bitstream/handle/2299/13445/apmm2013_submission_5.pdf?sequence=2
https://ieeexplore.ieee.org/document/6641446/
https://uhra.herts.ac.uk/handle/2299/13445

An Algorithmic Approach to Communication Reduction in Parallel Graph Algorithms

Authors: Adam Fidel Nancy M. Amato Harshvardhan et al.

Source: 2015 International Conference on Parallel Architecture and Compilation (PACT). :201-212

Subject Terms: 2. Zero hunger, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Access URL: http://dblp.uni-trier.de/db/conf/IEEEpact/pact2015.html#HarshvardhanFAR15
http://ieeexplore.ieee.org/document/7429306/
https://ieeexplore.ieee.org/document/7429306/
https://dblp.uni-trier.de/db/conf/IEEEpact/pact2015.html#HarshvardhanFAR15

A Unifying Programming Model for Parallel Graph Algorithms

Authors: Andrew Lumsdaine Jeremiah J. Willcock

Source: 2015 IEEE International Parallel and Distributed Processing Symposium Workshop. :831-840

Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, 16. Peace & justice

Access URL: http://doi.ieeecomputersociety.org/10.1109/IPDPSW.2015.79
https://dblp.uni-trier.de/db/conf/ipps/ipdps2015w.html#WillcockL15

Parallel Graph Algorithms

Authors: K. Erciyes

Source: Texts in Computer Science ISBN: 9783319732343

Access URL: https://rd.springer.com/chapter/10.1007/978-3-319-73235-0_4
https://link.springer.com/chapter/10.1007/978-3-319-73235-0_4

MULTI-CORE PARALLEL GRAPH ALGORITHMS

Authors: GUO, BIN Emil, Sekerinski Computing and Software

Contributors: GUO, BIN Emil, Sekerinski Computing and Software

Subject Terms: Graph Algorithm, Core Maintenance, Graph Trimming, Parallel, Multi-Core

Access URL: http://hdl.handle.net/11375/28562

Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP: Efficient parallel graph algorithms for coarse-grained multicomputers and BSP

Authors: DEHNE F FERREIRA A CACERES E et al.

Source: Algorithmica. 33:183-200

Subject Terms: graph algorithms, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Nonnumerical algorithms, 01 natural sciences, coarse grained parallel computing

File Description: application/xml

Access URL: https://zbmath.org/1756781
https://doi.org/10.1007/s00453-001-0109-4
https://hdl.handle.net/10278/19009

Implementation of parallel graph algorithms on a massively parallel SIMD computer with virtual processing

Authors: Tsan-sheng Hsu Nathaniel Dean Vijaya Ramachandran

Source: Proceedings of 9th International Parallel Processing Symposium. :106-112

Subject Terms: 0102 computer and information sciences, 0101 mathematics, 01 natural sciences

Access URL: http://ieeexplore.ieee.org/document/395921/
https://dblp.uni-trier.de/db/conf/ipps/ipps1995.html#HsuRD95
https://doi.org/10.1109/IPPS.1995.395921
https://ieeexplore.ieee.org/document/395921/