NDLI: Multi-core on-the-fly SCC decomposition

Please wait, while we are loading the content...

Coarse grain parallelization of deep neural networks

Declarative coordination of graph-based parallel programs

Articulation points guided redundancy elimination for betweenness centrality

Gunrock: a high-performance graph processing library on the GPU

Adding approximate counters

Optimistic concurrency with OPTIK

Be my guest: MCS lock now welcomes guests

Benchmarking weak memory models

ESTIMA: extrapolating scalability of in-memory applications

Affinity-aware work-stealing for integrated CPU-GPU processors

High performance model based image reconstruction

Distributed Halide

Multi-core on-the-fly SCC decomposition

A wait-free queue as fast as fetch-and-add

Refined transactional lock elision

Contention-conscious, locality-preserving locks

The virtues of conflict: analysing modern concurrency

Grain graphs: OpenMP performance analysis made easy

An interval constrained memory allocator for the Givy GAS runtime

Exploiting accelerators for efficient high dimensional similarity search

Parallel type-checking with haskell using saturating LVars and stream generators

A high-performance parallel algorithm for nonnegative matrix factorization

Keep calm and react with foresight: strategies for low-latency and energy-efficient elastic data stream processing

Lease/release: architectural support for scaling contended data structures

Drinking from both glasses: combining pessimistic and optimistic tracking of cross-thread dependences

DomLock: a new multi-granularity locking technique for hierarchies

Causal consistency: beyond memory

Production-guided concurrency debugging

A programming system for future proofing performance critical libraries

AUTOGEN: automatic discovery of cache-oblivious parallel recursive algorithms for solving dynamic programs

Work stealing for interactive services to meet target latency

A scalable lock-free hash table with open addressing

Concurrent hash tables: fast and general?(!)

CUDA acceleration for Xen virtual machines in infiniband clusters with rCUDA

Effect of portable fine-grained locality on energy efficiency and performance in concurrent search trees

Efficient distributed workstealing via matchmaking

Data-centric combinatorial optimization of parallel code

DSMR: a shared and distributed memory algorithm for single-source shortest path problem

Generic messages: capability-based shared memory parallelism for event-loop systems

Hybrid CPU-GPU scheduling and execution of tree traversals

Improving efficacy of internal binary search trees using local recovery

Merge-based sparse matrix-vector multiplication (SpMV) using the CSR storage format

NUMA-aware scheduling and memory allocation for data-flow task-parallel applications

On designing NUMA-aware concurrency control for scalable transactional memory

On ordering transaction commit

OPR: deterministic group replay for one-sided communication

Preemption-aware planning on big-data systems

Samsara parallel: a non-BSP parallel-in-time model

Scalable adaptive NUMA-aware lock: combining local locking and remote locking for efficient concurrency

SPIRIT: a runtime system for distributed irregular tree applications

Tidex: a mutual exclusion lock

Unifying fixed code and fixed data mapping of load-imbalanced pipelined loops

User-assisted storage reuse determination for dynamic task graphs

Verification of MPI Java programs using software model checking

Multi-core on-the-fly SCC decomposition

Content Provider	ACM Digital Library
Author	Bloemen, Vincent Laarman, Alfons van de Pol, Jaco
Abstract	The main advantages of Tarjan's strongly connected component (SCC) algorithm are its linear time complexity and ability to return SCCs on-the-fly, while traversing or even generating the graph. Until now, most parallel SCC algorithms sacrifice both: they run in quadratic worst-case time and/or require the full graph in advance. The current paper presents a novel parallel, on-the-fly SCC algorithm. It preserves the linear-time property by letting workers explore the graph randomly while carefully communicating partially completed SCCs. We prove that this strategy is correct. For efficiently communicating partial SCCs, we develop a concurrent, iterable disjoint set structure (combining the union-find data structure with a cyclic list). We demonstrate scalability on a 64-core machine using 75 real-world graphs (from model checking and explicit data graphs), synthetic graphs (combinations of trees, cycles and linear graphs), and random graphs. Previous work did not show speedups for graphs containing a large SCC. We observe that our parallel algorithm is typically 10-30× faster compared to Tarjan's algorithm for graphs containing a large SCC. Comparable performance (with respect to the current state-of-the-art) is obtained for graphs containing many small SCCs.
Starting Page	1
Ending Page	12
Page Count	12
File Format	PDF
ISBN	9781450340922
DOI	10.1145/2851141.2851161
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2016-02-27
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Scc Graph Keywords strongly connected components Multi-core Depth-first search Parallel Digraph Algorithm Union-find
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in