Výsledky vyhľadávania - "distributed-memory parallel algorithms"
-
1
Distributed-Memory Parallel Algorithms for Distance-2 Coloring and Related Problems in Derivative Computation
ISSN: 1064-8275, 1095-7197Vydavateľské údaje: Philadelphia Society for Industrial and Applied Mathematics 01.01.2010Vydané 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
Asynchronous Distributed-Memory Parallel Algorithms for Influence Maximization
Vydavateľské údaje: IEEE 17.11.2024Vydané v SC24: International Conference for High Performance Computing, Networking, Storage and Analysis (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
DISTRIBUTED-MEMORY PARALLEL ALGORITHMS FOR DISTANCE-2 COLORING AND RELATED PROBLEMS IN DERIVATIVE COMPUTATION
ISSN: 1064-8275Vydavateľské údaje: Philadelphia, PA Society for Industrial and Applied Mathematics 2011Vydané v SIAM journal on scientific computing (2011)Získať plný text
Journal Article -
4
Distributed Memory Parallel Algorithms for Minimum Spanning Trees
ISSN: 2078-0958Vydavateľské údaje: 01.01.2013Vydané 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
Fast Distributed Memory Parallel Algorithms for Finding Connected Components in Large Graphs
ISSN: 2573-2978Vydavateľské údaje: IEEE 15.12.2024Vydané v IEEE International Conference on Big Data (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
Distributed-Memory Parallel Algorithms for Sparse Matrix and Sparse Tall-and-Skinny Matrix Multiplication
Vydavateľské údaje: IEEE 17.11.2024Vydané v SC24: International Conference for High Performance Computing, Networking, Storage and Analysis (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
Distributed-memory parallel algorithms for generating massive scale-free networks using preferential attachment model
ISBN: 9781450323789, 1450323782ISSN: 2167-4329Vydavateľské údaje: New York, NY, USA ACM 17.11.2013Vydané v 2013 SC - International Conference for High Performance Computing, Networking, Storage and Analysis (SC) (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
Distributed-Memory Parallel Algorithms for Sparse Matrix and Sparse Tall-and-Skinny Matrix Multiplication
ISSN: 2331-8422Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 21.08.2024Vydané 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
Shared and distributed memory parallel algorithms to solve big data problems in biological, social network and spatial domain applications
ISBN: 9781369624137, 1369624131Vydavateľ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
Parallel Hierarchical Clustering using Rank-Two Nonnegative Matrix Factorization
ISSN: 2640-0316Vydavateľské údaje: IEEE 01.12.2020Vydané v Proceedings - International Conference on High Performance Computing (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
Distributed-Memory Parallel Algorithms for Matching and Coloring
ISBN: 9781612844251, 1612844251ISSN: 1530-2075Vydavateľské údaje: IEEE 01.05.2011Vydané v 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum (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
Task Clustering and Scheduling for Distributed Memory Parallel Algorithms
ISSN: 1045-9219Vydavateľské údaje: Institute of Electrical and Electronics Engineers (IEEE) 1996Vydané v IEEE Trans. Parallel and Distributed Systems (1996)Získať plný text
Journal Article -
13
Distributed-Memory Parallel Algorithms for Counting and Listing Triangles in Big Graphs
ISSN: 2331-8422Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 16.06.2017Vydané 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
PSelInv – A distributed memory parallel algorithm for selected inversion: The non-symmetric case
ISSN: 0167-8191, 1872-7336Vydavateľské údaje: United States Elsevier B.V 01.05.2018Vydané 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
PSelInv – A distributed memory parallel algorithm for selected inversion: The non-symmetric case
ISSN: 0167-8191, 1872-7336Vydavateľské údaje: Netherlands Elsevier 01.05.2018Vydané v Parallel computing (01.05.2018)Získať plný text
Journal Article -
16
An Asynchronous Distributed-Memory Parallel Algorithm for k-Mer Counting
ISSN: 1530-2075Vydavateľské údaje: IEEE 03.06.2025Vydané v Proceedings - IEEE International Parallel and Distributed Processing Symposium (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
Parallel algorithms for switching edges in heterogeneous graphs
ISSN: 0743-7315, 1096-0848Vydavateľské údaje: United States Elsevier Inc 01.06.2017Vydané v Journal of parallel and distributed computing (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
A parallel structured banded DC algorithm for symmetric eigenvalue problems
ISSN: 2524-4922, 2524-4930Vydavateľské údaje: Singapore Springer Nature Singapore 01.06.2023Vydané v CCF transactions on high performance computing (Online) (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
A Message-Passing Distributed Memory Parallel Algorithm for a Dual-Code Thin Layer, Parabolized Navier-Stokes Solver
ISSN: 1735-2134Vydavateľské údaje: 01.01.2007Vydané v Journal of Aerospace Science and Technology (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
A distributed memory parallel algorithm for the efficient computation of sensitivities of differential-algebraic systems
ISSN: 0378-4754, 1872-7166Vydavateľské údaje: Amsterdam Elsevier B.V 1998Vydané v Mathematics and computers in simulation (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

