Výsledky vyhľadávania - Multithreaded graph algorithms

GraphCT: Multithreaded Algorithms for Massive Graph Analysis Autor Ediger, David, Jiang, Karl, Riedy, E. Jason, Bader, David A.

“… We present GraphCT, a scalable framework for graph analysis using parallel and multithreaded algorithms on shared memory platforms…”
Získať plný text

CRONO: A Benchmark Suite for Multithreaded Graph Algorithms Executing on Futuristic Multicores Autor Ahmad, Masab, Hijaz, Farrukh, Shi, Qingchuan, Khan, Omer

“…Algorithms operating on a graph setting are known to be highly irregular and unstructured…”
Získať plný text

Codesign Lessons Learned from Implementing Graph Matching on Multithreaded Architectures Autor Halappanavar, Mahantesh, Pothen, Alex, Azad, Ariful, Manne, Fredrik, Langguth, Johannes, Khan, Arif

“…Executing irregular, data-intensive workloads on multithreaded architectures can result in performance losses and scalability problems…”
Získať plný text

A Multithreaded-BFS Algorithm for Optimizing the Graph Computation in Multicore Processing System Autor Juneja, Kapil, Khurana, Dhiraj

“…Graphs are the most complex data structure that involves heavy mathematical computations…”
Získať plný text

Graph coloring algorithms for multi-core and massively multithreaded architectures Autor Çatalyürek, Ümit V., Feo, John, Gebremedhin, Assefaw H., Halappanavar, Mahantesh, Pothen, Alex

“… ► We target multi-core platforms and a massively multithreaded system. ► We present two different kinds of multithreaded algorithms for graph coloring…”
Získať plný text

Algorithms for Balanced Graph Colorings with Applications in Parallel Computing Autor Hao Lu, Halappanavar, Mahantesh, Chavarria-Miranda, Daniel, Gebremedhin, Assefaw H., Panyala, Ajay, Kalyanaraman, Ananth

“…Graph coloring-in a generic sense-is used to identify subsets of independent tasks in parallel scientific computing applications…”
Získať plný text

Software and Algorithms for Graph Queries on Multithreaded Architectures Autor Berry, J.W., Hendrickson, B., Kahan, S., Konecny, P.

“…Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency…”
Získať plný text

Multithreaded Algorithms for Maximum Matching in Bipartite Graphs Autor Azad, A., Halappanavar, M., Rajamanickam, S., Boman, E. G., Khan, A., Pothen, A.

“…We design, implement, and evaluate algorithms for computing a matching of maximum cardinality in a bipartite graph on multicore and massively multithreaded computers…”
Získať plný text

Multithreaded Algorithms for Matching in Graphs with Application to Data Analysis in Flow Cytometry Autor Azad, A., Pothen, A.

“… We have developed several classes of multithreaded algorithms for maximum cardinality matching and achieved good speedups on three shared memory machines on a representative set of large real-world and synthetic graphs…”
Získať plný text

Graph Coloring Algorithms for Muti-core and Massively Multithreaded Architectures Autor Catalyurek, Umit, Feo, John, Gebremedhin, Assefaw, Halappanavar, Mahantesh, Pothen, Alex

“… computing, distance-1 graph coloring. We introduce two different kinds of multithreaded heuristic algorithms for the stated, NP-hard, problem…”
Získať plný text

A Novel Multithreaded Algorithm for Extracting Maximal Chordal Subgraphs Autor Halappanavar, M., Feo, J., Dempsey, K., Ali, H., Bhowmick, S.

“… In this paper, we present a novel multithreaded algorithm to extract a maximal chordal sub graph from a general graph…”
Získať plný text

On parallel push–relabel based algorithms for bipartite maximum matching Autor Langguth, J., Azad, A., Halappanavar, M., Manne, F.

“…•Competitive with the parallel Pothen–Fan algorithm. We study multithreaded push–relabel based algorithms for computing maximum cardinality matching in bipartite graphs…”
Získať plný text

Competing all-pairs shortest paths algorithms for sparse / dense graphs: implementation and comparison Autor Prihozhy, A. A., Karasik, O. N.

“… For comparison, we have taken Dijkstra's algorithm with dynamically varying binary heap, which solves the APSP prob-lem purely in parallel by repeatedly executing on all vertices of the graph…”
Získať plný text

An Unequal Caching Strategy for Shared-Memory Graph Analytics Autor Chen, YuAng, Chung, Yeh-Ching

“… When a graph analytics algorithm is multithreaded, the thread time is highly diversified, indicating an uneven work distribution…”
Získať plný text

Inexact subgraph isomorphism in MapReduce Autor Plantenga, Todd

“…Inexact subgraph matching based on type-isomorphism was introduced by Berry et al. [J. Berry, B. Hendrickson, S. Kahan, P. Konecny, Software and algorithms for graph queries on multithreaded architectures…”
Získať plný text

Fast Lagrangian Relaxation-Based Multithreaded Gate Sizing Using Simple Timing Calibrations Autor Sharma, Ankur, Chinnery, David, Reimann, Tiago, Bhardwaj, Sarvesh, Chu, Chris

“… Our gate sizer is multithreaded and is equipped with parallelization enabling techniques, namely mutual exclusion edge (MEE…”
Získať plný text

An Optimal Vector Clock Algorithm for Multithreaded Systems Autor Zheng, Xiong, Garg, Vijay

“… We give an algorithm in this paper that uses a hybrid of thread and object components. Our algorithm is guaranteed to return the minimum number of components necessary for vector clocks…”
Získať plný text

Magiclock: Scalable Detection of Potential Deadlocks in Large-Scale Multithreaded Programs Autor Yan Cai, Chan, W. K.

“… (containing no deadlock occurrence) of large-scale multithreaded programs. Magiclock iteratively eliminates removable lock dependencies before potential deadlock localization…”
Získať plný text

Parallel multithreaded IDA heuristic search: algorithm design and performance evaluation Autor Mahafzah, Basel A.

“… Based on these facts, this paper presents a parallel multithreaded approach for the well-known iterative deepening A* (IDA…”
Získať plný text

An Asynchronous Multithreaded Algorithm for the Maximum Network Flow Problem with Nonblocking Global Relabeling Heuristic Autor Hong, Bo, He, Zhengyu

“…In this paper, we present a novel asynchronous multithreaded algorithm for the maximum network flow problem…”
Získať plný text