Výsledky vyhľadávania - "distributed-memory parallel algorithms"

  1. 1

    Distributed-Memory Parallel Algorithms for Distance-2 Coloring and Related Problems in Derivative Computation Autor Bozdağ, Doruk, Çatalyürek, Ümt V., Gebremedhin, Assefaw H., Manne, Fredrik, Boman, Erik G., Özgüner, Füsun

    ISSN: 1064-8275, 1095-7197
    Vydavateľské údaje: Philadelphia Society for Industrial and Applied Mathematics 01.01.2010
    Vydané v SIAM journal on scientific computing (01.01.2010)
    “…The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater…”
    Získať plný text
    Journal Article
  2. 2

    Asynchronous Distributed-Memory Parallel Algorithms for Influence Maximization Autor Singhal, Shubhendra Pal, Hati, Souvadra, Young, Jeffrey, Sarkar, Vivek, Hayashi, Akihiro, Vuduc, Richard

    Vydavateľské údaje: IEEE 17.11.2024
    “… We propose distributed-memory parallel algorithms for the two main kernels of a state-of-the-art implementation of one IM algorithm, influence maximization via martingales (IMM…”
    Získať plný text
    Konferenčný príspevok..
  3. 3
  4. 4

    Distributed Memory Parallel Algorithms for Minimum Spanning Trees Autor Loncar, Vladmir, Skrbic, Srdjan, Balaz, Antun

    ISSN: 2078-0958
    Vydavateľské údaje: 01.01.2013
    Vydané v World Congress on Engineering (01.01.2013)
    “…Finding a minimum spanning tree of a graph is a well known problem in graph theory with many practical applications. We study serial variants of Prim's and…”
    Získať plný text
    Journal Article
  5. 5

    Fast Distributed Memory Parallel Algorithms for Finding Connected Components in Large Graphs Autor Khan, Maleq, Boddu, Sharon

    ISSN: 2573-2978
    Vydavateľské údaje: IEEE 15.12.2024
    “…Finding the connected components in a graph is a fundamental problem in graph theory and network science. A connected component in a graph is a maximal set of…”
    Získať plný text
    Konferenčný príspevok..
  6. 6

    Distributed-Memory Parallel Algorithms for Sparse Matrix and Sparse Tall-and-Skinny Matrix Multiplication Autor Ranawaka, Isuru, Hussain, Md Taufique, Block, Charles, Gerogiannis, Gerasimos, Torrellas, Josep, Azad, Ariful

    Vydavateľské údaje: IEEE 17.11.2024
    “…We consider a sparse matrix-matrix multiplication (SpGEMM) setting where one matrix is square and the other is tall and skinny. This special variant,…”
    Získať plný text
    Konferenčný príspevok..
  7. 7

    Distributed-memory parallel algorithms for generating massive scale-free networks using preferential attachment model Autor Alam, Maksudul, Khan, Maleq, Marathe, Madhav V.

    ISBN: 9781450323789, 1450323782
    ISSN: 2167-4329
    Vydavateľské údaje: New York, NY, USA ACM 17.11.2013
    “… In this paper, we present MPI-based distributed memory parallel algorithms for generating random scale-free networks using the preferential-attachment model…”
    Získať plný text
    Konferenčný príspevok..
  8. 8

    Distributed-Memory Parallel Algorithms for Sparse Matrix and Sparse Tall-and-Skinny Matrix Multiplication Autor Ranawaka, Isuru, Hussain, Md Taufique, Block, Charles, Gerogiannis, Gerasimos, Torrellas, Josep, Azad, Ariful

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 21.08.2024
    Vydané v arXiv.org (21.08.2024)
    “…We consider a sparse matrix-matrix multiplication (SpGEMM) setting where one matrix is square and the other is tall and skinny. This special variant, called…”
    Získať plný text
    Paper
  9. 9

    Shared and distributed memory parallel algorithms to solve big data problems in biological, social network and spatial domain applications Autor Sharma, Rahil

    ISBN: 9781369624137, 1369624131
    Vydavateľské údaje: ProQuest Dissertations & Theses 01.01.2016
    “…Big data refers to information which cannot be processed and analyzed using traditional approaches and tools, due to 4 V's—sheer Volume, Velocity at which data…”
    Získať plný text
    Dissertation
  10. 10

    Parallel Hierarchical Clustering using Rank-Two Nonnegative Matrix Factorization Autor Manning, Lawton, Ballard, Grey, Kannan, Ramakrishnan, Park, Haesun

    ISSN: 2640-0316
    Vydavateľské údaje: IEEE 01.12.2020
    “…Nonnegative Matrix Factorization (NMF) is an effective tool for clustering nonnegative data, either for computing a flat partitioning of a dataset or for…”
    Získať plný text
    Konferenčný príspevok..
  11. 11

    Distributed-Memory Parallel Algorithms for Matching and Coloring Autor Çatalyürek, Ümit V., Dobrian, F., Gebremedhin, A., Halappanavar, M., Pothen, A.

    ISBN: 9781612844251, 1612844251
    ISSN: 1530-2075
    Vydavateľské údaje: IEEE 01.05.2011
    “…We discuss the design and implementation of new highly-scalable distributed-memory parallel algorithms for two prototypical graph problems, edge-weighted matching and distance-1 vertex coloring…”
    Získať plný text
    Konferenčný príspevok..
  12. 12

    Task Clustering and Scheduling for Distributed Memory Parallel Algorithms Autor PALIS M. A.

    ISSN: 1045-9219
    Vydavateľské údaje: Institute of Electrical and Electronics Engineers (IEEE) 1996
    Získať plný text
    Journal Article
  13. 13

    Distributed-Memory Parallel Algorithms for Counting and Listing Triangles in Big Graphs Autor Shaikh Arifuzzaman, Khan, Maleq, Marathe, Madhav

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 16.06.2017
    Vydané v arXiv.org (16.06.2017)
    “… In this paper, we present two efficient MPI-based distributed memory parallel algorithms for counting triangles in big graphs…”
    Získať plný text
    Paper
  14. 14

    PSelInv – A distributed memory parallel algorithm for selected inversion: The non-symmetric case Autor Jacquelin, Mathias, Lin, Lin, Yang, Chao

    ISSN: 0167-8191, 1872-7336
    Vydavateľské údaje: United States Elsevier B.V 01.05.2018
    Vydané v Parallel computing (01.05.2018)
    “…•Parallel selected inversion for non-symmetric sparse matrices.•High performance implementation on distributed memory platforms.•Experiments demonstrate…”
    Získať plný text
    Journal Article
  15. 15
  16. 16

    An Asynchronous Distributed-Memory Parallel Algorithm for k-Mer Counting Autor Hati, Souvadra, Hayashi, Akihiro, Vuduc, Richard

    ISSN: 1530-2075
    Vydavateľské údaje: IEEE 03.06.2025
    “…This paper describes a new asynchronous algorithm and implementation for the problem of \boldsymbol{k} -mer counting (\text{KC}) , which concerns quantifying…”
    Získať plný text
    Konferenčný príspevok..
  17. 17

    Parallel algorithms for switching edges in heterogeneous graphs Autor Bhuiyan, Hasanuzzaman, Khan, Maleq, Chen, Jiangzhuo, Marathe, Madhav

    ISSN: 0743-7315, 1096-0848
    Vydavateľské údaje: United States Elsevier Inc 01.06.2017
    “…An edge switch is an operation on a graph (or network) where two edges are selected randomly and one of their end vertices is swapped with each other. Edge…”
    Získať plný text
    Journal Article
  18. 18

    A parallel structured banded DC algorithm for symmetric eigenvalue problems Autor Li, Shengguo, Liao, Xia, Lu, Yutong, Roman, Jose E., Yue, Xiaoqiang

    ISSN: 2524-4922, 2524-4930
    Vydavateľské údaje: Singapore Springer Nature Singapore 01.06.2023
    “…In this paper, a novel parallel structured divide-and-conquer (DC) algorithm is proposed for symmetric banded eigenvalue problems, denoted by PBSDC, which…”
    Získať plný text
    Journal Article
  19. 19

    A Message-Passing Distributed Memory Parallel Algorithm for a Dual-Code Thin Layer, Parabolized Navier-Stokes Solver Autor Abouali, O, Alishahi, M M

    ISSN: 1735-2134
    Vydavateľské údaje: 01.01.2007
    “…In this study, the results of parallelization of a 3-D dual code (Thin Layer, Parabolized Navier-Stokes solver) for solving supersonic turbulent flow around…”
    Získať plný text
    Journal Article
  20. 20

    A distributed memory parallel algorithm for the efficient computation of sensitivities of differential-algebraic systems Autor Keeping, B.R., Pantelides, C.C.

    ISSN: 0378-4754, 1872-7166
    Vydavateľské údaje: Amsterdam Elsevier B.V 1998
    “…An efficient algorithm for the evaluation of the parametric sensitivities for mixed systems of differential and algebraic equations (DAEs) on computers…”
    Získať plný text
    Journal Article