Suchergebnisse - Multithreaded graph algorithms
-
1
GraphCT: Multithreaded Algorithms for Massive Graph Analysis
ISSN: 1045-9219, 1558-2183Veröffentlicht: New York IEEE 01.11.2013Veröffentlicht in IEEE transactions on parallel and distributed systems (01.11.2013)“… We present GraphCT, a scalable framework for graph analysis using parallel and multithreaded algorithms on shared memory platforms …”
Volltext
Journal Article -
2
CRONO: A Benchmark Suite for Multithreaded Graph Algorithms Executing on Futuristic Multicores
Veröffentlicht: IEEE 01.10.2015Veröffentlicht in 2015 IEEE International Symposium on Workload Characterization (01.10.2015)“… Algorithms operating on a graph setting are known to be highly irregular and unstructured …”
Volltext
Tagungsbericht -
3
Codesign Lessons Learned from Implementing Graph Matching on Multithreaded Architectures
ISSN: 0018-9162, 1558-0814Veröffentlicht: New York IEEE 01.08.2015Veröffentlicht in Computer (Long Beach, Calif.) (01.08.2015)“… Executing irregular, data-intensive workloads on multithreaded architectures can result in performance losses and scalability problems …”
Volltext
Journal Article -
4
A Multithreaded-BFS Algorithm for Optimizing the Graph Computation in Multicore Processing System
ISSN: 1877-0509, 1877-0509Veröffentlicht: Elsevier B.V 2024Veröffentlicht in Procedia computer science (2024)“… Graphs are the most complex data structure that involves heavy mathematical computations …”
Volltext
Journal Article -
5
Graph coloring algorithms for multi-core and massively multithreaded architectures
ISSN: 0167-8191, 1872-7336Veröffentlicht: Elsevier B.V 01.10.2012Veröffentlicht in Parallel computing (01.10.2012)“… ► We target multi-core platforms and a massively multithreaded system. ► We present two different kinds of multithreaded algorithms for graph coloring …”
Volltext
Journal Article -
6
Algorithms for Balanced Graph Colorings with Applications in Parallel Computing
ISSN: 1045-9219, 1558-2183Veröffentlicht: New York IEEE 01.05.2017Veröffentlicht in IEEE transactions on parallel and distributed systems (01.05.2017)“… Graph coloring-in a generic sense-is used to identify subsets of independent tasks in parallel scientific computing applications …”
Volltext
Journal Article -
7
Software and Algorithms for Graph Queries on Multithreaded Architectures
ISBN: 1424409098, 9781424409099ISSN: 1530-2075Veröffentlicht: IEEE 01.03.2007Veröffentlicht in 2007 IEEE International Parallel and Distributed Processing Symposium (01.03.2007)“… Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency …”
Volltext
Tagungsbericht -
8
Multithreaded Algorithms for Maximum Matching in Bipartite Graphs
ISBN: 1467309753, 9781467309752ISSN: 1530-2075Veröffentlicht: IEEE 01.05.2012Veröffentlicht in 2012 IEEE 26th International Parallel and Distributed Processing Symposium (01.05.2012)“… We design, implement, and evaluate algorithms for computing a matching of maximum cardinality in a bipartite graph on multicore and massively multithreaded computers …”
Volltext
Tagungsbericht -
9
Multithreaded Algorithms for Matching in Graphs with Application to Data Analysis in Flow Cytometry
ISBN: 1467309745, 9781467309745Veröffentlicht: IEEE 01.05.2012Veröffentlicht in 2012 26th IEEE International Parallel and Distributed Processing Symposium Workshops (01.05.2012)“… 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 …”
Volltext
Tagungsbericht -
10
Graph Coloring Algorithms for Muti-core and Massively Multithreaded Architectures
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 16.05.2012Veröffentlicht in arXiv.org (16.05.2012)“… computing, distance-1 graph coloring. We introduce two different kinds of multithreaded heuristic algorithms for the stated, NP-hard, problem …”
Volltext
Paper -
11
A Novel Multithreaded Algorithm for Extracting Maximal Chordal Subgraphs
ISBN: 9781467325080, 1467325082ISSN: 0190-3918Veröffentlicht: IEEE 01.09.2012Veröffentlicht in 2012 41st International Conference on Parallel Processing (01.09.2012)“… In this paper, we present a novel multithreaded algorithm to extract a maximal chordal sub graph from a general graph …”
Volltext
Tagungsbericht -
12
On parallel push–relabel based algorithms for bipartite maximum matching
ISSN: 0167-8191, 1872-7336Veröffentlicht: Elsevier B.V 01.07.2014Veröffentlicht in Parallel computing (01.07.2014)“… •Competitive with the parallel Pothen–Fan algorithm. We study multithreaded push–relabel based algorithms for computing maximum cardinality matching in bipartite graphs …”
Volltext
Journal Article -
13
Competing all-pairs shortest paths algorithms for sparse / dense graphs: implementation and comparison
ISSN: 2309-4923, 2414-0481Veröffentlicht: Belarusian National Technical University 30.12.2024Veröffentlicht in Sistemnyĭ analiz i prikladnai͡a︡ informatika. (30.12.2024)“… 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 …”
Volltext
Journal Article -
14
An Unequal Caching Strategy for Shared-Memory Graph Analytics
ISSN: 1045-9219, 1558-2183Veröffentlicht: IEEE 01.03.2023Veröffentlicht in IEEE transactions on parallel and distributed systems (01.03.2023)“… When a graph analytics algorithm is multithreaded, the thread time is highly diversified, indicating an uneven work distribution …”
Volltext
Journal Article -
15
Inexact subgraph isomorphism in MapReduce
ISSN: 0743-7315, 1096-0848Veröffentlicht: Amsterdam Elsevier Inc 01.02.2013Veröffentlicht in Journal of parallel and distributed computing (01.02.2013)“… 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 …”
Volltext
Journal Article -
16
Fast Lagrangian Relaxation-Based Multithreaded Gate Sizing Using Simple Timing Calibrations
ISSN: 0278-0070, 1937-4151Veröffentlicht: New York IEEE 01.07.2020Veröffentlicht in IEEE transactions on computer-aided design of integrated circuits and systems (01.07.2020)“… Our gate sizer is multithreaded and is equipped with parallelization enabling techniques, namely mutual exclusion edge (MEE …”
Volltext
Journal Article -
17
An Optimal Vector Clock Algorithm for Multithreaded Systems
ISSN: 2575-8411Veröffentlicht: IEEE 01.07.2019Veröffentlicht in Proceedings of the International Conference on Distributed Computing Systems (01.07.2019)“… 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 …”
Volltext
Tagungsbericht -
18
Magiclock: Scalable Detection of Potential Deadlocks in Large-Scale Multithreaded Programs
ISSN: 0098-5589, 1939-3520Veröffentlicht: IEEE 01.03.2014Veröffentlicht in IEEE transactions on software engineering (01.03.2014)“… (containing no deadlock occurrence) of large-scale multithreaded programs. Magiclock iteratively eliminates removable lock dependencies before potential deadlock localization …”
Volltext
Journal Article -
19
Parallel multithreaded IDA heuristic search: algorithm design and performance evaluation
ISSN: 1744-5760, 1744-5779Veröffentlicht: Abingdon Taylor & Francis Group 01.02.2011Veröffentlicht in International journal of parallel, emergent and distributed systems (01.02.2011)“… Based on these facts, this paper presents a parallel multithreaded approach for the well-known iterative deepening A* (IDA …”
Volltext
Journal Article -
20
An Asynchronous Multithreaded Algorithm for the Maximum Network Flow Problem with Nonblocking Global Relabeling Heuristic
ISSN: 1045-9219, 1558-2183Veröffentlicht: New York IEEE 01.06.2011Veröffentlicht in IEEE transactions on parallel and distributed systems (01.06.2011)“… In this paper, we present a novel asynchronous multithreaded algorithm for the maximum network flow problem …”
Volltext
Journal Article

