Výsledky vyhledávání - "shared memory parallel algorithm"

A Shared-Memory Parallel Algorithm for Updating Single-Source Shortest Paths in Large Dynamic Networks Autor Srinivasan, Sriram, Riazi, Sara, Norris, Boyana, Das, Sajal K., Bhowmick, Sanjukta

“…Computing the single-source shortest path (SSSP) is one of the fundamental graph algorithms, and is used in many applications. Here, we focus on computing SSSP…”
Získat plný text

Hybrid image classification and parameter selection using a shared memory parallel algorithm Autor Phillips, Rhonda D., Watson, Layne T., Wynne, Randolph H.

“…This work presents a shared memory parallel version of the hybrid classification algorithm IGSCR (iterative guided spectral class rejection) to facilitate the…”
Získat plný text

A Parallel Algorithm Template for Updating Single-Source Shortest Paths in Large-Scale Dynamic Networks Autor Khanda, Arindam, Srinivasan, Sriram, Bhowmick, Sanjukta, Norris, Boyana, Das, Sajal K.

“…The Single Source Shortest Path (SSSP) problem is a classic graph theory problem that arises frequently in various practical scenarios; hence, many parallel…”
Získat plný text

Joint direct and transposed sparse matrix‐vector multiplication for multithreaded CPUs Autor Kozický, Claudio, Šimeček, Ivan

“…Repeatedly performing sparse matrix‐vector multiplication (SpMV) followed by transposed sparse matrix‐vector multiplication (SpMTV) with the same matrix is a…”
Získat plný text

A GPU Parallel Algorithm for Computing Morse-Smale Complexes Autor Subhash, Varshini, Pandey, Karran, Natarajan, Vijay

“…The Morse-Smale complex is a well studied topological structure that represents the gradient flow behavior between critical points of a scalar function. It…”
Získat plný text

Shared-Memory Parallel Maximal Biclique Enumeration Autor Das, Apurba, Tirthapura, Srikanta

“…We present shared memory parallel algorithms for maximal biclique enumeration (MBE), the task of enumerating all complete dense subgraphs…”
Získat plný text

A Work-Efficient Parallel Sparse Matrix-Sparse Vector Multiplication Algorithm Autor Azad, Ariful, Buluc, Aydin

“…We design and develop a work-efficient multithreaded algorithm for sparse matrix-sparse vector multiplication (SpMSpV) where the matrix, the input vector, and…”
Získat plný text

A Shared Memory Parallel Algorithm for Logic Synthesis Autor Chieng-Fai Lim, Banerjee, P., De, K., Muroga, S.

Získat plný text

Spectral Graph Partitioning Using Geodesic Distance-based Projection Autor Futamura, Yasunori, Wakaki, Ryota, Sakurai, Tetsuya

“…The graph partitioning problem is one of the most fundamental combinatorial problems with a wide variety of applications. In this paper, we propose an…”
Získat plný text

Shared-Memory Parallel Algorithms for Community Detection in Dynamic Graphs Autor Sahu, Subhajit, Kothapalli, Kishore, Banerjee, Dip Sankar

“…Community detection is the problem of identifying natural divisions in networks. A relevant challenge in this problem is to find communities on rapidly…”
Získat plný text

Shared-Memory Parallel Algorithms for Fully Dynamic Maintenance of 2-Connected Components Autor Haryan, Chirayu Anant, Ramakrishna, G., Kothapalli, Kishore, Banerjee, Dip Sankar

“…Finding the biconnected components of a graph has a large number of applications in many other graph problems including planarity testing, computing the…”
Získat plný text

Sequential and Shared-Memory Parallel Algorithms for Partitioned Local Depths Autor Devarakonda, Aditya, Ballard, Grey

“…In this work, we design, analyze, and optimize sequential and shared-memory parallel algorithms for partitioned local depths (PaLD…”
Získat plný text

Exploring temporal community evolution: algorithmic approaches and parallel optimization for dynamic community detection Autor Sattar, Naw Safrin, Buluc, Aydin, Ibrahim, Khaled Z., Arifuzzaman, Shaikh

“…Dynamic (temporal) graphs are a convenient mathematical abstraction for many practical complex systems including social contacts, business transactions, and…”
Získat plný text

Greed Is Good: Parallel Algorithms for Bipartite-Graph Partial Coloring on Multicore Architectures Autor Tas, Mustafa Kemal, Kaya, Kamer, Saule, Erik

“…In parallel computing, a valid graph coloring yields a lock-free processing of the colored tasks, data points, etc., without expensive synchronization…”
Získat plný text

Fast Parallel Tensor Times Same Vector for Hypergraphs Autor Shivakumar, Shruti, Amburg, Ilya, Aksoy, Sinan G., Li, Jiajia, Young, Stephen J., Aluru, Srinivas

“… We introduce the Compound Compressed Sparse Symmetric (CCSS) format, an extension of the compact CSS format for hypergraphs of varying hyperedge sizes and present a shared-memory parallel algorithm to compute S 3 TTVC…”
Získat plný text

A parallel algorithm for approximating the silhouette using a ball tree Autor Šimeček, Ivan, Kozický, Claudio

“…; it is therefore common to approximate its value. This article presents an efficient shared-memory parallel algorithm for approximating the silhouette, which uses a ball tree…”
Získat plný text

DistMILE: A Distributed Multi-Level Framework for Scalable Graph Embedding Autor He, Yuntian, Gurukar, Saket, Kousha, Pouya, Subramoni, Hari, Panda, Dhabaleswar K., Parthasarathy, Srinivasan

“…Scalable graph embedding on large networks is challenging because of the complexity of graph structures and limited computing resources. Recent research shows…”
Získat plný text

A Parallel Hill-Climbing Refinement Algorithm for Graph Partitioning Autor LaSalle, Dominique, Karypis, George

“… In this work we present a new shared-memory parallel algorithm for refining an existing k-way partitioning that can break out of local minima and produce high-quality partitionings…”
Získat plný text

Faster Average Case Low Memory Semi-external Construction of the Burrows–Wheeler Transform Autor Tischler, German

“…The Burrows–Wheeler transform has applications in data compression as well as full text indexing. Despite its important applications and various existing…”
Získat plný text

Fast Approximate Subgraph Counting and Enumeration Autor Slota, George M., Madduri, Kamesh

“…We present a new shared-memory parallel algorithm and implementation called FASCIA for the problems of approximate sub graph counting and sub graph enumeration…”
Získat plný text